# 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 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 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 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
