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 274 Graph – Detect Cycle in an Undirected Graph using DFS Medium % 0 273 Graph – Detect Cycle in a Directed Graph Medium % 1 272 Graph – Software Installation Problem Medium % 0 271 Snake and Ladder Problem Hard % 1 270 Weighted Graph Implementation – JAVA Beginner % 1 269 Graph – Depth First Search in Disconnected Graph Medium % 1 268 Topological Sort Medium % 1 267 Graph – Depth First Search using Recursion Beginner % 1 266 Graph Implementation – Adjacency Matrix | Set 3 Beginner % 1 265 Java Pair Class Beginner % 0 264 Graph Implementation – Adjacency List - Better| Set 2 Beginner % 0 263 Minimum Copy Paste Operations Medium % 0 262 Count and print all Subarrays with product less than K in O(n) Hard % 0 261 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 260 Deque Implementation – Java Beginner % 0 259 Print all sub sequences of a given String Medium % 0 258 Graph – Print all paths between source and destination Medium % 1 257 Graph – Depth First Traversal Medium % 2 256 Print all sub sequences of a given array Hard % 0 255 Print all substrings of a given string Medium % 0 254 Sum of all sub arrays in O(n) Time Hard % 0 253 Print all subarrays of a given array Medium % 0 252 Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Hard % 0 251 Dynamic Programming - Egg Dropping Problem Hard % 0 250 Nuts & Bolts Problem (Lock & Key problem) Beginner % 0 249 Divide and Conquer - Rearrange array elements in special order Medium % 0 248 Remove Duplicates from a string | 4 Approaches Medium % 0 247 Find median of two sorted arrays of same size Medium % 0 246 Dynamic programming – Minimum Jumps to reach to end Hard % 0 245 Dynamic programming – Printer Problem | Leetcode Hard % 0 244 Dynamic programming - Remove Boxes Problem | leetcode Hard % 0 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 242 Find the Bit Flips Needed: Convert One Binary Number to Another Beginner % 1 241 Separate even and odd integers in a given array Beginner % 0 240 All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Hard % 1 Graph – Detect Cycle in an Undirected Graph using DFS Graph – Detect Cycle in a Directed Graph Graph – Software Installation Problem Snake and Ladder Problem Weighted Graph Implementation – JAVA Graph – Depth First Search in Disconnected Graph Topological Sort Graph – Depth First Search using Recursion Graph Implementation – Adjacency Matrix | Set 3 Java Pair Class Graph Implementation – Adjacency List - Better| Set 2 Minimum Copy Paste Operations Count and print all Subarrays with product less than K in O(n) Sliding Window Algorithm (Track the maximum of each subarray of size k) Deque Implementation – Java Print all sub sequences of a given String Graph – Print all paths between source and destination Graph – Depth First Traversal Print all sub sequences of a given array Print all substrings of a given string Sum of all sub arrays in O(n) Time Print all subarrays of a given array Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Dynamic Programming - Egg Dropping Problem Nuts & Bolts Problem (Lock & Key problem) Divide and Conquer - Rearrange array elements in special order Remove Duplicates from a string | 4 Approaches Find median of two sorted arrays of same size Dynamic programming – Minimum Jumps to reach to end Dynamic programming – Printer Problem | Leetcode Dynamic programming - Remove Boxes Problem | leetcode Find two non-repeating numbers in an array in O(n) time and O(1) space Find the Bit Flips Needed: Convert One Binary Number to Another Separate even and odd integers in a given array All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
