# 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
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
280

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Hard % 0
275

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
274

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
273

Graph – Detect Cycle in a Directed Graph

Medium % 1
271

Snake and Ladder Problem

Hard % 1
261

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Hard % 0
194

Introduction to Threaded Binary Tree

Medium % 0
165

Generate all combinations of length N

Hard % 0
161

The Word Break Problem

Hard % 0
158

Backtracking - Search a Word In a Matrix

Hard % 0
116

Generate All Balanced Parentheses Combinations (N Pairs)

Medium % 1
106

Reverse a Doubly-Linked List (In-place Algorithm)

Medium % 0
99

Construct a binary tree from given Inorder and Level Order Traversal

Hard % 0
48

Determining Whether a Given Binary Tree is a Binary Search Tree (BST)

Medium % 1

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

Valid Brackets – Part 2 | Stack Method

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Graph – Detect Cycle in a Directed Graph using colors

Graph – Detect Cycle in an Undirected Graph using DFS

Graph – Detect Cycle in a Directed Graph

Snake and Ladder Problem

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Introduction to Threaded Binary Tree

Generate all combinations of length N

The Word Break Problem

Backtracking - Search a Word In a Matrix

Generate All Balanced Parentheses Combinations (N Pairs)

Reverse a Doubly-Linked List (In-place Algorithm)

Construct a binary tree from given Inorder and Level Order Traversal

Determining Whether a Given Binary Tree is a Binary Search Tree (BST)