# Status Problem video Level Completes Likes 398 Smallest Number after Removing K digits Hard % 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 386 Convert Integer to Roman Medium % 0 385 String to Integer (AtoI - ASCII to Integer) - Recursive Solution Medium % 0 379 Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Medium % 0 377 Convert Postfix to Infix Expression Medium % 0 376 Collatz Conjecture - Steps to transform Number to 1 Beginner % 0 375 String to Integer (AtoI - ASCII to Integer) Beginner % 1 374 Find all Prime Numbers less than equal to N | Set 1 Beginner % 0 372 Monotone Increasing Digits - Leetcode Medium % 1 371 Convert Infix to Prefix Expression Medium % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 358 Infix, Postfix and Prefix Notations/Expressions Beginner % 0 357 Count Set bits in a given Number Beginner % 1 353 Reverse a given number Beginner % 1 Smallest Number after Removing K digits Find the maximum number present in a String Convert Prefix to Postfix Expression Convert Roman Number to Integer Convert Postfix to Prefix Expression Convert Integer to Roman String to Integer (AtoI - ASCII to Integer) - Recursive Solution Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Convert Postfix to Infix Expression Collatz Conjecture - Steps to transform Number to 1 String to Integer (AtoI - ASCII to Integer) Find all Prime Numbers less than equal to N | Set 1 Monotone Increasing Digits - Leetcode Convert Infix to Prefix Expression Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Infix, Postfix and Prefix Notations/Expressions Count Set bits in a given Number Reverse a given number 1 2 3
