Home

Data structures & Algorithms (Python/Java)

Tree

• Path(s) from root to leaves
• Convert a unbalanced BST to balanced BST
• Consruct a BST from given sorted array
• Children sum property - For each node, node's data equals to sum left & right child's data
• Distance between 2 arbitrary nodes
• Distance between root & any arbitrary node
• Inorder successor & predecessor
• To check whether binary is balanced
• Path with sum equals to given sum
• Left & right view of binary tree
• LCA - Lowest Common Ancestor
• To check whether binary trees are mirror of each other
• Convert a binary tree to it's mirror
• Move children to left/right
• To find node(s) at distance 'k' from root
• To find path from root to a given node
• To find out some of all nodes' data
• Binary tree traversals - Preorder, Inorder, Postorder
• Diameter of binary tree
• Height of binary tree
• BST Insertion, deletion etc.

Searching

• Binary search
• Binary search in circularly sorted array
• To find out the number of times sorted array is rotated

Sorting

• Bubble sort
• Insertion sort
• Selection sort
• Merge sort
• Quick sort

Array

• To reverse an array
• To rotate an array by 'd'
• To find out Pair(s) with given sum 's' in sorted array
• To find out Pair(s) with given sum 's' in unsorted array
• Rearrange numbers in array such that +ve & -ve numbers are placed alternatively
• Move all -ve numbers to the left and +ve numbers to the right in array
• Segregate 0's & 1's in an array

Dynamic programming

• To find out the number of BSTs can be formed with 'n' sorted elements/keys

Hashtable

• Custom hashtable implementation

Linked list

• Singly linked list - Insert at first, last and in middle
• Deleting a node from singly linked list
• Merge two sorted linked lists
• Doubly linked list - Insertion, deletion

Queue

• Queue
• Dequeue