100 days of Coding Challenge
Day | Title | Description | Language | Source | Link |
---|---|---|---|---|---|
1 | Two Pointers Algorithm | Find the Maximum area | Python | GeeksForGeeks | View Code |
2 | Dutch National Flag Algorithm | Sort an array of 0's,1's and 2's . | Python | GeeksForGeeks | View Code |
3 | N meetings Greedy Approach | find the max no. of meeting in the same room | Python | GeeksForGeeks | View Code |
4 | Kadane's Algorithm | Maximum Subarray Sum | Python | GeeksForGeeks | View Code |
5 | Sum of Query II | Sum of Given range | Python | GeeksForGeeks | View Code |
6 | Geeks and his classmates | Rearrange Array with space complexity of O(1) | Python | GeeksForGeeks | View Code |
7 | Nth Natural Number | Base 9 | Python | GeeksForGeeks | View Code |
8 | Count all possible paths | Dynamic Programming | Python | GeeksForGeeks | View Code |
9 | Juggling Algorithm | Array Rotation | Python | GeeksForGeeks | View Code |
10 | Merge Overlapping Intervals | Overlapping Intervals | Python | GeeksForGeeks | View Code |
11 | Trapping Rain Water | compute how much water can be trapped between the blocks | Python | GeeksForGeeks | View Code |
12 | Find the repeating and the missing | two equations using sum and sum of squares | Python | GeeksForGeeks | View Code |
13 | Median of Two sorted arrays | Finding the median - Binary Search | Python | GeeksForGeeks | View Code |
14 | Number of occurrence | Find the no. occurence of an element- Binary Search | Python | GeeksForGeeks | View Code |
15 | First and last occurrences of X | First and last occurrences of X in an array - Binary Search | Python | GeeksForGeeks | View Code |
16 | Spiral Matrix | Spiral Matrix | Python | GeeksForGeeks | View Code |
17 | Set Matrix Zeros | Set its entire row and col to 0 if an element is 0 | C++ | LeetCode | View Code |
18 | N-Queens | Placing N queens in NxN chess board without attacking other queen | C++ | LeetCode | View Code |
19 | Last Stone Weight | Return the smallest possible weight of the left stone | C++ | LeetCode | View Code |
20 | Sieve of Eratosthenes | Find all the Prime numbers in the given range | C++ | GeeksForGeeks | View Code |
21 | Next Permutation | To find Lexicographically next greater permutation | Python | GeeksForGeeks | View Code |
22 | Sliding Window Maximum | Finding the maximum of each contagious subarray | C++ | LeetCode | View Code |
23 | Merge Without Extra Space | Merge two sorted arrays with space complexity O(1) | Python | GeeksForGeeks | View Code |
24 | Moore Majority Voting Algorithm | Majority Element i.e the ele occurs more than n/2 times | Python | GeeksForGeeks | View Code |
25 | 4 SUM | Find all the unique quadruple = SUM | Python | GeeksForGeeks | View Code |
26 | Largest subarray with 0 sum | compute the length of the largest subarray with sum 0 | Python | GeeksForGeeks | View Code |
27 | Length of the longest substring | find the length of the longest substring without repeating characters | Python | GeeksForGeeks | View Code |
28 | Merge two sorted linked lists | The task is to merge both of the list | Python | GeeksForGeeks | View Code |
29 | Find middle of LinkedList | Finding middle element in a linked list | Python | GeeksForGeeks | View Code |
30 | Reverse a linked list | The task is to reverse this list | Python | GeeksForGeeks | View Code |
31 | Python | GeeksForGeeks | View Code | ||
32 | Python | GeeksForGeeks | View Code | ||
32 | Python | GeeksForGeeks | View Code | ||
34 | |||||
35 | |||||
36 | |||||
37 | |||||
38 | |||||
39 | |||||
40 | |||||
41 | |||||
42 | |||||
43 | |||||
44 | |||||
45 | |||||
46 | |||||
47 | |||||
48 | |||||
49 | |||||
50 | |||||
51 | |||||
52 | |||||
53 | |||||
54 | |||||
55 | |||||
56 | |||||
57 | |||||
58 | |||||
59 | |||||
60 | |||||
61 | |||||
62 | |||||
63 | |||||
64 | |||||
65 | |||||
66 | |||||
67 | |||||
68 | |||||
69 | |||||
70 | |||||
71 | |||||
72 | |||||
73 | |||||
74 | |||||
75 | |||||
76 | |||||
77 | |||||
78 | |||||
79 | |||||
80 | |||||
81 | |||||
82 | |||||
83 | |||||
84 | |||||
85 | |||||
86 | |||||
87 | |||||
88 | |||||
89 | |||||
90 | |||||
91 | |||||
92 | |||||
93 | |||||
94 | |||||
95 | |||||
96 | |||||
97 | |||||
98 | |||||
99 | |||||
100 |