# Status Problem video Level Completes Likes 442 Find the number of distinct Islands OR connected components. Hard % 0 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 416 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 390 Convert Prefix to Postfix Expression Medium % 0 387 Convert Postfix to Prefix Expression Medium % 0 377 Convert Postfix to Infix Expression Medium % 0 371 Convert Infix to Prefix Expression Medium % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 209 Find longest Snake sequence in a given matrix Medium % 1 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 186 Reverse a Linked List in groups of given size 'K' Medium % 0 174 Dynamic Programming - Maximum Product Cutting Problem Medium % 1 167 Generate Well Ordered Passwords of a Given Length K Medium % 0 166 All N Length Strings from Given String of Length K Medium % 0 165 Generate all combinations of length N Hard % 0 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 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 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Convert Prefix to Postfix Expression Convert Postfix to Prefix Expression Convert Postfix to Infix Expression Convert Infix to Prefix Expression Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Find longest Snake sequence in a given matrix Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Kadane's Algorithm - Maximum Subarray Problem Reverse a Linked List in groups of given size 'K' Dynamic Programming - Maximum Product Cutting Problem Generate Well Ordered Passwords of a Given Length K All N Length Strings from Given String of Length K Generate all combinations of length N Dynamic Programming - Maximum size square sub-matrix with all 1s 1 2
