S.N. | Problem | Level | Status |
---|---|---|---|
1 | Find Minima of convex Function using Gradient Descent |
Easy
|
|
2 | Code Linear Regression Algorithm |
Medium
|
|
3 | Code Logistic Regression Algorithm |
Medium
|
|
4 | Code Decision Tree Algorithm |
Hard
|
|
5 | Code Neural Network with one hidden Layer |
Hard
|
|
6 | Implement Beam Search |
Hard
|
S.N. | Problem | Level | Status |
---|---|---|---|
1 | Code K-Means Algorithm |
Easy
|
|
2 | 1D clustering with deterministic clusters in O(N^2) |
Medium
|
|
3 | 1D clustering with deterministic clusters in O(N) |
Hard
|
S.N. | Problem | Level | Status |
---|---|---|---|
1 | N samples from a distribution |
Medium
|
|
2 | Sample a point randomly from a Circle of radius R |
Medium
|
|
3 | Reservoir Sampling |
Medium
|
|
4 | Estimate Expected number of Unique data points in a bootstrap sample |
Hard
|
S.N. | Problem | Level | Status |
---|---|---|---|
1 | Shuffle an Array |
Medium
|
|
2 | Moving Average of Stream data |
Medium
|
|
3 | Mean and variance of Stream data |
Medium
|
|
4 | Huffman Encoding |
Medium
|
|
5 | Implement rand10() using rand7() |
Medium
|
|
6 | Geometric Median |
Medium
|
|
7 | Find K Nearest 2-D Points (x,y) from Origin in a Stream of 2D data |
Medium
|
|
8 | Median of Stream |
Hard
|