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

Majority Element – Part 1

Beginner % 0
186

Reverse a Linked List in groups of given size 'K'

Medium % 0
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
133

Reverse Level Order Traversal of Binary Trees

Medium % 0
105

Swapping Nodes in a Linked List (Kth Position)

Medium % 0
77

Construct a binary tree from given Inorder and Postorder 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

Majority Element – Part 1

Reverse a Linked List in groups of given size 'K'

Dynamic Programming — Longest Palindromic Subsequence

Reverse Level Order Traversal of Binary Trees

Swapping Nodes in a Linked List (Kth Position)

Construct a binary tree from given Inorder and Postorder Traversal

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