# Status Problem video Level Completes Likes
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
215

Find duplicates in an given array in O(n) time and O(1) space

Medium % 0
200

Dynamic Programming - Highway Billboard Problem

Hard % 0
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
174

Dynamic Programming - Maximum Product Cutting Problem.

Medium % 1
167

Generate Well Ordered Passwords of a Given Length K

Medium % 0
161

The Word Break Problem

Hard % 0
159

Backtracking - Knight's Tour Problem

Hard % 0
145

Dynamic Programming - Minimum Coin Change Problem

Medium % 1
106

Reverse The Doubly Linked List

Medium % 0
22

Find Intersection Point in Two Linked Lists

Medium % 0

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

Find duplicates in an given array in O(n) time and O(1) space

Dynamic Programming - Highway Billboard Problem

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Maximum Product Cutting Problem.

Generate Well Ordered Passwords of a Given Length K

The Word Break Problem

Backtracking - Knight's Tour Problem

Dynamic Programming - Minimum Coin Change Problem

Reverse The Doubly Linked List

Find Intersection Point in Two Linked Lists