# Status Problem Level Completes Likes 1 Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium % 0 2 Lexicographically next permutation With One swap Medium % 1 3 Find the number of distinct Islands OR connected components. Hard % 0 4 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 5 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 6 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 7 Convert Prefix to Postfix Expression Medium % 0 8 Sort a given stack - Using Temporary Stack Medium % 0 9 Convert Postfix to Prefix Expression Medium % 0 10 Convert Integer to Roman Medium % 0 11 Convert Postfix to Infix Expression Medium % 0 12 Convert Infix to Prefix Expression Medium % 0 13 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 14 Convert Infix to Postfix Expression Medium % 0 15 Evaluation of Infix expressions Medium % 0 16 Convert Prefix to Infix Expression Medium % 0 17 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Hard % 0 18 Merge K sorted Linked List - Using Priority Queue Hard % 0 19 Valid Brackets – Part 2 | Stack Method Beginner % 0 20 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Hard % 0 21 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 22 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 23 Snake and Ladder Problem Hard % 1 24 Majority Element- Boyer–Moore majority vote algorithm Medium % 0 25 Majority Element – Part 1 Beginner % 0 26 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 27 Find two elements whose sum is closest to zero Medium % 1 28 Find the first repeating character in a given string Beginner % 0 29 Find longest Snake sequence in a given matrix Medium % 1 30 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 31 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 32 Print All Diagonals of a given matrix Medium % 1 33 Dynamic Programming - Highway Billboard Problem Hard % 0 34 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 35 Reverse a Linked List in groups of given size 'K' Medium % 0 Given an array, find all unique subsets with a given sum with allowed repeated digits. Lexicographically next permutation With One swap Find the number of distinct Islands OR connected components. Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Evaluation of Prefix Expressions (Polish Notation) | Set 2 Reverse a Stack using recursion - In Place (Without using extra memory) Convert Prefix to Postfix Expression Sort a given stack - Using Temporary Stack Convert Postfix to Prefix Expression Convert Integer to Roman Convert Postfix to Infix Expression Convert Infix to Prefix Expression Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Merge K sorted Linked List - Using Priority Queue Valid Brackets – Part 2 | Stack Method Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Graph – Detect Cycle in a Directed Graph using colors Snake and Ladder Problem Majority Element- Boyer–Moore majority vote algorithm Majority Element – Part 1 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Find two elements whose sum is closest to zero Find the first repeating character in a given string Find longest Snake sequence in a given matrix Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Print All Diagonals of a given matrix Dynamic Programming - Highway Billboard Problem Kadane's Algorithm - Maximum Subarray Problem Reverse a Linked List in groups of given size 'K' 1 2
