# Status Problem video Level Completes Likes 286 Introduction to Minimum Spanning Tree (MST) Medium % 0 277 Graph – Count all paths between source and destination Medium % 1 276 Graph – Find Number of non reachable vertices from a given vertex Medium % 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 269 Graph – Depth First Search in Disconnected Graph Medium % 1 268 Topological Sort Medium % 1 263 Minimum Copy Paste Operations Medium % 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 255 Print all substrings of a given string Medium % 0 253 Print all subarrays of a given array Medium % 1 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 239 Find local minimum or local maximum in O(1) Medium % 0 235 Majority Element- Boyer–Moore majority vote algorithm Medium % 0 233 Find the local minima in a given array Medium % 0 Introduction to Minimum Spanning Tree (MST) Graph – Count all paths between source and destination Graph – Find Number of non reachable vertices from a given vertex Graph – Detect Cycle in an Undirected Graph using DFS Graph – Detect Cycle in a Directed Graph Graph – Software Installation Problem Graph – Depth First Search in Disconnected Graph Topological Sort Minimum Copy Paste Operations Print all sub sequences of a given String Graph – Print all paths between source and destination Graph – Depth First Traversal Print all substrings of a given string Print all subarrays of a given array 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 Find local minimum or local maximum in O(1) Majority Element- Boyer–Moore majority vote algorithm Find the local minima in a given array 1 2 3 4 5 6 7 8 9 10 11 12
