# Status Problem video Level Completes Likes
365

Convert Infix to Postfix Expression

Medium % 0
363

Evaluation of Infix expressions

Medium % 0
361

Convert Prefix to Infix Expression

Medium % 0
360

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2

Hard % 0
359

Merge K sorted Linked List - Using Priority Queue

Hard % 0
354

Valid Multiple Parentheses

Medium % 1
353

Reverse a given number

Beginner % 1
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
330

Check if Given Number is power of 2

Beginner % 1
319

Get the Sum of Digits in a number till it become a single digit

Medium % 0
317

Check if given number is Prime - O(√N) Solution

Medium % 0
312

Remove Vowels from a given String

Beginner % 0
310

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap

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

Graph – Software Installation Problem

Medium % 0
271

Snake and Ladder Problem

Hard % 1

Convert Infix to Postfix Expression

Evaluation of Infix expressions

Convert Prefix to Infix Expression

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2

Merge K sorted Linked List - Using Priority Queue

Valid Multiple Parentheses

Reverse a given number

Valid Brackets – Part 2 | Stack Method

Check if Given Number is power of 2

Get the Sum of Digits in a number till it become a single digit

Check if given number is Prime - O(√N) Solution

Remove Vowels from a given String

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap

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

Graph – Software Installation Problem

Snake and Ladder Problem