###Course assignments
####Introduction
| No. | Problem | File | Status |
|---|---|---|---|
| 1 | Small fibonacci number | Fibonacci.java | Solved |
| 2 | Last Digit of a Large Fibonacci Number | FibonacciLastDigit.java | Solved |
| 3 | Greatest Common Divisor | GCD.java | Solved |
| 4 | Least Common Multiple | LCM.java | Solved |
| 5 | Huge Fibonacci Number modulo m | FibonacciHuge.java | Solved |
| 6 | Sum of Fibonacci Numbers | FibonacciSumLastDigit.java | Solved |
| 7 | Partial Sum of Fibonacci Numbers | FibonacciPartialSum | Solved |
####Greedy algorithms
| No. | Problem | File | Status |
|---|---|---|---|
| 1 | Changing Money | Change.java | Solved |
| 2 | Maximizing the Value of a Loot | FractionalKnapsack.java | Solved |
| 3 | Maximizing Revenue in Online Ad Placement | DotProduct.java | Solved |
| 4 | Collecting Signatures | CoveringSegments.java | Solved |
| 5 | Maximizing the Number of Prize Places in a Competition | DifferentSummands.java | Solved |
| 6 | Maximizing Your Salary | LargestNumber.java | Solved |
####Divide and conquer
| No. | Problem | File | Status |
|---|---|---|---|
| 1 | Binary Search | BinarySearch.java | Solved |
| 2 | Finding a Majority Element | MajorityElement.java | Solved |
| 3 | Improving Quick Sort | Sorting.java | Solved |
| 4 | How Close a Data is To Being Sorted? | Inversions.java | Solved |
| 5 | Organizing a Lottery | PointsAndSegments.java | Solved |
| 6 | Finding the Closest Pair of Points | Closest.java | Unsolved |
####Dynamic programming
| No. | Problem | File | Status |
|---|---|---|---|
| 1 | Primitive Calculator | PrimitiveCalculator.java | Solved |
| 2 | Take as Much Gold as Possible | Knapsack.java | Solved |
| 3 | Compute the Edit Distance Between Two Strings | EditDistance.java | Solved |
| 4 | Maximize the Value of an Arithmetic Expression | PlacingParentheses.java | Solved |
| 5 | Longest Common Subsequence of Three Sequences | LCS3.java | Solved |