# Status Problem Level Completes Likes 36 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Hard % 0 37 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Hard % 1 38 Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Hard % 0 39 Prim’s Algorithm - Minimum Spanning Tree (MST) Hard % 0 40 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 41 Disjoint Set | Union-Find Algorithm - Union by rank and path compression Hard % 0 42 Disjoint Set Data Structure - Union Find Algorithm Hard % 0 43 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 44 Snake and Ladder Problem Hard % 1 45 Count and print all Subarrays with product less than K in O(n) Hard % 0 46 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 47 Print all sub sequences of a given array Hard % 0 48 Sum of all sub arrays in O(n) Time Hard % 0 49 Text Justification Problem (OR Word Wrap Problem) Hard % 0 50 Dynamic Programming - Egg Dropping Problem Hard % 0 51 Dynamic programming – Minimum Jumps to reach to end Hard % 0 52 Dynamic programming – Printer Problem Hard % 0 53 Dynamic programming - Remove Boxes Problem Hard % 0 54 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 55 All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Hard % 1 56 Stock Single Sell Problem - O(n) Solution Hard % 2 57 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 58 k-Nearest Neighbors Hard % 0 59 Dynamic Programming - Edit Distance Problem Hard % 2 60 Dynamic Programming - Coin In a Line Game Problem Hard % 0 61 Dynamic Programming - Box Stacking Problem Hard % 0 62 Dynamic Programming - Split the String into Minimum number of Palindromes. Hard % 0 63 Dynamic Programming - Highway Billboard Problem Hard % 0 64 Convert Binary Tree into Threaded Binary Tree Hard % 0 65 Double Threaded Binary Tree Complete Implementation Hard % 0 66 Single Threaded Binary Tree Complete Implementation Hard % 0 67 Shortest Range in K-sorted Lists Hard % 1 68 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 69 Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Hard % 0 70 Print All N Length Strings from Given Number K Hard % 0 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix Prim’s Algorithm - Minimum Spanning Tree (MST) Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Disjoint Set | Union-Find Algorithm - Union by rank and path compression Disjoint Set Data Structure - Union Find Algorithm Graph – Detect Cycle in a Directed Graph using colors Snake and Ladder Problem 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) Print all sub sequences of a given array Sum of all sub arrays in O(n) Time Text Justification Problem (OR Word Wrap Problem) Dynamic Programming - Egg Dropping Problem Dynamic programming – Minimum Jumps to reach to end Dynamic programming – Printer Problem Dynamic programming - Remove Boxes Problem Find two non-repeating numbers in an array in O(n) time and O(1) space All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Stock Single Sell Problem - O(n) Solution Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer k-Nearest Neighbors Dynamic Programming - Edit Distance Problem Dynamic Programming - Coin In a Line Game Problem Dynamic Programming - Box Stacking Problem Dynamic Programming - Split the String into Minimum number of Palindromes. Dynamic Programming - Highway Billboard Problem Convert Binary Tree into Threaded Binary Tree Double Threaded Binary Tree Complete Implementation Single Threaded Binary Tree Complete Implementation Shortest Range in K-sorted Lists Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number Print All N Length Strings from Given Number K 1 2 3 4
