Sep 30, 2025 · 3 min read · In this article we will be solving few more problems on recursion. 1) Combination sum I class Solution { public: void combo(vector<vector<int>>&result, vector<int>a, vector<int>&v,int i, int n, int tot, int sum){ if(i==n){ if(tot==0) res...
Join discussionAug 18, 2025 · 1 min read · DEFINITION A simple way to define permutations is the rearrangement of elements inside of a variable. For exemplo, if it’s necessary to do a permutation in this numbers “123” we would get this result: 123132213231312321 6 possible permutations fo...
Join discussionApr 21, 2025 · 2 min read · When dealing with permutations of a string, one common issue arises: duplicates. For example, with input like "AAB", the total number of permutations would be 6 (3!), but many of them would be repeated. We aim to generate all unique permutations in l...
Join discussionJan 26, 2025 · 4 min read · An interesting Algo Problem i found on LeetCode is the next permutation problem. A permutation of an array of integers is an arrangement of its members into a sequence or linear order. For example, for arr = [1,2,3], the following are all the permut...
Join discussionJan 1, 2024 · 2 min read · Q19:The set [1, 2, 3, ..., n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order, we get the following sequence for n = 3: "123" "132" "213" "231" "312" "321" Given n and k, return the k<sup>t...
Join discussion
Jul 3, 2023 · 1 min read · Have you ever encountered a problem where you needed to explore all possible arrangements or orders of a set of elements? This task can become increasingly challenging as the number of possibilities grows. Fortunately, Python provides a powerful tool...
Join discussionJul 2, 2023 · 3 min read · Motivation Some time ago I would test how my code would behave for all combinations of a given input array. As it was not a crucial part of the system I was developing, I search for some libraries to perform this operation and save some development t...
Join discussion
Jan 26, 2023 · 1 min read · Question link: https://leetcode.com/problems/next-permutation/ Approach : Step 1: Linearly traverse array from backward such that ith index value of the array is less than (i+1)th index value. Store that index in a variable. Step 2: If the index valu...
Join discussion