100-Days-of-Code

KO | EN

gitlite — search

#hacktoberfest #ai #typescript #llm #android #rust #linux #docker #windows #cli #pytorch #security #openai #mcp

100-Days-of-Code

(★ 62)

All DSA and GSOC aspirants are Welcome to participate

100-Days-of-Code Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# 100 Days of Code

![100 Days of Code](https://raw.githubusercontent.com/kushagra414/100-Days-of-Code/master/images/100_days_of_code.jpeg)

## Data Structure and Algorithms
- In this repository I will to post links to 3 DSA questions everyday, from Day 1 to Day 100.
- On Saturdays and Sundays I will post 6 questions, out of which 4 will be compulsory and other 2 will be optional.
- You should complete the questions in 90 min and give 30 min to understand the solution if you are unable to solve the question, but there is no fast and hard rules
- These links will be present in this readme as well as in the issue sections.
- You should make a folder in this repository with your name in which you can create your own readme, where you tell if you completed the tasks on that particular day or not. for eg checkout [1.demo](1.demo/) folder.
- You can submit a pull-request after you have completed the given questions.
- The questions will be easy in the beginning and they will gradually become harder and harder day by day.
- There will be an *IDIOT* box for each day in this readme , displaying the names of people who participated in **100 Days of Code** and did not complete the given tasks on a particular day.
- All the questions must be attempted in C/C++ or Java. No other Language is allowed.
> Here you can check my schedule for completing the [**100 Days of Code**](KushagraShekhawat/Schedule.md)

---

## Google Summer of Code
- This repository will also work as a diary for [**GSOC**](https://summerofcode.withgoogle.com/about/).
- There will be issue for GSOC aspirants, who can complete those tasks daily for increasing their chances of selection in GSOC.
- All other rules are same as that for **DSA**.

> **Note** : You have to mention whether you are participating in **100 Days of code** as a DSA student, GSOC aspirant or as both.

---

- This table specifies the name of student participating in **100 Days of code** and their jobs. 
- You have to add your name to this list. If you are participating.

|   Name                         | DSA  |  GSOC  |
| ---                            | ---  | ---    |
| Deepak Kumar                   |YES   |TRY     |
| Dhruv Yadav                    |YES   |NO      |
| Janmaijai Rana                 |YES   |YES     |
| Kushagra Shekhawat             |YES   |YES     |
| Shashwat Shukla                |YES   |TRY     |
| Vaibhav Kumar                  |YES   |NO      |

> 100 Days of Code will start from 13/01/2020

---

![Number of Days](https://img.shields.io/badge/Number%20of%20Days-100-brightgreen)
![Number of DSA Questions](https://img.shields.io/badge/Number%20of%20DSA%20Questions-263-orange)
![Time given to GSOC](https://img.shields.io/badge/Time%20given%20to%20GSOC-Probably%20more%20than%20300%20hours-blueviolet)

---

### **Day minus 3**
#### Tasks
- [ ] Learn Git/GitHub.
- [ ] Submit your Name for 100 Days of Code. 
> **IDIOT BOX** : Empty

---

### **Day minus 2**
#### Tasks
- [ ] Learn Git/GitHub.
- [ ]  Submit your Name for 100 Days of Code.
> **IDIOT BOX** : Empty

---

### **Day minus 1**
#### Tasks
- [ ] Learn Git/GitHub.
- [ ]  Submit your Name for 100 Days of Code.
> **IDIOT BOX** : Empty

---

### **Day 1**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Subarray with given sum](https://practice.geeksforgeeks.org/problems/subarray-with-given-sum/0)
- [x] [Missing number in array](https://practice.geeksforgeeks.org/problems/missing-number-in-array/0)
- [x] [Leaders in an array](https://practice.geeksforgeeks.org/problems/leaders-in-an-array/0)
> Algorithms(Optional)
- [x] [Kth smallest element](https://practice.geeksforgeeks.org/problems/kth-smallest-element/0)
- [x] [Majority Elementy](https://practice.geeksforgeeks.org/problems/majority-element/0)
> GSOC
- [x] Find an Organisation to contrinute to, you can [this](https://docs.google.com/spreadsheets/d/1pAHnRLsRMe2AmXTWcy1QQ_IGwtIBPgymj2QQn1fZiUI/edit#gid=0) data to select an organisation.
- [x] Find some `good first issues` to solve, you can also cotribute in Documentation of the Organisation.
> **IDIOT BOX** : Janmaijai

---

### **Day 2**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Finding middle element in a linked list](https://practice.geeksforgeeks.org/problems/finding-middle-element-in-a-linked-list/1)
- [x] [Reverse a linked list](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list/1)
- [x] [Detect Loop in linked list](https://practice.geeksforgeeks.org/problems/detect-loop-in-linked-list/1)
> Algorithms(Optional)
- [x] [Sort an array of 0s, 1s and 2s](https://practice.geeksforgeeks.org/problems/sort-an-array-of-0s-1s-and-2s/0)
- [x] [Chocolate Distribution Problem](https://practice.geeksforgeeks.org/problems/chocolate-distribution-problem/0)
> GSOC
- [x] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv

---

### **Day 3**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Immediate Smaller Element](https://practice.geeksforgeeks.org/problems/immediate-smaller-element/0)
- [x] [Level order traversal in spiral form](https://practice.geeksforgeeks.org/problems/level-order-traversal-in-spiral-form/1)
- [x] [Queue using two Stacks](https://practice.geeksforgeeks.org/problems/queue-using-two-stacks/1)
> Algorithms(Optional)
- [x] [Sort a stack](https://practice.geeksforgeeks.org/problems/sort-a-stack/1)
- [x] [Recursively remove all adjacent duplicates](https://practice.geeksforgeeks.org/problems/recursively-remove-all-adjacent-duplicates/0)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav

---

### **Day 4**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Implement Queue using array](https://practice.geeksforgeeks.org/problems/implement-queue-using-array/1)
- [x] [Valid Substring](https://practice.geeksforgeeks.org/problems/valid-substring/0)
- [x] [Reverse First K elements of Queue](https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1)
> Algorithms(Optional)
- [x] [Activity Selection](https://practice.geeksforgeeks.org/problems/activity-selection/0)
- [x] [Max length chain](https://practice.geeksforgeeks.org/problems/max-length-chain/1)
> GSOC
- [x] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav, Shashwat

---

### **Day 5**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Height of Binary Tree](https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1)
- [x] [Left View of Binary Tree](https://practice.geeksforgeeks.org/problems/left-view-of-binary-tree/1)
- [x] [Print all nodes that don't have sibling](https://practice.geeksforgeeks.org/problems/print-all-nodes-that-dont-have-sibling/1)
- [x] [Determine if Two Trees are Identical](https://practice.geeksforgeeks.org/problems/determine-if-two-trees-are-identical/1)
> Algorithms(Optional)
- [x] [Finding the numbers](https://practice.geeksforgeeks.org/problems/finding-the-numbers/0)
- [x] [Josephus problem](https://practice.geeksforgeeks.org/problems/josephus-problem/1)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Deepak

---

### **Day 6**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Minimum element in BST](https://practice.geeksforgeeks.org/problems/minimum-element-in-bst/1)
- [ ] [Inorder Successor in BST](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1)
- [x] [Array to BST](https://practice.geeksforgeeks.org/problems/array-to-bst/0)
- [x] [Insert a node in a BST](https://practice.geeksforgeeks.org/problems/insert-a-node-in-a-bst/1)
> Algorithms(Optional)
- [x] [Primes sum](https://practice.geeksforgeeks.org/problems/primes-sum/0)
- [ ] [Largest prime factor](https://practice.geeksforgeeks.org/problems/largest-prime-factor/0)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav, Janmaijai

---

### **Day 7**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Key Pair](https://practice.geeksforgeeks.org/problems/key-pair/0)
- [x] [Find all pairs with a given sum](https://practice.geeksforgeeks.org/problems/find-all-pairs-whose-sum-is-x/0)
- [x] [Common elements](https://practice.geeksforgeeks.org/problems/common-elements/0)
> Optional
- [x] [First non-repeating character in a stream](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav

---

### **Day 8**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Spirally traversing a matrix](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix/0)
- [x] [Search in a matrix](https://practice.geeksforgeeks.org/problems/search-in-a-matrix/0)
- [x] [Flood fill Algorithm](https://practice.geeksforgeeks.org/problems/flood-fill-algorithm/0)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav, Deepak, Shashwat, Janmaijai

---

### **Day 9**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Equilibrium point](https://practice.geeksforgeeks.org/problems/equilibrium-point/0)
- [x] [Maximum Index](https://practice.geeksforgeeks.org/problems/maximum-index/0)
- [x] [Inversion of array](https://practice.geeksforgeeks.org/problems/inversion-of-array/0)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav, Deepak, Shashwat

---

### **Day 10**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Check if Linked List is Palindrome](https://practice.geeksforgeeks.org/problems/check-if-linked-list-is-pallindrome/1)
- [x] [Nth node from end of linked list](https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1)
- [x] [Remove loop in Linked List](https://practice.geeksforgeeks.org/problems/remove-loop-in-linked-list/1)
> GSOC
- [ ] Work on some issues and try to fix them.
> **IDIOT BOX** : Dhruv, Vaibhav, Deepak, Shashwat,Janmaijai

---

### **Day 11**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Parenthesis Checker](https://practice.geeksforgeeks.org/problems/parenthesis-checker/0)
- [x] [Next larger element](https://practice.geeksforgeeks.org/problems/next-larger-element/0)
- [x] [Get minimum element from stack](https://practice.geeksforgeeks.org/problems/get-minimum-element-from-stack/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Janmaijai

---

### **Day 12**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [ ] [LRU Cache](https://practice.geeksforgeeks.org/problems/lru-cache/1)
- [x] [Stack using two queues](https://practice.geeksforgeeks.org/problems/stack-using-two-queues/1)
- [ ] [Maximum of all subarrays of size k](https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k/0)
- [x] [Circular tour](https://practice.geeksforgeeks.org/problems/circular-tour/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Janmaijai

---

### **Day 13**
#### Tasks
**DSA :**
> Data Structure(Compulsory)
- [x] [Sum Tree](https://practice.geeksforgeeks.org/problems/sum-tree/1)
- [x] [Check for BST](https://practice.geeksforgeeks.org/problems/check-for-bst/1)
- [x] [Root to leaf path sum](https://practice.geeksforgeeks.org/problems/root-to-leaf-path-sum/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 14**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
> Data Structure(Compulsory)
- [ ] [Inorder Successor in BST](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1)
- [x] [Largest prime factor](https://practice.geeksforgeeks.org/problems/largest-prime-factor/0)
- [ ] [First non-repeating character in a stream](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0)
- [ ] [LRU Cache](https://practice.geeksforgeeks.org/problems/lru-cache/1)
- [ ] [Maximum of all subarrays of size k](https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k/0)
- [x] [Check for BST](https://practice.geeksforgeeks.org/problems/check-for-bst/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 15**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
> Data Structure(Compulsory)
- [ ] [Inorder Successor in BST](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1)
- [x] [First non-repeating character in a stream](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream/0)
- [ ] [LRU Cache](https://practice.geeksforgeeks.org/problems/lru-cache/1)
- [ ] [Maximum of all subarrays of size k](https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k/0)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 16**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
> Data Structure(Compulsory)
- [x] [Inorder Successor in BST](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1)
- [ ] [LRU Cache](https://practice.geeksforgeeks.org/problems/lru-cache/1)
- [x] [Maximum of all subarrays of size k](https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k/0)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 17**
**DSA :**
> Data Structure(Compulsory)
- [x] [Sorting Elements of an Array by Frequency](https://practice.geeksforgeeks.org/problems/sorting-elements-of-an-array-by-frequency/0)
- [x] [Relative Sorting](https://practice.geeksforgeeks.org/problems/relative-sorting/0)
- [ ] [Top View of Binary Tree](https://practice.geeksforgeeks.org/problems/top-view-of-binary-tree/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak, Janmaijai

---

### **Day 18**
**DSA :**
> Data Structure(Compulsory)
- [x] [Shortest Source to Destination Path](https://practice.geeksforgeeks.org/problems/shortest-source-to-destination-path/0)
- [ ] [Path in Matrix](https://practice.geeksforgeeks.org/problems/path-in-matrix/0)
- [ ] [Boolean Matrix Problem](https://practice.geeksforgeeks.org/problems/boolean-matrix-problem/0)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak, Janmaijai

---

### **Day 19**
**DSA :**
> Data Structure(Compulsory)
- [x] [Kadane's Algorithm](https://practice.geeksforgeeks.org/problems/kadanes-algorithm/0)
- [x] [Minimum Platforms](https://practice.geeksforgeeks.org/problems/minimum-platforms/0)
- [x] [Maximum Index](https://practice.geeksforgeeks.org/problems/maximum-index/0)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 20**
**DSA :**
> Data Structure(Compulsory)
- [x] [Delete without head pointer](https://practice.geeksforgeeks.org/problems/delete-without-head-pointer/1)
- [x] [Reverse a Linked List in groups of given size](https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1)
- [x] [Intersection Point in Y Shaped Linked Lists](https://practice.geeksforgeeks.org/problems/intersection-point-in-y-shapped-linked-lists/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 21**
**DSA :**
> Data Structure(Compulsory)
- [x] [Infix to Postfix ](https://practice.geeksforgeeks.org/problems/infix-to-postfix/0)
- [x] [The Celebrity Problem](https://practice.geeksforgeeks.org/problems/the-celebrity-problem/1)
- [x] [Maximum Rectangular Area in a Histogram ](https://practice.geeksforgeeks.org/problems/maximum-rectangular-area-in-a-histogram/0)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai, Deepak

---

### **Day 22**
**DSA :**
> Data Structure(Compulsory)
- [x] [Count the Reversals](https://practice.geeksforgeeks.org/problems/count-the-reversals/0)
- [ ] [Minimum Cost of ropes](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0)
- [ ] [Rotten Oranges](https://practice.geeksforgeeks.org/problems/rotten-oranges/0)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai, Deepak

---

### **Day 23**
**DSA :**
> Data Structure(Compulsory)
- [ ] [Count subsequences of type a^i, b^j, c^k](https://practice.geeksforgeeks.org/problems/count-subsequences-of-type-ai-bj-ck4425/1)
- [x] [Clone a Binary Tree](https://practice.geeksforgeeks.org/problems/clone-a-binary-tree/1)
- [x] [Trie | (Insert and Search)](https://practice.geeksforgeeks.org/problems/trie-insert-and-search/0)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai, Deepak

---

### **Day 24**
**DSA :**
> Data Structure(Compulsory)
- [x] [Delete a node from BST](https://practice.geeksforgeeks.org/problems/delete-a-node-from-bst/1)
- [ ] [Count BST nodes that lie in a given range](https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1)
- [ ] [Largest BST](https://practice.geeksforgeeks.org/problems/largest-bst/1)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai, Deepak

---

### **Day 25**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [ ] [Path in Matrix](https://practice.geeksforgeeks.org/problems/path-in-matrix/0)
- [x] [Boolean Matrix Problem](https://practice.geeksforgeeks.org/problems/boolean-matrix-problem/0)
- [ ] [Minimum Cost of ropes](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0)
- [ ] [Rotten Oranges](https://practice.geeksforgeeks.org/problems/rotten-oranges/0)
- [ ] [Count subsequences of type a^i, b^j, c^k](https://practice.geeksforgeeks.org/problems/count-subsequences-of-type-ai-bj-ck4425/1)
- [x] [Count BST nodes that lie in a given range](https://practice.geeksforgeeks.org/problems/count-bst-nodes-that-lie-in-a-given-range/1)
- [x] [Largest BST](https://practice.geeksforgeeks.org/problems/largest-bst/1)
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 26**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [x] [Path in Matrix](https://practice.geeksforgeeks.org/problems/path-in-matrix/0)
- [ ] [Minimum Cost of ropes](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0)
- [x] [Rotten Oranges](https://practice.geeksforgeeks.org/problems/rotten-oranges/0)
- [ ] [Count subsequences of type a^i, b^j, c^k](https://practice.geeksforgeeks.org/problems/count-subsequences-of-type-ai-bj-ck4425/1)
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 27**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [x] [Minimum Cost of ropes](https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes/0)
- [ ] [Count subsequences of type a^i, b^j, c^k](https://practice.geeksforgeeks.org/problems/count-subsequences-of-type-ai-bj-ck4425/1)
- [x] Learn MinHeap and MaxHeap.
- [ ] Learn Graph Traversal Methods.
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 28**
**DSA :**
- [x] [Binary Heap Operations](https://practice.geeksforgeeks.org/problems/operations-on-binary-min-heap/1)
- [x] [Heap Sort](https://practice.geeksforgeeks.org/problems/heap-sort/1)
- [x] [Rearrange characters](https://practice.geeksforgeeks.org/problems/rearrange-characters/0)
- [ ] Learn Graph Traversal Methods.
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 29**
**DSA :**
- [x] [Longest consecutive subsequence](https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence/0)
- [x] [Array Pair Sum Divisibility Problem](https://practice.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem/0)
- [x] [Find all four sum numbers](https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers/0)
- [ ] Learn Graph Traversal Methods.
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

### **Day 30**
**DSA :**
- [x] [Rat in a Maze Problem](https://practice.geeksforgeeks.org/problems/rat-in-a-maze-problem/1)
- [ ] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [x] [Row with max 1s](https://practice.geeksforgeeks.org/problems/row-with-max-1s/0)
- [ ] Learn Graph Traversal Methods.
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai

---

Hello Guys, 
 
Those of you who have completed 30 days of code successfully, Congratulations are in order :clap: :tada: :checkered_flag: :beers: :triangular_flag_on_post: 
 
Take some time and reflect on your Achievement. 
 
How much have you learned in this month of coding, Compare yourself from your past 1 month. 
 
You need to keep on pushing yourself and create new limits every day, Make yourself better than your past. 
 
Finally, there is a long road ahead **Keep on Grinding** :muscle: .

---

### **Day 31**
**DSA :**
- [x] [Find Missing And Repeating](https://practice.geeksforgeeks.org/problems/find-missing-and-repeating/0)
- [x] [Stock buy and sell](https://practice.geeksforgeeks.org/problems/stock-buy-and-sell/0)
- [ ] [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)
- [ ] Learn Graph Traversal Methods.
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav

---

### **Day 32**
**DSA :**
- [ ] [Clone a linked list with next and random pointer](https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)
- [x] [Flattening a Linked List](https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1)
- [ ] [Delete nodes having greater value on right](https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Janmaijai, Deepak

---

### **Day 33**
**DSA :**
- [x] [Special Stack](https://practice.geeksforgeeks.org/problems/special-stack/1)
- [x] [Get min at pop](https://practice.geeksforgeeks.org/problems/get-min-at-pop/1)
- [x] [Reverse a string using Stack](https://practice.geeksforgeeks.org/problems/reverse-a-string-using-stack/1)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat

---

### **Day 34**
**DSA :**
- [ ] [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation/0)
- [ ] [Make Binary Tree From Linked List](https://practice.geeksforgeeks.org/problems/make-binary-tree/1)
- [ ] [Check Mirror in N-ary tree](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)
- [ ] [Dequeue Implementations](https://practice.geeksforgeeks.org/problems/print-binary-tree-levels-in-sorted-order/0)
- [x] [Deque Implementations](https://practice.geeksforgeeks.org/problems/deque-implementations/1)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat

---

### **Day 35**
**DSA :**
- [ ] [Diameter of Binary Tree](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1)
- [x] [Lowest Common Ancestor in a BST](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-bst/1)
- [ ] [Boundary Traversal of binary tree](https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat, Deepak, Janmaijai

---

### **Day 36**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [ ] [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)
- [ ] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [x] [Clone a linked list with next and random pointer](https://practice.geeksforgeeks.org/problems/clone-a-linked-list-with-next-and-random-pointer/1)
- [ ] [Delete nodes having greater value on right](https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1)
- [ ] [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation/0)
- [ ] [Make Binary Tree From Linked List](https://practice.geeksforgeeks.org/problems/make-binary-tree/1)
- [ ] [Check Mirror in N-ary tree](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)
- [x] [Print Binary Tree levels in sorted order](https://practice.geeksforgeeks.org/problems/print-binary-tree-levels-in-sorted-order/0)
- [ ] [Diameter of Binary Tree](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1)
- [ ] [Boundary Traversal of binary tree](https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1)
> GSOC
- [x] Work on some issues and try to fix them.

>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat

---

### **Day 37**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [ ] [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)
- [ ] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [ ] [Delete nodes having greater value on right](https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1)
- [ ] [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation/0)
- [x] [Make Binary Tree From Linked List](https://practice.geeksforgeeks.org/problems/make-binary-tree/1)
- [ ] [Check Mirror in N-ary tree](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)
- [ ] [Print Binary Tree levels in sorted order](https://practice.geeksforgeeks.org/problems/print-binary-tree-levels-in-sorted-order/0)
- [ ] [Diameter of Binary Tree](https://practice.geeksforgeeks.org/problems/diameter-of-binary-tree/1)
- [x] [Boundary Traversal of binary tree](https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 38**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [ ] [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)
- [ ] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [x] [Delete nodes having greater value on right](https://practice.geeksforgeeks.org/problems/delete-nodes-having-greater-value-on-right/1)
- [ ] [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation/0)
- [ ] [Check Mirror in N-ary tree](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)
- [x] [Boundary Traversal of binary tree](https://practice.geeksforgeeks.org/problems/boundary-traversal-of-binary-tree/1)
> GSOC
- [x] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak, Janmaijai

---

### **Day 39**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [x] [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)
- [ ] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [ ] [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation/0)
- [ ] [Check Mirror in N-ary tree](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)
> GSOC
- [ ] Work on some issues and try to fix them.

### **Day 40**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [X] [Trapping Rain Water](https://practice.geeksforgeeks.org/problems/trapping-rain-water/0)
- [X] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [X] [Check Mirror in N-ary tree](https://practice.geeksforgeeks.org/problems/check-mirror-in-n-ary-tree/0)
> GSOC
- [ ] Work on some issues and try to fix them
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak, Janmaijai

---

### **Day 41**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
- [ ] [Find whether path exist](https://practice.geeksforgeeks.org/problems/find-whether-path-exist/0)
- [ ] [Card Rotation](https://practice.geeksforgeeks.org/problems/card-rotation/0)
> GSOC
- [ ] Work on some issues and try to fix them.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 42**
**DSA :**
- [x] [Largest Number formed from an Array](https://practice.geeksforgeeks.org/problems/largest-number-formed-from-an-array/0)
- [ ] [Finding Number](https://practice.geeksforgeeks.org/problems/finding-number/0)
- [ ] [Smallest Positive missing number](https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 43**
**DSA :**
- [x] [Rotate a Linked List](https://practice.geeksforgeeks.org/problems/rotate-a-linked-list/1)
- [x] [Delete keys in a Linked list ](https://practice.geeksforgeeks.org/problems/delete-keys-in-a-linked-list/1)
- [x] [Reorder List](https://practice.geeksforgeeks.org/problems/reorder-list/1)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 44**
**DSA :**
- [x] [Print Bracket Number](https://practice.geeksforgeeks.org/problems/print-bracket-number/0)
- [x] [Smallest number on left](https://practice.geeksforgeeks.org/problems/smallest-number-on-left/0)
- [x] [Max rectangle](https://practice.geeksforgeeks.org/problems/max-rectangle/1)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 45**
**DSA :**
- [x] [Mirror Tree](https://practice.geeksforgeeks.org/problems/mirror-tree/1)
- [x] [Chinky and diamonds](https://practice.geeksforgeeks.org/problems/chinky-and-diamonds/0)
- [x] [Next Right Node](https://practice.geeksforgeeks.org/problems/next-right-node/1)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak

---

### **Day 46**
**DSA :**
- [x] [Kth largest element in a stream](https://practice.geeksforgeeks.org/problems/kth-largest-element-in-a-stream/0)
- [ ] [Huffman Encoding](https://practice.geeksforgeeks.org/problems/huffman-encoding/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 47**
**DSA :**
- [x] [Zero Sum Subarrays](https://practice.geeksforgeeks.org/problems/zero-sum-subarrays/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 48**
**DSA :**
- [x] [Nearly Sorted Algorithm](https://practice.geeksforgeeks.org/problems/nearly-sorted-algorithm/0)
- [x] [Matrix Interchange](https://practice.geeksforgeeks.org/problems/matrix-interchange/1)
- [x] [Max distance between same elements](https://practice.geeksforgeeks.org/problems/max-distance-between-same-elements/1)
- [x] [Rotate a 2D array without using extra space](https://practice.geeksforgeeks.org/problems/rotate-a-2d-array-without-using-extra-space/0)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 49**
**DSA :**
- [x] [Merge K sorted linked lists](https://practice.geeksforgeeks.org/problems/merge-k-sorted-linked-lists/1)
- [ ] [QuickSort on Doubly Linked List](https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1)
- [ ] [Count Pairs whose sum is equal to X](https://practice.geeksforgeeks.org/problems/count-pairs-whose-sum-is-equal-to-x/1)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 50**
**DSA :**
- [x] [Delete middle element of a stack](https://practice.geeksforgeeks.org/problems/delete-middle-element-of-a-stack/1)
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Evaluation of Postfix Expression](https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 51**
**DSA :**
- [ ] [Addition of submatrix](https://practice.geeksforgeeks.org/problems/addition-of-submatrix/0)
- [x] [Pairs which are Divisible by 4](https://practice.geeksforgeeks.org/problems/pairs-which-are-divisible-by-4/0)
- [ ] [Find Transition Point](https://practice.geeksforgeeks.org/problems/find-transition-point/1)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 52**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [QuickSort on Doubly Linked List](https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1)
- [ ] [Count Pairs whose sum is equal to X](https://practice.geeksforgeeks.org/problems/count-pairs-whose-sum-is-equal-to-x/1)
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Evaluation of Postfix Expression](https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0)
- [ ] [Addition of submatrix](https://practice.geeksforgeeks.org/problems/addition-of-submatrix/0)
- [x] [Find Transition Point](https://practice.geeksforgeeks.org/problems/find-transition-point/1)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [ ] [Huffman Encoding](https://practice.geeksforgeeks.org/problems/huffman-encoding/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 53**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [QuickSort on Doubly Linked List](https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1)
- [x] [Count Pairs whose sum is equal to X](https://practice.geeksforgeeks.org/problems/count-pairs-whose-sum-is-equal-to-x/1)
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Evaluation of Postfix Expression](https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0)
- [ ] [Addition of submatrix](https://practice.geeksforgeeks.org/problems/addition-of-submatrix/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [ ] [Huffman Encoding](https://practice.geeksforgeeks.org/problems/huffman-encoding/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [ ] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 54**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [QuickSort on Doubly Linked List](https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1)
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Evaluation of Postfix Expression](https://practice.geeksforgeeks.org/problems/evaluation-of-postfix-expression/0)
- [x] [Addition of submatrix](https://practice.geeksforgeeks.org/problems/addition-of-submatrix/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [ ] [Huffman Encoding](https://practice.geeksforgeeks.org/problems/huffman-encoding/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 55**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [x] [QuickSort on Doubly Linked List](https://practice.geeksforgeeks.org/problems/quicksort-on-doubly-linked-list/1)
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [ ] [Huffman Encoding](https://practice.geeksforgeeks.org/problems/huffman-encoding/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 56**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Huffman Encoding](https://practice.geeksforgeeks.org/problems/huffman-encoding/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 57**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Adding Ones](https://practice.geeksforgeeks.org/problems/adding-ones/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 58**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Identical Linked Lists](https://practice.geeksforgeeks.org/problems/identical-linked-lists/1)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Start making Proposal for GSOC.
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 59**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Queue Push & Pop](https://practice.geeksforgeeks.org/problems/queue-designer/1)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Completed proposal for GSOC
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 60**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Nuts and Bolts Problem](https://practice.geeksforgeeks.org/problems/nuts-and-bolts-problem/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Completed proposal for GSOC
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 61**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Transpose of Matrix](https://practice.geeksforgeeks.org/problems/transpose-of-matrix/0)
- [x] [Maximum no of 1's row](https://practice.geeksforgeeks.org/problems/maximum-no-of-1s-row/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Completed proposal for GSOC
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 62**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Count Smaller elements](https://practice.geeksforgeeks.org/problems/count-smaller-elements/0)
- [ ] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Completed Draft proposal for GSOC
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 63**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [ ] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [ ] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
- [x] [Find median in a stream](https://practice.geeksforgeeks.org/problems/find-median-in-a-stream/0)
> GSOC
- [x] Submitted Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 64**
### Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Smallest distinct window](https://practice.geeksforgeeks.org/problems/smallest-distant-window/0)
- [x] [Smallest window in a string containing all the characters of another string](https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string/0)
> GSOC
- [x] Submitted Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 65**
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [In First But Second](https://practice.geeksforgeeks.org/problems/in-first-but-second/0)
- [ ] [Subarrays with equal 1s and 0s](https://practice.geeksforgeeks.org/problems/count-subarrays-with-equal-number-of-1s-and-0s/0)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 66**
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Merge k Sorted Arrays](https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1)
- [ ] [Subarrays with equal 1s and 0s](https://practice.geeksforgeeks.org/problems/count-subarrays-with-equal-number-of-1s-and-0s/0)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 67**
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Largest subarray of 0's and 1's](https://practice.geeksforgeeks.org/problems/largest-subarray-of-0s-and-1s/1)
- [x] [Subarrays with equal 1s and 0s](https://practice.geeksforgeeks.org/problems/count-subarrays-with-equal-number-of-1s-and-0s/0)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 68**
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Ugly Numbers](https://practice.geeksforgeeks.org/problems/ugly-numbers/0)
- [x] [Rearrange Array Alternately](https://practice.geeksforgeeks.org/problems/-rearrange-array-alternately/0)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 69**
**DSA :**
- [ ] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Binary Tree to DLL](https://practice.geeksforgeeks.org/problems/binary-tree-to-dll/1)
- [ ] [Leaves to DLL](https://practice.geeksforgeeks.org/problems/leaves-to-dll/1)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 70**
**DSA :**
- [x] [Preorder to Postorder](https://practice.geeksforgeeks.org/problems/preorder-to-postorder/0)
- [x] [Leaves to DLL](https://practice.geeksforgeeks.org/problems/leaves-to-dll/1)
- [x] [Connect Nodes at Same Level](https://practice.geeksforgeeks.org/problems/connect-nodes-at-same-level/1)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 71**
**DSA :**
- [x] [Convert Level Order Traversal to BST](https://practice.geeksforgeeks.org/problems/convert-level-order-traversal-to-bst/1)
- [x] [Construct Tree from Preorder Traversal](https://practice.geeksforgeeks.org/problems/construct-tree-from-preorder-traversal/1)
> GSOC
- [x] Improve Draft Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 72**
**DSA :**
- [x] [Smallest range in K lists](https://practice.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1)
- [x] [Longest consecutive subsequence](https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence2449/1)
- [x] [Longest Sub-Array with Sum K](https://practice.geeksforgeeks.org/problems/longest-sub-array-with-sum-k/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 73**
**DSA :**
- [x] [Rearrange an array with O(1) extra space](https://practice.geeksforgeeks.org/problems/rearrange-an-array-with-o1-extra-space/01)
- [x] [Smallest Positive missing number](https://practice.geeksforgeeks.org/problems/smallest-positive-missing-number/1)
- [x] [Maximum Sub Array](https://practice.geeksforgeeks.org/problems/maximum-sub-array/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 74**
**DSA :**
- [x] [Given a linked list, reverse alternate nodes and append at the end](https://practice.geeksforgeeks.org/problems/given-a-linked-list-reverse-alternate-nodes-and-append-at-the-end/1)
- [x] [Binary Tree to CDLL](https://practice.geeksforgeeks.org/problems/binary-tree-to-cdll/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 75**
**DSA :**
- [x] [Print leaf nodes from preorder traversal of BST](https://practice.geeksforgeeks.org/problems/print-leaf-nodes-from-preorder-traversal-of-bst/0)
- [x] [Save Gotham!](https://practice.geeksforgeeks.org/problems/save-gotham/0)
- [x] [Foldable Binary Tree](https://practice.geeksforgeeks.org/problems/foldable-binary-tree/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 76**
**DSA :**
- [x] [Convert an array to reduced form](https://practice.geeksforgeeks.org/problems/convert-an-array-to-reduced-form/0)
- [x] [Design a tiny URL or URL shortener](https://practice.geeksforgeeks.org/problems/design-a-tiny-url-or-url-shortener/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 77**
**DSA :**
- [x] [Construct expression tree](https://practice.geeksforgeeks.org/problems/construct-an-expression-tree/1)
- [x] [Number of root to leaf paths](https://practice.geeksforgeeks.org/problems/number-of-root-to-leaf-paths/1)
- [x] [Find the Closest Element in BST](https://practice.geeksforgeeks.org/problems/find-the-closest-element-in-bst/1/) 
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 78**
**DSA :**
- [x] [Add all greater values to every node in a BST](https://practice.geeksforgeeks.org/problems/add-all-greater-values-to-every-node-in-a-bst/1)
- [x] [Merge two BST 's](https://practice.geeksforgeeks.org/problems/merge-two-bst-s/1)
- [x] [k-th smallest element in BST](https://practice.geeksforgeeks.org/problems/find-k-th-smallest-element-in-bst/1) 
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 79**
**DSA :**
- [x] [Find a pair with given target in BST](https://practice.geeksforgeeks.org/problems/find-a-pair-with-given-target-in-bst/1)
- [x] [Pairs violating BST property](https://practice.geeksforgeeks.org/problems/pairs-violating-bst-property/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 80**
**DSA :**
- [x] [Preorder Traversal and BST](https://practice.geeksforgeeks.org/problems/preorder-traversal-and-bst/0)
- [x] [Count Number of SubTrees having given Sum](https://practice.geeksforgeeks.org/problems/count-number-of-subtrees-having-given-sum/1)
- [x] [Quick Sort on Linked List](https://practice.geeksforgeeks.org/problems/quick-sort-on-linked-list/1)
- [x] [Merge Sort on Doubly Linked List](https://practice.geeksforgeeks.org/problems/merge-sort-on-doubly-linked-list/1) 
> GSOC
- [x] Submitted Proposal

---

### **Day 81**
**DSA :**
- [x] [Add two numbers represented by Linked List](https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-list/1)
- [x] [Swap Kth nodes from ends](https://practice.geeksforgeeks.org/problems/swap-kth-node-from-beginning-and-kth-node-from-end-in-a-singly-linked-list/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 82**
**DSA :**
- [x] [Extreme nodes in alternate order](https://practice.geeksforgeeks.org/problems/extreme-nodes-in-alternate-order/1)
- [x] [Leftmost and rightmost nodes of binary tree](https://practice.geeksforgeeks.org/problems/leftmost-and-rightmost-nodes-of-binary-tree/1)
- [x] [Check if subtree](https://practice.geeksforgeeks.org/problems/check-if-subtree/1) 
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 83**
**DSA :**
- [x] [Bottom View of Binary Tree](https://practice.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1)
- [x] [Serialize and Deserialize a Binary Tree](https://practice.geeksforgeeks.org/problems/serialize-and-deserialize-a-binary-tree/1)
- [x] [Min distance between two given nodes of a Binary Tree](https://practice.geeksforgeeks.org/problems/min-distance-between-two-given-nodes-of-a-binary-tree/1)
- [x] [Lowest Common Ancestor in a Binary Tree](https://practice.geeksforgeeks.org/problems/lowest-common-ancestor-in-a-binary-tree/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 84**
**DSA :**
- [x] [Mirror of a given node](https://practice.geeksforgeeks.org/problems/mirror-of-a-given-node/1)
- [x] [Height of Binary Tree](https://practice.geeksforgeeks.org/problems/height-of-binary-tree/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 85**
**DSA :**
- [x] [Construct Binary Tree from Parent Array](https://practice.geeksforgeeks.org/problems/construct-binary-tree-from-parent-array/1)
- [x] [Sum of bit differences](https://practice.geeksforgeeks.org/problems/sum-of-bit-differences/0)
- [x] [Minimum Swaps to Sort](https://practice.geeksforgeeks.org/problems/minimum-swaps/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 86**
**DSA :**
- [x] [Sorting Elements of an Array by Frequency](https://practice.geeksforgeeks.org/problems/sorting-elements-of-an-array-by-frequency/1)
- [x] [Count of Subarrays](https://practice.geeksforgeeks.org/problems/count-of-subarrays/0)
- [x] [Overlapping Intervals](https://practice.geeksforgeeks.org/problems/overlapping-intervals/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 87**
**DSA :**
- [x] [Subarrays with equal 1s and 0s](https://practice.geeksforgeeks.org/problems/count-subarrays-with-equal-number-of-1s-and-0s/1)
- [x] [Maximize the sum of selected numbers from an array to make it empty](https://practice.geeksforgeeks.org/problems/maximize-the-sum-of-selected-numbers-from-an-array-to-make-it-empty/0)
- [x] [Equal Sum](https://practice.geeksforgeeks.org/problems/equal-sum/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 88**
**DSA :**
- [x] [Minimum swaps and K together](https://practice.geeksforgeeks.org/problems/minimum-swaps-required-to-bring-all-elements-less-than-or-equal-to-k-together/0)
- [x] [Maximum bitonic subarray sum](https://practice.geeksforgeeks.org/problems/maximum-bitonic-subarray-sum/0)
- [x] [Possible groups](https://practice.geeksforgeeks.org/problems/possible-groups/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 89**
**DSA :**
- [x] [Smallest Absolute Difference](https://practice.geeksforgeeks.org/problems/smallest-absolute-difference/0)
- [x] [The Tiny Miny](https://practice.geeksforgeeks.org/problems/the-tiny-miny/0)
- [x] [Maximize The Array](https://practice.geeksforgeeks.org/problems/maximize-the-array/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 90**
**DSA :**
- [x] [Longest subarray with sum divisible by K](https://practice.geeksforgeeks.org/problems/longest-subarray-with-sum-divisible-by-k/0)
- [x] [Maximum length Bitonic Subarray](https://practice.geeksforgeeks.org/problems/maximum-length-bitonic-subarray/0)
- [x] [Largest Sum Subarray of Size at least K](https://practice.geeksforgeeks.org/problems/largest-sum-subarray-of-size-at-least-k/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 91**
**DSA :**
- [x] [Number to words](https://practice.geeksforgeeks.org/problems/number-to-words/0)
- [x] [Sum of XOR of all pairs](https://practice.geeksforgeeks.org/problems/sum-of-xor-of-all-pairs/0)
- [x] [Minimum sum](https://practice.geeksforgeeks.org/problems/minimum-sum/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 92**
**DSA :**
- [x] [Sum of permutations](https://practice.geeksforgeeks.org/problems/sum-of-permutations/1)
- [x] [Overlapping Intervals](https://practice.geeksforgeeks.org/problems/overlapping-intervals4919/1)
- [x] [Large Factorials](https://practice.geeksforgeeks.org/problems/large-factorials/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 93**
**DSA :**
- [x] [Minimums in Array](https://practice.geeksforgeeks.org/problems/minimums-in-array/0)
- [x] [Counts Zeros Xor Pairs](https://practice.geeksforgeeks.org/problems/counts-zeros-xor-pairs/0)
- [x] [Count the Zeros](https://practice.geeksforgeeks.org/problems/count-the-zeros/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 94**
**DSA :**
- [x] [Remove duplicate element from sorted Linked List](https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1)
- [x] [Add two numbers represented by linked lists](https://practice.geeksforgeeks.org/problems/add-two-numbers-represented-by-linked-lists/1)
- [x] [Delete a Node in Single Linked List](https://practice.geeksforgeeks.org/problems/delete-a-node-in-single-linked-list/1)
- [x] [Merge two sorted linked lists](https://practice.geeksforgeeks.org/problems/merge-two-sorted-linked-lists/1)
- [x] [Pairwise swap elements of a linked list](https://practice.geeksforgeeks.org/problems/pairwise-swap-elements-of-a-linked-list-by-swapping-data/1)
- [x] [Find length of Loop](https://practice.geeksforgeeks.org/problems/find-length-of-loop/1)
- [x] [Intersection of two sorted Linked lists](https://practice.geeksforgeeks.org/problems/intersection-of-two-sorted-linked-lists/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 95**
**DSA :**
- [x] [Union of Two Linked Lists](https://practice.geeksforgeeks.org/problems/union-of-two-linked-list/1)
- [x] [Rearrange an array such that arr[i] = i](https://practice.geeksforgeeks.org/problems/rearrange-an-array-such-that-arri-i/0)
- [x] [Frequencies of Limited Range Array Elements](https://practice.geeksforgeeks.org/problems/frequency-of-array-elements/0)
- [x] [Swapping pairs make sum equal](https://practice.geeksforgeeks.org/problems/swapping-pairs-make-sum-equal/0)
- [x] [Largest subarray with 0 sum](https://practice.geeksforgeeks.org/problems/largest-subarray-with-0-sum/1)
- [x] [Check if array contains contiguous integers with duplicates allowed](https://practice.geeksforgeeks.org/problems/check-if-array-contains-contiguous-integers-with-duplicates-allowed/0)
- [x] [Non-Repeating Element](https://practice.geeksforgeeks.org/problems/non-repeating-element/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 96**
**DSA :**
- [x] [Sum of leaf nodes in BST](https://practice.geeksforgeeks.org/problems/sum-of-leaf-nodes-in-bst/1)
- [x] [Level order traversal](https://practice.geeksforgeeks.org/problems/level-order-traversal/1)
- [x] [Check for Balanced Tree](https://practice.geeksforgeeks.org/problems/check-for-balanced-tree/1)
- [x] [Level order traversal Line by Line](https://practice.geeksforgeeks.org/problems/level-order-traversal-line-by-line/1)
- [x] [Count distinct elements in every window](https://practice.geeksforgeeks.org/problems/count-distinct-elements-in-every-window/1)
- [x] [Find duplicates in an array](https://practice.geeksforgeeks.org/problems/find-duplicates-in-an-array/1)
- [x] [Reverse Level Order Traversal](https://practice.geeksforgeeks.org/problems/reverse-level-order-traversal/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 97**
**DSA :**
- [x] [Stock span problem](https://practice.geeksforgeeks.org/problems/stock-span-problem/0)
- [x] [Sum of Leaf Nodes](https://practice.geeksforgeeks.org/problems/sum-of-leaf-nodes/1)
- [x] [Sum of Right Leaf Nodes](https://practice.geeksforgeeks.org/problems/sum-of-right-leaf-nodes/1)
- [x] [Max Level Sum in Binary Tree](https://practice.geeksforgeeks.org/problems/max-level-sum-in-binary-tree/1)
- [x] [Minimum Depth of a Binary Tree](https://practice.geeksforgeeks.org/problems/minimum-depth-of-a-binary-tree/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 98**
**DSA :**
- [x] [Populate Inorder Successor for all nodes](https://practice.geeksforgeeks.org/problems/populate-inorder-successor-for-all-nodes/1)
- [x] [Print Nodes having K leaves ](https://practice.geeksforgeeks.org/problems/print-nodes-having-k-leaves/1)
- [x] [Maximum difference between node and its ancestor](https://practice.geeksforgeeks.org/problems/maximum-difference-between-node-and-its-ancestor/1)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 99**
**DSA :**
- [x] [Number of Turns in Binary Tree](https://practice.geeksforgeeks.org/problems/number-of-turns-in-binary-tree/1)
- [x] [Fixing Two nodes of a BST](https://practice.geeksforgeeks.org/problems/fixed-two-nodes-of-a-bst/1)
- [x] [Maximum of minimum for every window size](https://practice.geeksforgeeks.org/problems/maximum-of-minimum-for-every-window-size/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

---

### **Day 100**
**DSA :**
- [x] [Need Some Change](https://practice.geeksforgeeks.org/problems/need-some-change/1)
- [x] [Count Pairs in an Array](https://practice.geeksforgeeks.org/problems/count-pairs-in-an-array/0)
- [x] [First negative integer in every window of size k](https://practice.geeksforgeeks.org/problems/first-negative-integer-in-every-window-of-size-k/0)
- [x] [Remove all duplicates from a given string](https://practice.geeksforgeeks.org/problems/remove-all-duplicates-from-a-given-string/0)
- [x] [Distinct absolute array elements](https://practice.geeksforgeeks.org/problems/distinct-absolute-array-elements/0)
> GSOC
- [x] Submitted Proposal
>**IDIOT BOX** : Dhruv, Vaibhav, Shashwat,Deepak,Janmaijai

# Finished 100 Days of Code Successfully  :fire:. Currently I am waiting for the GSOC Results. Thank you everyone who was part of the program.

100-Days-of-Code

100-Days-of-Code Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

100-Days-of-Code

100-Days-of-Code Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README