Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 369 Find duplicates Characters in the given String Beginner % 0 347 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Hard % 0 346 Valid Brackets – Part 2 | Stack Method Beginner % 0 339 Multiply with power of 2 without using pow() or * operator Beginner % 1 331 Find Largest and Smallest word in a given String Beginner % 0 325 Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium % 1 323 How to Reverse Text: Stack Method for String Reversal Beginner % 0 307 Swap two numbers using Bitwise XOR Operator Medium % 1 298 Left Shift (<<) and Right Shift (>>) Operators Beginner % 1 273 Graph – Detect Cycle in a Directed Graph Medium % 1 271 Snake and Ladder Problem Hard % 1 269 Graph – Depth First Search in Disconnected Graph Medium % 1 268 Topological Sort Medium % 1 266 Graph Implementation – Adjacency Matrix | Set 3 Beginner % 1 264 Graph Implementation – Adjacency List - Better| Set 2 Beginner % 0 258 Graph – Print all paths between source and destination Medium % 1 254 Sum of all sub arrays in O(n) Time Hard % 0 246 Dynamic programming – Minimum Jumps to reach to end Hard % 0 228 Find the only element in array which appears only once Beginner % 1 199 Dynamic Programming - Maximum Subarray Problem Medium % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 188 Shortest Range in K-sorted Lists Hard % 1 184 Get the Sum of all left leaves in a Binary tree Beginner % 1 179 Binary Tree Deletion Beginner % 0 176 Find the Size of a Binary Tree without Recursion Beginner % 0 175 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 172 Dynamic Programming - Longest Common Substring Medium % 0 171 Dynamic Programming - Longest Common Subsequence Medium % 0 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 161 The Word Break Problem Hard % 0 159 Solve the Knight's Tour with Backtracking Hard % 0 158 Backtracking - Search a Word In a Matrix Hard % 0 157 Backtracking - N Queens Problem - Better Solution Hard % 0 148 Solve Sudoku Puzzles with Backtracking Hard % 0 147 Introduction To Backtracking Programming Beginner % 0 Find duplicates Characters in the given String Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Valid Brackets – Part 2 | Stack Method Multiply with power of 2 without using pow() or * operator Find Largest and Smallest word in a given String Find no of reverse pairs in an array which is sorted in two parts in O(N) How to Reverse Text: Stack Method for String Reversal Swap two numbers using Bitwise XOR Operator Left Shift (<<) and Right Shift (>>) Operators Graph – Detect Cycle in a Directed Graph Snake and Ladder Problem Graph – Depth First Search in Disconnected Graph Topological Sort Graph Implementation – Adjacency Matrix | Set 3 Graph Implementation – Adjacency List - Better| Set 2 Graph – Print all paths between source and destination Sum of all sub arrays in O(n) Time Dynamic programming – Minimum Jumps to reach to end Find the only element in array which appears only once Dynamic Programming - Maximum Subarray Problem Kadane's Algorithm - Maximum Subarray Problem Shortest Range in K-sorted Lists Get the Sum of all left leaves in a Binary tree Binary Tree Deletion Find the Size of a Binary Tree without Recursion Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Dynamic Programming - Minimum Cost Path Problem The Word Break Problem Solve the Knight's Tour with Backtracking Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem - Better Solution Solve Sudoku Puzzles with Backtracking Introduction To Backtracking Programming 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
