# Status Problem video Level Completes Likes
421

Sort a given stack - Using Recursion

Hard % 1
420

Number's Complement - 2 Approaches

Medium % 1
417

Maximum number edges to make Acyclic Undirected/Directed Graph

Beginner % 0
416

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
413

ZigZag OR Diagonal traversal in 2d array/Matrix using queue

Medium % 0
410

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
409

Minimum Boats Required to rescue people

Medium % 0
408

Number of Islands

Medium % 1
407

Integer Replacement Problem

Medium % 0
406

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Medium % 0
405

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Medium % 0
404

Find all the numbers in the range which has prime set bits.

Beginner % 0
403

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Hard % 0
402

Check if Arithmetic Expression contains duplicate parenthesis

Medium % 0
399

Round Price Problem

Hard % 0
398

Smallest Number after Removing K digits

Hard % 0
396

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Medium % 0
394

Find the maximum number present in a String

Beginner % 0
392

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

Hard % 1
390

Convert Prefix to Postfix Expression

Medium % 0
389

Convert Roman Number to Integer

Beginner % 0
388

Sort a given stack - Using Temporary Stack

Medium % 0
387

Convert Postfix to Prefix Expression

Medium % 0
385

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Medium % 0
384

Grouping of Anagrams

Medium % 0
378

Longest contiguous character in a given String - O(N) Solution

Beginner % 0
377

Convert Postfix to Infix Expression

Medium % 0
375

String to Integer (AtoI - ASCII to Integer)

Beginner % 1
373

Longest substring with at most two unique characters

Medium % 0
372

Monotone Increasing Digits - Leetcode

Medium % 1
371

Convert Infix to Prefix Expression

Medium % 0
368

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
367

Sum of all Unique elements in a given array

Beginner % 0
365

Convert Infix to Postfix Expression

Medium % 0

Sort a given stack - Using Recursion

Number's Complement - 2 Approaches

Maximum number edges to make Acyclic Undirected/Directed Graph

Evaluation of Prefix Expressions (Polish Notation) | Set 2

ZigZag OR Diagonal traversal in 2d array/Matrix using queue

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Minimum Boats Required to rescue people

Number of Islands

Integer Replacement Problem

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Find all the numbers in the range which has prime set bits.

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Check if Arithmetic Expression contains duplicate parenthesis

Round Price Problem

Smallest Number after Removing K digits

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Find the maximum number present in a String

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

Convert Prefix to Postfix Expression

Convert Roman Number to Integer

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Grouping of Anagrams

Longest contiguous character in a given String - O(N) Solution

Convert Postfix to Infix Expression

String to Integer (AtoI - ASCII to Integer)

Longest substring with at most two unique characters

Monotone Increasing Digits - Leetcode

Convert Infix to Prefix Expression

Max Flow Problem - Ford-Fulkerson Algorithm

Sum of all Unique elements in a given array

Convert Infix to Postfix Expression