# Status Problem video Level Completes Likes 544 Counting the Largest Number Groups by Digit Sum Medium % 2 543 Adding One to a Number Represented by an Array Medium % 1 539 Find the Nth-term in a given arithmetic progression Beginner % 1 531 Convert a Decimal number to its binary representation Beginner % 1 527 In a number, add digits until it becomes a single digit Beginner % 1 502 Calculate tax on income as per given tax brackets. Beginner % 0 501 Valid Pickup and Delivery options Hard % 0 498 The largest number can be formed from the given number Beginner % 0 485 Construct the Largest number from the given digits Beginner % 1 448 Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Medium % 0 436 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 435 Hamming Distance between two given integers Beginner % 1 429 Find all the Armstrong numbers in the given range Beginner % 0 428 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 412 Check if Number is divisible by its digits Beginner % 0 411 Check if the given number is Armstrong number or not Beginner % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 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 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 Counting the Largest Number Groups by Digit Sum Adding One to a Number Represented by an Array Find the Nth-term in a given arithmetic progression Convert a Decimal number to its binary representation In a number, add digits until it becomes a single digit Calculate tax on income as per given tax brackets. Valid Pickup and Delivery options The largest number can be formed from the given number Construct the Largest number from the given digits Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Hamming Distance between two given integers Find all the Armstrong numbers in the given range Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Check if Number is divisible by its digits Check if the given number is Armstrong number or not Evaluation of Prefix Expressions (Polish Notation) | Set 1 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. 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 1 2
