| Week | Title | Submission |
|---|---|---|
| Week 1 | Linear Search | LinearSearch.java |
| Binary Search | binarySearch.java | |
| Exponential Search | ExponentialSearch.java | |
| Week 2 | No. of duplicates of Key | Problem1.java |
| Finding indices as a[i]+a[j]=a[k] in sorted array | problem2.java | |
| Counting pairs equal to key | Problem3.java | |
| Week 3 | Insertion Sort | Insertion Sorting.java |
| Selection Sort | Selection Sorting.java | |
| Checking for duplicates | Sort and Find Duplicate.java | |
| Week 4 | Merge Sort | MergeSorting.java |
| Quick Sort | QuickSort.java | |
| Finding Kth smallest number | KSmallest.java | |
| Week 5 | Count Sort | CountSort.java |
| Finding indices as a[i]+a[j]=a[k] in unsorted array | KeyPairSum.java | |
| Finding common elements of two arrays | common.java | |
| Week 6 | Finding Existance of Path | DFS.java |
| Finding Existance of Path | BFS.java | |
| Checking if Graph is Bipartite | Bipartite.java |
| Title | Submission |
|---|---|
| Assignment 1 | Assignment 1.pdf |