Competitive-Coding-Repository

A collection of solutions to Competitive Coding questions in all programming languages.

Check List

Data Structures

• [x] Stack
• [x] Queue
• [x] Binary Search Tree
• [ ] Trie

Backtracking

• [x] N Queens
• [x] Rat in a Maze

Bit Manupulation

• [x] Check if i'th Bit is Set
• [x] Count number of 1's in Binary of N
• [x] Is N power of 2
• [x] Next power of 2
• [x] Subset generation

DP

• [ ] Longest Common Subsequence.
• [ ] Shortest Common Supersequence.
• [ ] Longest Increasing Subsequence
• [x] Knapsnack Problem

Greedy

• [ ] Huffman Coding
• [x] Minimum Absolute Difference
• [x] Fractional Knapsack
• [x] Weighted job scheduling

Searching

• [x] Binary Search

Sorting

• [ ] Quick Sort
• [ ] Merge Sort
• [ ] Radix Sort
• [ ] Counting Sort

Graph Theory

• [x] Kruskals Algorithm
• [ ] Prims Algorithm
• [x] Bipartite Graphs
• [x] Permutation Swaps
• [x] Connected horses

Fenwick Trees

• [x] Shil and Wave Sequence
• [x] K Query
• [x] Order Set Problem

Number Theory

• [x] Binomial Coefficient
• [x] LCM
• [x] Euclid GCD
• [x] Prime from 1 to N
• [x] GCD