Solved 160 DSA problems & earned my certificate! 🏆 Skills need certification to shine. "Correct" felt amazing, "Wrong" pushed me harder. Thanks, @geeksforgeeks #GFG160Days #DSA #TechJourney #CertificateEarned #geekstreak2024 #GeeksForGeeks

🔥Day 143 OF #geeksforgeeks #POTD .✅Mobile numeric keypad.Approach-Recursion got TLE.O(5^n) Time and O(n) Space.😀Approach-Top-Down DP (Memoization).O(n) Time and O(n) Space

🔥Day 142 OF #geeksforgeeks #POTD .✅Game with String.Approach-Frequency Count Reduction via Sorting.Time Complexity: O(n + k * 26 log 26),.Space: O(1)

🔥Day 139, 140 & 141 OF #geeksforgeeks #POTD.✅Minimum sum.Approach-Count Array.O(n) T & S.✅Lexicographically Largest String After K Deletion.Approach-Stack-Based Subsequence Selection.O(n) T & S.✅Check if frequencies can be equal.Approach-Two Map & Frequency Counting.O(n) T &S

🔥Day 136, 137 & 138 OF #geeksforgeeks #POTD.✅Group Balls by Sequence.Approach-Sorting then Searching for k consecutive elements - O(nlog(n)) T & O(1) S.✅Police and Thieves.Approach-Two Pointer.O(n) T & O(1) S.✅Largest Divisible Subset.Approach-Top-Down DP.O(n^2) T and O(n) S

🔥Day 134 and 135 OF #geeksforgeeks #POTD .✅All Palindromic Partitions.Approach- Backtracking with Memoization.T: O(n² + 2n×n),S: O(n2).✅Case-specific Sorting of Strings.Approach-Using 2 Arrays + Sorting .O(nlog(n)) T & O(n) S

🔥Day 131 and 132 and 133 OF #geeksforgeeks #POTD ✅Smallest Divisor.Approach- Binary Search.O(n*log(max(arr))) T & O(1) S.✅Equalize the Towers.Approach- Binary Search.O(n*log(max(heights[i]))) T & O(1) S.✅Coin Piles.Approach-Binary Search and Prefix Sum.O(n*log(n)) T & O(n) S

🔥Day 130 OF #geeksforgeeks #POTD .✅Symmetric Tree.Approach- Recursion.O(n) Time and O(h) Space

🔥Day 127 and 128 and 129 OF #geeksforgeeks #POTD ✅Remove the balls.Approach- Stack.O(n) time and space .✅K closest elements.Approach-Linear Search.O(n) time and O(k) space.✅Koko Eating Bananas.Approach- Binary Search .O(n * log m) time and O(1) space

🔥Day 124 and 125 and 126 OF #geeksforgeeks #POTD ✅Sum-string.Approach- prefix combinations and doing string addition/comparisons recursively. O(n^3)T & O(n) S.✅BST with Dead End.Approach- Recursion.O(n * h) T & O(h) S.✅Exactly one swap.Approach-Frequency Array.O(n)T& O(1) S

🔥Day 121 and 122 and 123 OF #geeksforgeeks #POTD ✅Count the paths.Approach- DFS + DP .O(V + E) time and O(V) space.✅Search Pattern .Approach- Rabin-Karp Algorithm.O(n*m). Time and O(1) Space .✅Longest Span in two Binary Arrays.Approach- HashMap.O(n)Time and Space

🔥Day 120 OF #geeksforgeeks #POTD .✅LCS of three strings.Approach- Recursion with Memoization .O(n1*n2*n3) Time and O(n1*n2*n3) Space.

🔥Day 118 and 119 OF #geeksforgeeks #POTD.✅Unique Paths in a Grid.Approach- Recursion with Memoization.O(n*m) Time and O(n*m) Space.✅Substrings with K Distinct.Approach- Sliding Window.O(n) time and O(1) space

🔥Day 117 OF #geeksforgeeks #POTD.✅Count pairs Sum in matrices.Approach-.Brute Force-Check mat1[i][j]+mat[k][l]==x then count++.O(n^4) T&O(1)S.Hash Set -store all element of mat2 in Set then traverse on mat1 each ele and check if (x - ele)exists in the Set do count++.O(n^2) T &S

🔥Day 116 OF #geeksforgeeks #POTDClosest .✅Kth element in Matrix. Approach-. Sorting- store all element of matrix in array and sort the array then get the kth element.O(n^2 * log(n^2)) T &O(n) S.Priority Queue –Max heap used .O(n^2 * log(k)) T &O(k) S

🔥Day 115 OF #geeksforgeeks #POTD.Closest Neighbour in BST.Approach- Recursion.O(h) Time and O(h) Space

🔥Day 114 OF #geeksforgeeks #POTD .✅Sum of nodes on the longest path.Approach-.Recursive -recursively traverses the tree, adding node values to a running sum and incrementing the path length.O(n) Time and O(h) Space

🔥Day 113 OF #geeksforgeeks #POTD .✅Find rectangle with corners as 1.Approach.Brute Force- Check Every Submatrix.O((n^2)*(m^2)) Time and O(1) Space.Hashing - hashing to avoid checking every submatrix explicitly. O(n*(m^2)) Time and O(n*m) Space

🔥Day 112 OF #geeksforgeeks #POTD .✅Print leaf nodes from preorder traversal of BST Approach-Stack.Taking benefit of BST and Used Stack.O(n) Time and O(n) Space

🔥Day 111 OF #geeksforgeeks #POTD .✅Sorted insert for circular linked list.Approach.Brute Force-.3 cases.insert at start if data is less than all element.insert at middle if left half is less and right half greater .insert at end if data is greater than all element.O(n)T&O(1)S

🔥Day 110 OF #geeksforgeeks #POTD .✅Pythagorean Triplet.Approach-.Brute force - 1010/1115 test case pass.O(n^3) Time and O(1) Space.Hashing - Accepted. O(n^2) Time and O(n) Space