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 276 Graph – Find Number of non reachable vertices from a given vertex Medium % 0 275 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 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 Graph – Find Number of non reachable vertices from a given vertex Graph – Detect Cycle in a Directed Graph using colors 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 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
