# Status Problem video Level Completes Likes
553

Minimize Scheduling Headaches: Clone Yourself for Overlapping Events

Hard % 0
468

Unique subsets with a given sum with allowed repeated digits.

Medium % 0
466

Lexicographically next permutation With One swap

Medium % 1
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
392

Reverse a Stack using recursion - In Place (Without using extra memory)

Hard % 1
390

Convert Prefix to Postfix Expression

Medium % 0
388

Sort a given stack - Using Temporary Stack

Medium % 0
387

Convert Postfix to Prefix Expression

Medium % 0
386

Convert Integer to Roman

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

Valid Brackets – Part 2 | Stack Method

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
271

Snake and Ladder Problem

Hard % 1
235

Majority Element- Boyer–Moore majority vote algorithm

Medium % 0
234

Majority Element – Part 1

Beginner % 0
222

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Hard % 0
217

Find two elements whose sum is closest to zero

Medium % 1
211

Find the first repeating character in a given string

Beginner % 0
209

Find longest Snake sequence in a given matrix

Medium % 1
208

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

Medium % 1
207

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Medium % 1
200

Dynamic Programming - Highway Billboard Problem

Hard % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1

Minimize Scheduling Headaches: Clone Yourself for Overlapping Events

Unique subsets with a given sum with allowed repeated digits.

Lexicographically next permutation With One swap

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

Reverse a Stack using recursion - In Place (Without using extra memory)

Convert Prefix to Postfix Expression

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

Convert Integer to Roman

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

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

Merge K sorted Linked List - Using Priority Queue

Valid Brackets – Part 2 | Stack Method

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

Snake and Ladder Problem

Majority Element- Boyer–Moore majority vote algorithm

Majority Element – Part 1

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Find two elements whose sum is closest to zero

Find the first repeating character in a given string

Find longest Snake sequence in a given matrix

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

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Dynamic Programming - Highway Billboard Problem

Kadane's Algorithm - Maximum Subarray Problem