Strategies used include Divide and Conquer, Greedy Approach, Dynamic Programming, and Backtracking.
- 0-1_Knapsack_Problem
- Bellman_Ford_Algorithm
- Binary_Search
- Fractional_Knapsack_Problem
- Insertion_Sort
- Job_Sequencing
- Largest_Common_Subsequence
- Max-Min_Problem
- Merge_Sort
- N_Queen
- Quick_Sort
- Selection_Sort
- Sum_of_Subsets
Mihir Gandhi - mihir-m-gandhi
📅 Jan 2018 to May 2018