Problems # Status Problem Level Completes Likes 211 Insertion Sort – Java Implementation Beginner % 0 212 Find Largest and Smallest word in a given String Beginner % 0 213 Check if Given Number is power of 2. Beginner % 0 214 Rotate the given array in cycles Beginner % 0 215 Heap Sort – Java Implementation Medium % 0 216 Print First n numbers in Fibonacci Series Beginner % 0 217 Find the Area and Perimeter of Rectangle – Java Program Beginner % 0 218 Find no of reverse pairs in an array which is sorted in two parts in O(N) Hard % 0 219 Stack Data Structure – Introduction and Implementation Beginner % 0 220 Reverse the given String using Stack Beginner % 0 221 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Hard % 0 222 Bubble Sort and Optimized Bubble Sort- Java Implementation Beginner % 1 223 Find the Area of Triangle using base and height - Java Program Beginner % 0 224 Get the Sum of Digits in a number till it become a single digit Medium % 0 225 Calculate Log2n without using built-in function Beginner % 0 226 Check if given number is Prime - O(√N) Solution – Java Program Medium % 0 227 Print First N Prime Numbers - Java Code Beginner % 0 228 Print My IP Address – Java Code Beginner % 0 229 Find the Circumference of a Circle - Java Program Beginner % 0 230 Check if two Strings are equal without using built-in function - Java Beginner % 0 231 Remove Vowels from a given String Beginner % 0 232 Linear Search Algorithm Beginner % 0 233 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Hard % 0 234 Floyd’s Triangle – Java Implementation Beginner % 0 235 Print Numbers from 1 to N without using loop Beginner % 0 236 Swap two numbers using Bitwise XOR Operator Medium % 0 237 Java Program to determine if Given Year is Leap Year Beginner % 0 238 Find number of Distinct Permutations of a String Medium % 0 239 Find the Area of a Circle - Java Program Beginner % 0 240 Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Hard % 0 241 Fizz Buzz Challenge - Java Implementation Beginner % 0 242 Divide with power of 2 without using pow() or / operator Beginner % 0 243 Maximum Difference between two elements in array – Largest Gap Problem Beginner % 0 244 Minimum number of guesses needed to find a specific number Beginner % 0 245 Left Shift (<<) and Right Shift (>>) Operators Beginner % 0 Insertion Sort – Java Implementation Find Largest and Smallest word in a given String Check if Given Number is power of 2. Rotate the given array in cycles Heap Sort – Java Implementation Print First n numbers in Fibonacci Series Find the Area and Perimeter of Rectangle – Java Program Find no of reverse pairs in an array which is sorted in two parts in O(N) Stack Data Structure – Introduction and Implementation Reverse the given String using Stack Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Bubble Sort and Optimized Bubble Sort- Java Implementation Find the Area of Triangle using base and height - Java Program Get the Sum of Digits in a number till it become a single digit Calculate Log2n without using built-in function Check if given number is Prime - O(√N) Solution – Java Program Print First N Prime Numbers - Java Code Print My IP Address – Java Code Find the Circumference of a Circle - Java Program Check if two Strings are equal without using built-in function - Java Remove Vowels from a given String Linear Search Algorithm Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Floyd’s Triangle – Java Implementation Print Numbers from 1 to N without using loop Swap two numbers using Bitwise XOR Operator Java Program to determine if Given Year is Leap Year Find number of Distinct Permutations of a String Find the Area of a Circle - Java Program Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Fizz Buzz Challenge - Java Implementation Divide with power of 2 without using pow() or / operator Maximum Difference between two elements in array – Largest Gap Problem Minimum number of guesses needed to find a specific number Left Shift (<<) and Right Shift (>>) Operators 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
