| Longest Increasing Subsequence | Medium |
| Minimum Number of Platforms Required for a Railway/Bus Station Method 1 | Easy |
| Job Sequencing Problem Find and Union | Easy |
| Job Sequencing Problem | Easy |
| Dijkstra’s shortest path algorithm | Medium |
| Huffman Coding | Medium |
| Prim’s Minimum Spanning Tree (MST) | Medium |
| Kruskal’s Minimum Spanning Tree Algorithm | Medium |
| Find cycle/loop in the graph – Find and Union with Path Compression | Easy |
| Find cycle/loop in the graph – Find and Union | Easy |
| Algorithm to find exact square root in java | Easy |
| Given two binary strings, return their sum in binary string | Easy |
| Custom sorting algorithm using java collection classes | Easy |
| Custom Sorting | Easy |
| Trapping Rain Water | Hard |
| Reverse the LinkedList | Easy |
| Find length of longest substring of given string. | Easy |
| Add two non-empty linked lists representing two non-negative integers | Medium |
| Find an element in array after rotating an array by k steps to the right | Medium |
| Two Sum | Easy |
| Find cycle/loop in the graph – method 1 | Easy |
| Activity Selection problem | Easy |
| Print m * n matrix diagonally | Easy |
| Generate Random Tree Based on max integer | Easy |
| Next greater element in an array | Easy |
| Detect a loop in a linked list and how it works | Hard |
| Find a peak element in an array | Medium |
| Create a balanced Binary Search Tree (BST) from an array | Medium |
| Lowest Common Ancestor | Medium |
| Find all possible paths in matrix | Medium |
| Find first and last index of target element from sorted array | Easy |
| Count number of valid substring in binary string | Easy |
| Merge two sorted arrays in a such a way that a newly generated array will be sorted. | Easy |
| Replace keys with valid values from sentence | Easy |
| The Coin Change Problem | Medium |
| Is string permutation a palindrome or not ? | Easy |
| Find middle node in LinkedList | Easy |
| LinkedList Algorithms Utility | Easy |
| Circular Array Rotation | Easy |
| Generate fibonacci sequence in java | Easy |
| Shortest Palindrome | Easy |
| Generate Binary Search Tree | Medium |
| Optimal Binary Search Tree | Medium |
| Topological Sort Graph Algorithm | Hard |
| Directed and Undirected Graph | Easy |
| Matrix Chain Multiplication | Easy |
| Matrix multiplication notes | Easy |
| Maximum size square sub-matrix with all 1s or 0s | Medium |
| Next Higher Number | Medium |
| Subset sum problem | Easy |
| String interleaving problem | Medium |
| Text justification problem | Medium |
| Join ropes in such a way that the cost is minimum. | Medium |
| PriorityQueue java example | Easy |
| Algorithm to figure out if someone has won in a game of tic-tac-toe. | Hard |
| Longest common subsequence | Medium |
| Rotate matrix by 90 degrees | Medium |
| Longest Increasing Subsequence | Medium |
| Coin changing problem | Medium |
| 0/1 knapsack problem items with values and weight | Medium |
| Longest Palindromic Substring | Medium |
| Google Interview Dynamic Programming on Stolen Values | Hard |
| Optimal Strategy Game Pick from Ends of array Dynamic Programming | Hard |
| Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search) | Medium |
| Word Break Problem Dynamic Programming | Medium |
| All possible largest substrings with distinct characters | Medium |
| Google Interview find the longest substring T that contains m distinct characters | Hard |
| Google Interview find if a given binary tree has duplicate sub trees or not | Medium |
| Google Interview Tree node with x and y value on same level | Easy |
| Find all nodes at each level in binary tree | Easy |
| Find inorder successor in a binary search tree | Easy |
| Algorithm to create a binary tree with minimal height | Medium |
| Algorithm to find out whether there is a route between two nodes | Easy |
| Utility for graph related algorithm | Easy |
| Implement a function to check if a tree is balanced, valid AVL Tree. | Easy |
| Write a program to sort a stack in ascending order | Easy |
| Tower of Hanoi in Java | Medium |
| Find missing number in arithmetic progression | Medium |
| Find out the TWO numbers which appear odd number of times in array | Easy |
| How to get the value of a bit at a certain position from a byte | Medium |
| Separate digit from integer without help of String | Medium |
| Algorithm for Glass of water | Medium |
| Given array find a subsequence of length 3 having maximum product | Hard |
| Whether two BSTs will be identical or not without actually constructing the tree | Medium |
| Algorithm of n integers which can contain integers from 1 to n with repeated and absent | Easy |
| Find the anagrams from a list of strings | Medium |
| Write an algorithm such that if an element in an MxN matrix is 0, its entire row and column is set to 0. | Easy |
| Print all possible substrings – Java | Easy |
| Find string contains unique character or not in Java | Easy |
| String Permutation in Java | Easy |
| Print all combinations of balanced parentheses – Java | Medium |
| Calculate the angle between hour hand and minute hand | Medium |
| Google Interview Algorithm Sort Given a 2D matrix of integers | Medium |
| QuickSort in Java with google interview question | Medium |
| Java Binary Search | Medium |
| Java Pots of gold game – Google Interview | Hard |
| Find the smallest range that includes at least one number from each of the k lists – Google | Medium |
| Reverse a string using recursive method in Java | Easy |
| Cut the sticks – hackerrank | Medium |
