Problems # Status Problem Level Completes Likes 36 Convert Infix to Postfix Expression Medium % 0 37 Evaluation of Infix expressions Medium % 0 38 Convert Prefix to Infix Expression Medium % 0 39 Infix, Postfix and Prefix Notations/Expressions Beginner % 0 40 Count Set bits in a given Number Beginner % 0 41 Reverse a given number – Java Code Beginner % 0 42 Check if given number is perfect square - O(√N) Solution Beginner % 0 43 Check if Given Number is power of 2. Beginner % 0 44 Print First n numbers in Fibonacci Series Beginner % 0 45 Get the Sum of Digits in a number till it become a single digit Medium % 0 46 Check if given number is Prime - O(√N) Solution – Java Program Medium % 0 47 Print First N Prime Numbers - Java Code Beginner % 0 48 Minimum number of guesses needed to find a specific number Beginner % 0 49 Convert Number to base 3 String Representation Beginner % 0 50 Generate Well Ordered Passwords of a Given Length K Medium % 0 51 Print All Possible Subsets with Sum equal to a given Number Hard % 0 52 Find numbers that are palindrome in the decimal and octal Representations Beginner % 0 53 Colorful Numbers Hard % 0 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 – Java Code Check if given number is perfect square - O(√N) Solution Check if Given Number is power of 2. Print First n numbers in Fibonacci Series Get the Sum of Digits in a number till it become a single digit Check if given number is Prime - O(√N) Solution – Java Program Print First N Prime Numbers - Java Code Minimum number of guesses needed to find a specific number Convert Number to base 3 String Representation Generate Well Ordered Passwords of a Given Length K Print All Possible Subsets with Sum equal to a given Number Find numbers that are palindrome in the decimal and octal Representations Colorful Numbers 1 2
