README.md

Codes in the C++ language

Competitive Programming

• Time taken to rot all Oranges
• 2-D Matrix Sorting
• ActivitySelection
• ArraySub
• Array Right Rotation Naive Approach
• All Possible Sum Using FFT
• Check Anagrams
• Check Pangram
• Check for Subsequence
• Container with most water
• Contiguous Sub Array with Given Sum
• Count of string P in string S
• Elements Occurrence using Binary Search
• Even Pair Sum
• Factorial of Very Large Numbers
• Find number of digits in an integer
• Find leftmost non repeating character in string
• Infix to Postfix
• Intersection of Y-shaped linked list
• Josephus Problem
• Kadane's Algorithm for max sum subArray
• Knuth–Morris–Pratt algorithm
• Longest Common Prefix
• Longest Common Ancestor using Binary Lifting
• Longest Subarray with Zero Sum
• Maximum in Array
• Minimum Spanning Tree
• Min Swap To Sort Array
• Mos Algorithm
• Next Largest Permutation
• NQueens
• Painter Partition
• Prefix Sum Array
• Print All Subsequences using Recursion
• Rain Water Harvesting
• Rat In A Maze
• Remove Spaces from a string
• Reverse words in Given String
• Reverse a String using Stack
• Search Insert Position
• Spiral Matrix
• String to Integer
• Sub-array with given sum
• Suduko Solver
• Target Sum triplets
• Toggle Kth Bit From Right
• Two Pointers Method
• Z Algorithm
• First occurence of 1
• Remove Minimum Parantheses to make Valid Parantheses
• Reverse Lookup in 1D array
• Moore's Voting Algorithm to find the majority element
• Ticket Auction
• Replace Pi using recursion
• Lexicographically largest palindrome subsequence
• Generate all combinations of well-formed parentheses
• Conversion of Binary Number to Decimal Number
• Painting Fence Algorithm
• All String permutation by using recursion
• Peak element

Data Structures

• Reverse Queue content using Stack
• Add Post-Order Tree Traversal
• Level Order Tree Traversal
• AVL Tree
• Binary Search Tree
• Binary Tree Preorder Traversal
• Binary Tree
• Circular Linkedlist
• Doubly Linked List
• 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
• 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

Graphs

• 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
• 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
• 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
• Childern Sum Property

Searching

• 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

Sorting

• Bead Sort
• Binary Search Tree Sort
• Bubble Sort
• Bucket Sort
• Cocktail shaker sort
• Comb sort
• Count Sort
• Counting Sort
• Heap Sort
• In Place Merge Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Radix Sort
• Randomized Quick Sort
• Selection Sort
• Shell Sort
• Topological Sort
• Sleep Sort
• Three Way Merge Sort
• Wave Sort
• Wiggle Sort

Stack based problems

-Infix to Postfix Conversiion

• Check for balanced parenthesis
• Evaluation of Postfix Expression
• Largest rectangular area under histogram
• 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

Heap based problems

• Median in a running stream of integers
• Merge K sorted arrays
• K Closest Points to Origin
• Top K frequent elements
• Heap implementation and basic queries on it

Machine Learning

add list here

Mathematics

• Ackermann Function
• Armstrong Number
• Binary Exponentiation
• Catalan number
• Difference_of_Two_Strings
• Double factorial
• Euler's_Totient_Function
• Extended Euclidean Algorithm
• Hamming Distance
• Number is Power of 2
• Palindrome Number
• Pythagorean Triples Generator
• Sieve of Eratosthenes
• Ugly Numbers
• Modular Exponentiation
• Binomial Coefficient (under modulo)
• Magic Number
• Converting decimal number to binary
• Neon Number
• Krishnamurthy Number
• Tower Of Hanoi
• Happy Number
• Sieve of Atkins

Dynamic Programming

• 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 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
• Length of longest palindromic subsequence
• Minimum number of insertions and deletions
• Unbounded Knapsack

Bit - Manipulation

• Check Kth Bit is Set or Not
• Count Number of Set Bits
• Brian_Kernighan's Algorithm
• Power of 2
• One odd occuring
• Two odd occuring
• Power_Set_Using_Bitwise
• Swap_even_and_odd_bits

Blockchain

add list here

Cryptography

• 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

Computational Geometry

• Convex Hull (Jarvis' Algorithm)

Other

• Boyer–Moore majority vote algorithm
• Count of distinct elements in a window
• Dynamic Huffman
• Divisors of a natural number
• Fast Fibonacci Last digit
• 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