Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 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 386 Convert Integer to Roman Medium % 0 385 String to Integer (AtoI - ASCII to Integer) - Recursive Solution Medium % 0 384 Grouping of Anagrams Medium % 0 383 Print Processes and its messages from a given log file Medium % 0 382 Linear Search vs Binary Search Beginner % 0 381 K-Means Algorithm Hard % 0 380 Count the number of nodes in a given binary tree Beginner % 0 379 Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Medium % 0 378 Longest contiguous character in a given String - O(N) Solution Beginner % 0 377 Convert Postfix to Infix Expression Medium % 0 376 Collatz Conjecture - Steps to transform Number to 1 Beginner % 0 374 Find all Prime Numbers less than equal to N | Set 1 Beginner % 0 373 Longest substring with at most two unique characters Medium % 0 371 Convert Infix to Prefix Expression Medium % 0 370 Find third largest element in a given array Beginner % 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 366 Java program to find the largest element in 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 362 Stack Java Class - Explained Beginner % 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 358 Infix, Postfix and Prefix Notations/Expressions Beginner % 0 356 Check if array contains all unique or distinct numbers Beginner % 0 355 Product of all Unique elements in a given array Beginner % 0 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 Convert Prefix to Postfix Expression Convert Roman Number to Integer Sort a given stack - Using Temporary Stack Convert Postfix to Prefix Expression Convert Integer to Roman String to Integer (AtoI - ASCII to Integer) - Recursive Solution Grouping of Anagrams Print Processes and its messages from a given log file Linear Search vs Binary Search K-Means Algorithm Count the number of nodes in a given binary tree Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Longest contiguous character in a given String - O(N) Solution Convert Postfix to Infix Expression Collatz Conjecture - Steps to transform Number to 1 Find all Prime Numbers less than equal to N | Set 1 Longest substring with at most two unique characters Convert Infix to Prefix Expression Find third largest element in a given array Find duplicates Characters in the given String Max Flow Problem - Ford-Fulkerson Algorithm Sum of all Unique elements in a given array Java program to find the largest element in array Convert Infix to Postfix Expression Find three smallest elements in a given array Evaluation of Infix expressions Stack Java Class - Explained Convert Prefix to Infix Expression Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Merge K sorted Linked List - Using Priority Queue Infix, Postfix and Prefix Notations/Expressions Check if array contains all unique or distinct numbers Product of all Unique elements in a given array Check if given number is perfect square - O(√N) Solution Find first three largest elements in a given array 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
