RGRajesh Gurajalainlearning-dsa.hashnode.dev·Sep 27, 2025 · 4 min readRecursionA function calls itself until specific condition is met. Example: void print(int now, int target){ if(now==target) return; cout<<now<<endl; print(now+1, target); } int main(){ print(1,11); return 0; } What if there’s no if condi...00
CDChetan Dattainchetan77.hashnode.dev·Aug 25, 2024 · 3 min readSubsequence Patterns | Power Set | SubsetsPattern 1 - Find all Subsequences Given an integer array nums of unique elements, return all possible (link) subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. Example 1: Input: nums = [1,2...00
