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

Check if Arithmetic Expression contains duplicate parenthesis

Medium % 0
396

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Medium % 0
394

Find the maximum number present in a String

Beginner % 0
390

Convert Prefix to Postfix Expression

Medium % 0
389

Convert Roman Number to Integer

Beginner % 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
369

Find duplicates Characters in the given String

Beginner % 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
364

Find three smallest elements in a given array

Beginner % 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
357

Count Set bits in a given Number

Beginner % 1
356

Check if array contains all unique or distinct numbers

Beginner % 0
355

Product of all Unique elements in a given array

Beginner % 0
354

Valid Multiple Parentheses

Medium % 1
352

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

Beginner % 0
350

Find first three largest elements in a given array

Beginner % 0
347

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Hard % 0
346

Valid Brackets – Part 2 | Stack Method

Beginner % 0
342

Find two smallest elements in a given array

Beginner % 0

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

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

Check if Arithmetic Expression contains duplicate parenthesis

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Find the maximum number present in a String

Convert Prefix to Postfix Expression

Convert Roman Number to Integer

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

Find duplicates Characters in the given String

Max Flow Problem - Ford-Fulkerson Algorithm

Sum of all Unique elements in a given array

Convert Infix to Postfix Expression

Find three smallest elements in a given array

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

Count Set bits in a given Number

Check if array contains all unique or distinct numbers

Product of all Unique elements in a given array

Valid Multiple Parentheses

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

Find first three largest elements in a given array

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Valid Brackets – Part 2 | Stack Method

Find two smallest elements in a given array