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

Check if Given Number is power of 2

Beginner % 1
208

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

Medium % 1
148

Backtracking - SUDOKU Solver

Hard % 0

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

Convert Infix to Postfix Expression

Evaluation of Infix expressions

Convert Prefix to Infix Expression

Valid Brackets – Part 2 | Stack Method

Check if Given Number is power of 2

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

Backtracking - SUDOKU Solver