- Connect n ropes with minimum cost
- Maximum value of |arr[i] – arr[j]| + |i – j|
- Shortest unique prefix for every word in a given list
- Minimum shift for longest common prefix
- All elements in array which have at-least two greater elements
- Check if words are sorted according to new order of alphabets
- Turn off the rightmost set bit
- Longest Possible Chunked Palindrome
- n’th node from the end of a Linked List
- Minimize Cash Flow among a given set of friends who have borrowed money from each other
- Distinct palindromic sub-strings of the given string
- Count All Palindrome Sub-Strings in a String
- Binary Indexed Tree
- Print all k-colorable configurations of the graph
- Print all Hamiltonian path present in a graph
- Isomorphic Strings
- Determine if binary tree can be converted to another by doing any number of swaps of left and right child
- Sink nodes containing zero to the bottom of the binary tree
- Ancestors of a given node in Binary Tree
- Maximum sum leaf to root path in a Binary Tree
- Floor and Ceil in a Binary Search Tree
- Inorder predecessor and successor for a given key in BST
- Remove BST keys outside the given range
- Optimal Binary Search Tree
- Third Maximum Number

Subscribe

0 Comments