-
Find First and Last position index of an element in an array
-
Minimum operations to make sum of each column & row of square matrix equal
- Reverse Queue content using Stack
- Singly Linked List Operations Using Unique Key
- Add Post-Order Tree Traversal
- Level Order Tree Traversal
- AVL Tree
- Binary Search Tree
- Binary Tree Preorder Traversal
- Binary Tree
- Circular Linkedlist
- Diameter of Binary Tree
- Doubly Linked List
- Double Ended Queue
- Hashtable with separate chaining
- Heap Sort
- Middle Element of a Linked List
- Leaf Nodes in Binary Search Tree
- Detect Cycle in Linked List
- Linked List
- Max and Min heap Implementation
- Nodes At A Distance K From A Given Target Node In A Binary Tree
- Prims Algorithm
- Priority Queue
- Queue
- Queue Linked List
- Red Black Tree
- Reverse Linked List
- Singly Linked List
- Stack using Array
- Stack using Linked List
- Tim Sort
- Trie Implementation
- Vector
- Ancestors in Binary Search Tree
- Binary Search Tree to Greater Sum Tree
- Threaded Binary Tree
- Alternate Merging of nodes of two linked lists
- BST from preorder traversal
- Priority Queue using Array
- Linear Probing
- Quadratic Probing
- Double Hashing
- Flattening binary tree into Linkedlist in-place
- Ascending Priority Queue
- Priority_Queue_using_Linked_List
- Maximum Width of Binary Tree
- Descending Priority Queue
- Invert a given binary Tree
- Binary Search Tree Validation
- Maximum Element of Binary Tree
- Adjacency List Representation
- Articulation points in an Undirected Graph
- Bellman Ford's Algorithm
- Breadth First Search Tree Traversal
- Bidirectional Seach using BFS in undirected graph
- Bridges in an Undirected Graph
- Celebrity Problem
- Check for bipartite graph
- Cycle Detection in a Directed Graph
- Cycle Detection in Graph
- Depth First Search Algorithm
- Depth Of Tree
- Detect Negative Cycle in Graph
- Dijkstra's Algorithm
- Edmond Karp's Algorithm
- Flood fill
- Floyd Warshall ALgorithm (ASSP)
- In-order (LNR) Tree Traversal
- Kosaraju Algorithm
- Kruskal's Algorithm
- Min and Max element in BST
- Post-order (LRN) Tree Traversal
- Pre-order (NLR) Tree Traversal
- Prim's Algorithm
- Toplogical Sort in Diredted Acyclic Graph (DAG)
- Tarjan's Algorithm
- Vertical Order print of Binary Tree
- Left view of Tree
- Right view of Tree
- Breadth First Search
- ZigZag traversal of Tree
- Kahn's Algorithm
- Shortest Path in Unweighted Graph
- Depth first Search for a graph
- Diameter of Binary Tree
- Childern Sum Property
- Binary Search
- Bilinear Search
- Exponential Search
- Interpolation Search
- Jump Search
- Linear Search
- Manacher's Algorithm
- Randomized Select Search
- Staircase Search
- Tenary Search
- Fibonacci Search
- Unbounded Binary Search
- Sublist Search
- Bead Sort
- Binary Search Tree Sort
- Bubble Sort
- Bucket Sort
- Circle Sort
- Cocktail shaker sort
- Comb sort
- Count Sort
- Counting Sort
- Heap Sort
- In Place Merge Sort
- Insertion Sort
- Merge Sort
- Pigeon hole Sort
- Quick Sort
- Radix Sort
- Randomized Quick Sort
- Selection Sort
- Shell Sort
- Topological Sort
- Sleep Sort
- Three Way Merge Sort
- Wave Sort
- Wiggle Sort
- Quotient-Remainder Sort
- Check for balanced parenthesis
- Evaluation of Postfix Expression
- Largest rectangular area under histogram
- Maximum possible length of balanced bracket sequence
- Stock Span Problem
- Evaluate string expression BODMAS
- Previous Greater Element
- Next greatest element to the right
- Infix to Postfix conversion
- Next smallest element to the right
- Smallest element in an array
- Sort stack using recursion
- Median in a running stream of integers
- Merge K sorted arrays
- K Closest Points to Origin
- Top K frequent elements
- Cheapest flights within k stops
- Heap implementation and basic queries on it
add list here
- Ackermann Function
- Armstrong Number
- Binary Exponentiation
- Catalan number
- Counting divisors using sieve of Eratosthenes
- Difference_of_Two_Strings
- Double factorial
- Euler's_Totient_Function
- Extended Euclidean Algorithm
- Find Smallest Prime Factor
- Hamming Distance
- Number is Power of 2
- Palindrome Number
- Pythagorean Triples Generator
- Sieve of Eratosthenes
- Sum of Digits of a number
- Ugly Numbers
- Word Break Problem
- Noble Integer
- Modular Exponentiation
- Binomial Coefficient (under modulo)
- Magic Number
- Converting decimal number to binary
- Neon Number
- Krishnamurthy Number
- Smallest Divisible Number
- Tower Of Hanoi
- Happy Number
- Sieve of Atkins
- Matrix Transpose
- Integer to Roman
- Automorphic Number
- Coin Change Problem
- Edit distance
- Egg Dropping Problem
- Fibonacci bottom to top
- Fibonacci top to bottom
- Implement Floyd-Warshall Algorithm
- Longest common sub sequence
- Longest increasing subsequence
- Matrix Chain Multiplication
- Maximum Subarray Sum (Constant Space)
- Maximum Sum Rectangle
- Maximum Square Matrix With All 1s
- Minimum Sum Partition
- Number Of Binary Trees
- Number of subsets with given difference
- Palindrome_Partioning
- Partition Problem
- Rectangle Cutting Problem
- String permutations
- Wild Card Pattern Matching
- Unique BST
- Zero One Knapsack
- ZeroN Knapsack
- K-Tree
- Sprague Grundy Theorem on Strings
- Equal Sum Partition Problem
- Length of longest palindromic subsequence
- Minimum number of insertions and deletions
- Unbounded Knapsack
- Print Longest Common Subsequence
- Tiling 2 x N
- Kadane's Algorithm
- Shortest_Uncommon_Subseqence
- Check Kth Bit is Set or Not
- Count Number of Set Bits
- Brian_Kernighan's Algorithm
- Power of 2
- One odd occuring
- Rotate Bits
- Two odd occuring
- Power_Set_Using_Bitwise
- Reverse Bits
- Sort integers by the number of set bits present in them
- Swap_even_and_odd_bits
- Number of Bits to be flipped to Inter-convert Two numbers
add list here
- Affine substitution Cipher
- Rail Fence Transposition Technique
- Shamir's Secret Sharing algorithm
- Simple Columnar Transposition Technique
- Simple Columnar with Multiple Rounds Transposition Technique
- Vigenere Cipher
- Vernam Cipher
- Add Two Linked Lists
- Arranging elements of array to form biggest possible number
- Boyer–Moore majority vote algorithm
- Count of distinct elements in a window
- Dynamic Huffman
- Divisors of a natural number
- Distinct Subsets of a Set
- Fast Fibonacci Last digit
- Find duplicate elements from an array
- Find the Numbers
- First Missing Positive Number
- Generate all Subsets
- Kth largest element
- Least Common Multiple
- Merging two sorted arrays without extra space
- Print all codes of a string using recursion
- Rabin Karp Algorithm (using rolling hash)
- Rabin Karp Algorithm (using prefix sum)
- Remove Outermost Parantheses
- Russian Peasant Algorithm
- Sliding Window Technique
- String Rotation based on Queries
- Sudoku Solver
- Swap Two Nibbles
- Unique_Number_III
- KnapSack Fractional using Greedy Approach
- Longest Subarray with equal number of 0 and 1
- Set Clear and Check bits
- Iterative approach to print all subsets
- Count of Set Bits in an Integer using Lookup Technique
- Concatenate given strings
- Trapping Rainwater
- 4Sum
- Maximum ELement in a bitonic Array