Code-Helper

A collection of traditional coding questions and concepts to help you prepare for your coding rounds and interviews

Steps to contribute -

Find out a coding question that you have seen before and not present in this Repository already
Make a working solution to that problem and submit that code under a folder with same problem name.
Fork the repo, and make a Pull Request for your changes.

Name		Name	Last commit message	Last commit date
Latest commit History 44 Commits
Bellman Ford		Bellman Ford
Binary Tree Maximum Path Sum		Binary Tree Maximum Path Sum
Bubble_sort		Bubble_sort
Clone a graph		Clone a graph
Dijikstra_algorithm		Dijikstra_algorithm
Disjoint Set Union		Disjoint Set Union
Flatten Binary Tree to Linked List		Flatten Binary Tree to Linked List
Fractional Knapsack		Fractional Knapsack
Interpolation_search		Interpolation_search
Knapsack		Knapsack
Kruskal's Algorithm		Kruskal's Algorithm
Longest Common Subsequence		Longest Common Subsequence
Longest Palindromic Subsequence		Longest Palindromic Subsequence
Lucas_Theorem		Lucas_Theorem
Maximum Product Subarray		Maximum Product Subarray
Nqueen		Nqueen
Prim's Algorithm		Prim's Algorithm
Trapping Rain Water		Trapping Rain Water
Unbounded Knapsack		Unbounded Knapsack
maximum_subarray_xor		maximum_subarray_xor
unbounded_knapsack		unbounded_knapsack
README.md		README.md

Provide feedback