# Status Problem video Level Completes Likes 392 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 376 Collatz Conjecture - Steps to transform Number to 1 Beginner % 0 353 Reverse a given number Beginner % 1 343 Generate all the strings of length n from 0 to k-1 Medium % 0 308 Print Numbers from 1 to N without using loop Beginner % 0 290 Reverse a String using Recursion Beginner % 0 280 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 267 Graph – Depth First Search using Recursion Beginner % 1 253 Print all subarrays of a given array Medium % 1 252 Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Hard % 0 249 Divide and Conquer - Rearrange array elements in special order Medium % 0 233 Find the local minima in a given array Medium % 0 231 Check if array is sorted using recursion Beginner % 0 222 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 221 Identifying Maximum Gain from Sequential Elements Medium % 0 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 190 Swap Nodes in pairs in a Linked List by changing links Medium % 0 189 Convert BST to Greater Sum Tree Medium % 0 186 Reverse a Linked List in groups of given size 'K' Medium % 0 184 Get the Sum of all left leaves in a Binary tree Beginner % 1 Reverse a Stack using recursion - In Place (Without using extra memory) Collatz Conjecture - Steps to transform Number to 1 Reverse a given number Generate all the strings of length n from 0 to k-1 Print Numbers from 1 to N without using loop Reverse a String using Recursion Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Graph – Depth First Search using Recursion Print all subarrays of a given array Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Divide and Conquer - Rearrange array elements in special order Find the local minima in a given array Check if array is sorted using recursion Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Identifying Maximum Gain from Sequential Elements Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Swap Nodes in pairs in a Linked List by changing links Convert BST to Greater Sum Tree Reverse a Linked List in groups of given size 'K' Get the Sum of all left leaves in a Binary tree 1 2 3 4 5 6 7 8
