# Status Problem video Level Completes Likes
466

Lexicographically next permutation With One swap

Medium % 1
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
368

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
365

Convert Infix to Postfix Expression

Medium % 0
363

Evaluation of Infix expressions

Medium % 0
361

Convert Prefix to Infix Expression

Medium % 0
359

Merge K sorted Linked List - Using Priority Queue

Hard % 0
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
254

Sum of all sub arrays in O(n) Time

Hard % 0
251

Dynamic Programming - Egg Dropping Problem

Hard % 0
225

Swap two numbers without using extra variable

Beginner % 0
223

Stock Single Sell Problem - Dynamic Programming - O(n)

Medium % 2
222

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Hard % 0
208

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Medium % 1
199

Dynamic Programming - Maximum Subarray Problem

Medium % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
195

Single Threaded Binary Tree Complete Implementation

Hard % 0
185

Generate Maximum revenue by selling K tickets from N windows

Medium % 0

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

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

Max Flow Problem - Ford-Fulkerson Algorithm

Convert Infix to Postfix Expression

Evaluation of Infix expressions

Convert Prefix to Infix Expression

Merge K sorted Linked List - Using Priority Queue

Valid Brackets – Part 2 | Stack Method

Sum of all sub arrays in O(n) Time

Dynamic Programming - Egg Dropping Problem

Swap two numbers without using extra variable

Stock Single Sell Problem - Dynamic Programming - O(n)

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Dynamic Programming - Maximum Subarray Problem

Kadane's Algorithm - Maximum Subarray Problem

Single Threaded Binary Tree Complete Implementation

Generate Maximum revenue by selling K tickets from N windows