# Status Problem video Level Completes Likes
426

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Hard % 0
421

Sort a given stack - Using Recursion

Hard % 1
416

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
409

Minimum Boats Required to rescue people

Medium % 0
407

Integer Replacement Problem

Medium % 0
401

Introduction to Bipartite Graphs OR Bigraphs

Medium % 0
387

Convert Postfix to Prefix Expression

Medium % 0
377

Convert Postfix to Infix Expression

Medium % 0
373

Longest substring with at most two unique characters

Medium % 0
371

Convert Infix to Prefix Expression

Medium % 0
368

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 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
347

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Hard % 0
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
338

Find Number of reverse pairs in an array

Hard % 1
330

Check if Given Number is power of 2

Beginner % 1
325

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Medium % 1
313

Check if two Strings are equal without using built-in function

Beginner % 0
296

Replace all vowels with next consonant in a given string

Medium % 0
293

Convert Number to base 3 String Representation

Beginner % 1
271

Snake and Ladder Problem

Hard % 1
263

Minimum Copy Paste Operations

Medium % 0
246

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
245

Dynamic programming – Printer Problem | Leetcode

Hard % 0
233

Find the local minima in a given array

Medium % 0
203

Dynamic Programming - Coin In a Line Game Problem

Hard % 0
201

Dynamic Programming - Split the String into Minimum number of Palindromes.

Hard % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
188

Shortest Range in K-sorted Lists

Hard % 1
173

Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming)

Hard % 0

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Sort a given stack - Using Recursion

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Minimum Boats Required to rescue people

Integer Replacement Problem

Introduction to Bipartite Graphs OR Bigraphs

Convert Postfix to Prefix Expression

Convert Postfix to Infix Expression

Longest substring with at most two unique characters

Convert Infix to Prefix Expression

Max Flow Problem - Ford-Fulkerson Algorithm

Evaluation of Infix expressions

Convert Prefix to Infix Expression

Merge K sorted Linked List - Using Priority Queue

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Valid Brackets – Part 2 | Stack Method

Find Number of reverse pairs in an array

Check if Given Number is power of 2

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Check if two Strings are equal without using built-in function

Replace all vowels with next consonant in a given string

Convert Number to base 3 String Representation

Snake and Ladder Problem

Minimum Copy Paste Operations

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem | Leetcode

Find the local minima in a given array

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Split the String into Minimum number of Palindromes.

Kadane's Algorithm - Maximum Subarray Problem

Shortest Range in K-sorted Lists

Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming)