Problems # Status Problem Level Completes Likes 71 Sort Map as per values - Java Program Medium % 0 72 Two Sum Problem Beginner % 0 73 Find if any two intervals overlap in given intervals Medium % 1 74 Given an array, find the number of all pairs with odd sum. Medium % 0 75 Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium % 0 76 Print all steps to convert one string to another string Medium % 0 77 Lexicographically next permutation With One swap Medium % 0 78 Find all subsets of size K from a given number N (1 to N) Medium % 0 79 Sum of distinct elements among two given sets Beginner % 0 80 Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed Medium % 0 81 Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard % 0 82 Insert a node in the given sorted linked list. Beginner % 0 83 Construct the largest number from the given array. Medium % 0 84 Given an array, find three-element sum closest to Zero Medium % 0 85 Print sorted unique elements of a given array Beginner % 0 86 Given an array, print all unique subsets with a given sum. Medium % 0 87 Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K. Medium % 0 88 Replace array elements with maximum element on the right. Medium % 0 89 Find all unique combinations of numbers (from 1 to 9 ) with sum to N Medium % 0 90 Number of Intervals in which given value lies Beginner % 0 91 Activity Selection Problem Medium % 0 92 Find the sum of overlapping elements in two sets Beginner % 0 93 Given two coordinates, Print the line equation Beginner % 0 94 Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Hard % 0 95 Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Medium % 0 96 Check If Given Undirected Graph is a tree Medium % 0 97 Print all middle elements of the given matrix/2D array. Beginner % 0 98 Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Beginner % 0 99 Articulation Points OR Cut Vertices in a Graph Hard % 0 100 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 101 Find the number of distinct Islands OR connected components. Hard % 1 102 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 103 Given an array, Print sum of all subsets Beginner % 0 104 Determine the given routing number belong to which bank Medium % 0 105 Check if interval is covered in given coordinates Medium % 0 Sort Map as per values - Java Program Two Sum Problem Find if any two intervals overlap in given intervals Given an array, find the number of all pairs with odd sum. Given an array, find all unique subsets with a given sum with allowed repeated digits. Print all steps to convert one string to another string Lexicographically next permutation With One swap Find all subsets of size K from a given number N (1 to N) Sum of distinct elements among two given sets Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed Stable Marriage Problem - Gale–Shapley Algorithm - Java Insert a node in the given sorted linked list. Construct the largest number from the given array. Given an array, find three-element sum closest to Zero Print sorted unique elements of a given array Given an array, print all unique subsets with a given sum. Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K. Replace array elements with maximum element on the right. Find all unique combinations of numbers (from 1 to 9 ) with sum to N Number of Intervals in which given value lies Activity Selection Problem Find the sum of overlapping elements in two sets Given two coordinates, Print the line equation Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS) Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Check If Given Undirected Graph is a tree Print all middle elements of the given matrix/2D array. Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Articulation Points OR Cut Vertices in a Graph Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Find the number of distinct Islands OR connected components. Print All Paths in Dijkstra's Shortest Path Algorithm Given an array, Print sum of all subsets Determine the given routing number belong to which bank Check if interval is covered in given coordinates 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
