🎯 100-Days-DSA Challenge

Data Structure and Algorithms

• In this repository, I will post links to 5-10 DSA questions every day( Question level - Starting from basic), from Day 1 to Day 100.
• On Saturdays and Sundays I will post 10-20 questions.

• Strategy

• Monday to Friday- (5-10 Questions) 4 hrs ( 3 hrs to solve and 1 hr to understand the solution if you are unable to solve the question. You can get help from online resources, there are no fast and hard rules)
• Saturday + Sunday - 6 + hrs according to time( 10-20 questions).

• If any question is solved already, memorize logic and concepts.

  Participation Rule

1. Question links will be present in this readme as well as in the issue sections.
2. There will be a LOOSER box for each day in this readme, displaying the names of people who participated in 100 Days of Code and completed the given tasks on a particular day.
3. Mark star to repository and fork

Forking a Repository on GitHub:

• Visit the Repository on GitHub:
• Open the GitHub repository you want to fork in your web browser.
• Fork the Repository: Click on the

"Fork" button in the top-right corner of the GitHub page.

This creates a copy of the repository under your GitHub account.

If you wanna see yourself in the contributor list

---

Fork -> Clone -> create branch ->add files ( make changes) and commit ->Push Changes to Fork -> Create a Pull Request -> Wait for merge PR

---

4. Make a folder by your name or day if you are participating with me, and fill the box day by day.

• Commit code and documentation daily.
• All the questions must be attempted in C++ or Python. Other language is also allowed.

POTD of Leetcode and GFG will continue.

-A Weekly Contest and [Striver Sheet](https://takeuforward.org/strivers-a2z-dsa-course/strivers-a2z-dsa-course-sheet-2/) will be added if All assigned Questions have been completed.

---

If you are not able to do just do 1-2 Questions to be consistent, it will make good habit

---

100 Days of Code will start from 16 Dec 2023

---

---

Day -3

Tasks

• Learn Git/GitHub.
• Submit your Name for 100 Days of Code.

LOOSER BOX : Shuchi , Sushant

---

Day -2

Tasks

• Learn Git/GitHub.
• Get familiar with tools and coding platforms.

LOOSER BOX : Shuchi , Sushant

---

Day -1

Tasks

• Learn Git/GitHub.
• Submit your Name for 100 Days of Code.
• Markdown your calendar and time.

LOOSER BOX : Shuchi , Sushant

---

**Day 0

• Demo prerequisite
• Prepare for this WAR✌

10 pattern questions Done Successfully!

Day 1

Tasks

DSA:

GFG SDE DSA SHEET Data Structure(Compulsory)

• For POTD - follow this repository
• POTD
• Subarray with given sum
• Missing number in array
• Leaders in an array

Algorithms(Optional)

• Kth smallest element
• Majority Elementy

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi , Sushant ,charu,Anisha

---

Day 2

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Finding middle element in a linked list
• Reverse a linked list
• Detect Loop in linked list
• equilibrium point
• trapping rainwater

Algorithms(Optional)

• Sort an array of 0s, 1s and 2s
• Chocolate Distribution Problem
• kadanes algorithm

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi,Anisha , Sushant

---

Day 3

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Immediate Smaller Element
• Level order traversal in spiral form
• Queue using two Stacks

Algorithms(Optional)

• Sort a stack
• Recursively remove all adjacent duplicates

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi,Anisha

---

Day 4

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Implement Queue using array
• Valid Substring
• Reverse First K elements of Queue

Algorithms(Optional)

• Activity Selection
• Max length chain

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)
• 23 Dec 2023 - Saturday

LOOSER BOX : Shuchi ,Anisha

---

Day 5

Tasks

DSA:

Data Structure(Compulsory)

• POTD
• Height of Binary Tree
• Left View of Binary Tree
• Print all nodes that don't have sibling
• Determine if Two Trees are Identical

Algorithms(Optional)

• Finding the numbers
• Josephus problem

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)
• 24 Dec Sunday

LOOSER BOX : Shuchi

---

Day 6

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Minimum element in BST
• Inorder Successor in BST
• Array to BST
• Insert a node in a BST

Algorithms(Optional)

• Primes sum
• Largest prime factor

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)
• 25 Dec 2023

LOOSER BOX : Shuchi

---

Day 7

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Key Pair
• Find all pairs with a given sum
• Common elements

Optional

• First non-repeating character in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 8

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Spirally traversing a matrix
• Search in a matrix
• Flood fill Algorithm > Leetcode
• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 9

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Equilibrium point
• Maximum Index
• Inversion of array

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 10

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Check if Linked List is Palindrome
• Nth node from end of linked list
• Remove loop in Linked List

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

** LOOSER BOX** : Shuchi

---

Day 11

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Parenthesis Checker
• Next larger element
• Get minimum element from stack

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)
• Saturday - StriverSheet

LOOSER BOX : Shuchi

---

Day 12

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• LRU Cache
• Stack using two queues
• Maximum of all subarrays of size k
• Circular tour

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

• Sunday 31 st Dec 2023
• Striver Sheet

---

Day 13

Tasks

DSA :

Data Structure(Compulsory)

• POTD
• Sum Tree
• Check for BST
• Root to leaf path sum > Leetcode
• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

---

• 01 Jan 2024 🎉🎉🎉

---

LOOSER BOX : Shuchi

---

Day 14

Try and Complete the incomplete questions. If already completed - Solve striver Sheet

DSA :

Data Structure(Compulsory)

• POTD
• Inorder Successor in BST
• Largest prime factor
• First non-repeating character in a stream
• LRU Cache
• Maximum of all subarrays of size k
• Check for BST

  Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :Shuchi

---

Day 15

Try and Complete the incomplete questions. If already completed - Solve striver Sheet

DSA :

Data Structure(Compulsory)

• POTD
• Inorder Successor in BST
• First non-repeating character in a stream
• LRU Cache
• Maximum of all subarrays of size k

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 16

Try and Complete the incomplete questions. If already completed - Solve striver Sheet

DSA :

Data Structure(Compulsory)

• POTD
• Inorder Successor in BST
• LRU Cache
• Maximum of all subarrays of size k

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 17

DSA :

Data Structure(Compulsory)

• POTD
• Sorting Elements of an Array by Frequency
• Relative Sorting
• Top View of Binary Tree

  Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 18

DSA :

Data Structure(Compulsory)

• POTD
• Shortest Source to Destination Path
• Path in Matrix
• Boolean Matrix Problem

  Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 19

DSA :

Data Structure(Compulsory)

• POTD
• Kadane's Algorithm
• Minimum Platforms
• Maximum Index

  Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 20

DSA :

Data Structure(Compulsory)

• POTD
• Delete without head pointer
• Reverse a Linked List in groups of given size
• Intersection Point in Y Shaped Linked Lists

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 21

DSA :

Data Structure(Compulsory)

• POTD
• Infix to Postfix
• The Celebrity Problem
• Maximum Rectangular Area in a Histogram

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 22

DSA :

Data Structure(Compulsory)

• POTD
• Count the Reversals
• Minimum Cost of ropes
• Rotten Oranges

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 23

DSA :

Data Structure(Compulsory)

• POTD
• Count subsequences of type a^i, b^j, c^k
• Clone a Binary Tree
• Trie | (Insert and Search)

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 24

DSA :

Data Structure(Compulsory)

• POTD
• Delete a node from BST
• Count BST nodes that lie in a given range
• Largest BST

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 25

Try and Complete the incomplete questions.

• POTD
• Path in Matrix
• Boolean Matrix Problem
• Minimum Cost of ropes
• Rotten Oranges
• Count subsequences of type a^i, b^j, c^k
• Count BST nodes that lie in a given range
• Largest BST

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 26

Try and Revise these questions.

• POTD
• Path in Matrix
• Minimum Cost of ropes
• Rotten Oranges
• Count subsequences of type a^i, b^j, c^k

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 27

Try and Complete these questions.

• POTD
• Minimum Cost of ropes
• Count subsequences of type a^i, b^j, c^k
• Learn MinHeap and MaxHeap.
• Learn Graph Traversal Methods.

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 28

DSA :

• POTD
• Binary Heap Operations
• Heap Sort
• Rearrange characters
• Learn Graph Traversal Methods. > Leetcode
• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 29

DSA :

• POTD
• Longest consecutive subsequence
• Array Pair Sum Divisibility Problem
• Find all four sum numbers
• Learn Graph Traversal Methods.

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 30

DSA:

• POTD
• Rat in a Maze Problem
• Find whether path exist
• Row with max 1s
• Learn Graph Traversal Methods.

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• [] Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Hello Guys,

Those of you who have completed 30 days of code successfully, Congratulations are in order 👏 🎉 🍻 🚩

Take some time and reflect on your Achievement.

How much have you learned in this month of coding, Compare yourself to 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 💪 .

---

Day 31

DSA :

• POTD
• Find Missing And Repeating
• Stock buy and sell
• Trapping Rain Water
• Learn Graph Traversal Methods.

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• [] Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 32

DSA :

• POTD
• Clone a linked list with next and random pointer
• Flattening a Linked List
• Delete nodes having greater value on right

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• [ ] Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 33

DSA :

• POTD
• Special Stack
• Get min at pop
• Reverse a string using Stack

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 34

DSA :

• POTD
• Card Rotation
• Make Binary Tree From Linked List
• Check Mirror in N-ary tree
• Dequeue Implementations
• Deque Implementations

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 35

DSA :

• POTD
• Diameter of Binary Tree
• Lowest Common Ancestor in a BST
• Boundary Traversal of binary tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 36

Try and Complete the incomplete questions. If complete revise

• Trapping Rain Water
• Find whether path exist
• Clone a linked list with next and random pointer
• Delete nodes having greater value on right
• Card Rotation
• Make Binary Tree From Linked List
• Check Mirror in N-ary tree
• Print Binary Tree levels in sorted order
• Diameter of Binary Tree
• Boundary Traversal of binary tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 37

Try and Complete the incomplete questions.

if complete revise or solve HackerEarth more questions.

• POTD
• Trapping Rain Water
• Find whether path exist
• Delete nodes having greater value on right
• Card Rotation
• Make Binary Tree From Linked List
• Check Mirror in N-ary tree
• Print Binary Tree levels in sorted order
• Diameter of Binary Tree
• Boundary Traversal of binary tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• [] Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 38

Try and Complete the incomplete questions.if complete revise or solve HackerEarth more questions

• POTD
• Trapping Rain Water
• Find whether path exist
• Delete nodes having greater value on right
• Card Rotation
• Check Mirror in N-ary tree
• Boundary Traversal of binary tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 39

Try and Complete the incomplete questions. if complete revise or solve HackerEarth more questions

• Trapping Rain Water
• Find whether path exist
• Card Rotation
• Check Mirror in N-ary tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

Day 40

Try and Complete the incomplete questions. if complete revise or solve HackerEarth more questions

• Trapping Rain Water
• Find whether path exist
• Check Mirror in N-ary tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 41

Try and Complete the incomplete questions. if complete revise or solve HackerEarth more questions

• POTD
• Find whether path exist
• Card Rotation

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 42

DSA :

• POTD
• Largest Number formed from an Array
• Finding Number
• Smallest Positive missing number

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 43

DSA :

• POTD
• Rotate a Linked List
• Delete keys in a Linked list
• Reorder List

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 44

DSA :

• POTD
• Print Bracket Number
• Smallest number on left
• Max rectangle

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 45

DSA :

• POTD
• Mirror Tree
• Chinky and diamonds
• Next Right Node

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 46

DSA :

• POTD
• Kth largest element in a stream
• Huffman Encoding
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 47

DSA :

• POTD
• Zero Sum Subarrays
• Smallest distinct window
• Smallest window in a string containing all the characters of another string

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 48

DSA :

• POTD
• Nearly Sorted Algorithm
• Matrix Interchange
• Max distance between same elements
• Rotate a 2D array without using extra space

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 49

DSA :

• POTD
• Merge K sorted linked lists
• QuickSort on Doubly Linked List
• Count Pairs whose sum is equal to X

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 50

DSA :

• POTD
• Delete middle element of a stack
• Stock span problem
• Evaluation of Postfix Expression

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 51

DSA :

• POTD
• Addition of submatrix
• Pairs which are Divisible by 4
• Find Transition Point

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 52

Try and Complete the incomplete questions.

DSA :

• POTD
• QuickSort on Doubly Linked List
• Count Pairs whose sum is equal to X
• Stock span problem
• Evaluation of Postfix Expression
• Addition of submatrix
• Find Transition Point
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Huffman Encoding
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX : Shuchi

---

Day 53

Try and Complete the incomplete questions.if complete revise or solve HackerEarth more questions

• QuickSort on Doubly Linked List
• Count Pairs whose sum is equal to X
• Stock span problem
• Evaluation of Postfix Expression
• Addition of submatrix
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Huffman Encoding
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 54

Try and Complete the incomplete questions. if complete revise or solve HackerEarth more questions

DSA :

• QuickSort on Doubly Linked List
• Stock span problem
• Evaluation of Postfix Expression
• Addition of submatrix
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Huffman Encoding
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 55

Try and Complete the incomplete questions. if complete revise or solve HackerEarth more questions

DSA :

• QuickSort on Doubly Linked List
• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Huffman Encoding
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 56

Try and Complete the incomplete questions. If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Huffman Encoding
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 57

Try and Complete the incomplete questions.If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• POTD
• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Adding Ones
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• [] Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 58

Try and Complete the incomplete questions. If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Identical Linked Lists
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 59

Try and Complete the incomplete questions. If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Queue Push & Pop
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 60

Try and Complete the incomplete questions. If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Nuts and Bolts Problem
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 61

Try and Complete the incomplete questions.If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Transpose of Matrix
• Maximum no of 1's row
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 62

Try and Complete the incomplete questions.

DSA :

• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Count Smaller elements
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 63

Try and Complete the incomplete questions. If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• POTD
• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string
• Find median in a stream

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 64

Try and Complete the incomplete questions. If complete revise or solve HackerEarth more questions and add in Readme.

DSA :

• POTD
• Stock span problem
• Smallest distinct window
• Smallest window in a string containing all the characters of another string

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 65

DSA :

• POTD
• Stock span problem
• In First But Second
• Subarrays with equal 1s and 0s

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 66

DSA :

• POTD
• Stock span problem
• Merge k Sorted Arrays
• Subarrays with equal 1s and 0s

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 67

DSA :

• POTD
• Stock span problem
• Largest subarray of 0's and 1's
• Subarrays with equal 1s and 0s

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 68

DSA :

• POTD
• Stock span problem
• Ugly Numbers
• Rearrange Array Alternately

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 69

DSA :

• POTD
• Stock span problem
• Binary Tree to DLL
• Leaves to DLL

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 70

DSA :

• POTD
• Preorder to Postorder
• Leaves to DLL
• Connect Nodes at Same Level

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 71

DSA :

• POTD
• Convert Level Order Traversal to BST
• Construct Tree from Preorder Traversal

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 72

DSA :

• POTD
• Smallest range in K lists
• Longest consecutive subsequence
• Longest Sub-Array with Sum K

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 73

DSA :

• POTD
• Rearrange an array with O(1) extra space
• Smallest Positive missing number
• Maximum Sub Array

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 74

DSA :

• POTD
• Given a linked list, reverse alternate nodes and append at the end
• Binary Tree to CDLL

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 75

DSA :

• POTD
• Print leaf nodes from preorder traversal of BST
• Save Gotham!
• Foldable Binary Tree

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 76

DSA :

• POTD
• Convert an array to reduced form
• Design a tiny URL or URL shortener

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 77

DSA :

• POTD
• Construct expression tree
• Number of root to leaf paths
• Find the Closest Element in BST

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 78

DSA :

• POTD
• Add all greater values to every node in a BST
• Merge two BST 's
• k-th smallest element in BST

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 79

DSA :

• POTD
• Find a pair with given target in BST
• Pairs violating BST property

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 80

DSA :

• POTD
• Preorder Traversal and BST
• Count Number of SubTrees having given Sum
• Quick Sort on Linked List
• Merge Sort on Doubly Linked List

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 81

DSA :

• POTD
• Add two numbers represented by Linked List
• Swap Kth nodes from ends

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• [] Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 82

DSA :

• POTD
• Extreme nodes in alternate order
• Leftmost and rightmost nodes of binary tree
• Check if subtree

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 83

DSA :

• POTD
• Bottom View of Binary Tree
• Serialize and Deserialize a Binary Tree
• Min distance between two given nodes of a Binary Tree
• Lowest Common Ancestor in a Binary Tree

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 84

DSA :

• POTD
• Mirror of a given node
• Height of Binary Tree

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 85

DSA :

• POTD
• Construct Binary Tree from Parent Array
• Sum of bit differences
• Minimum Swaps to Sort

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 86

DSA :

• POTD
• Sorting Elements of an Array by Frequency
• Count of Subarrays
• Overlapping Intervals

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 87

DSA :

• POTD
• Subarrays with equal 1s and 0s
• Maximize the sum of selected numbers from an array to make it empty
• Equal Sum

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 88

DSA :

• POTD
• Minimum swaps and K together
• Maximum bitonic subarray sum
• Possible groups

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 89

DSA :

• POTD
• Smallest Absolute Difference
• The Tiny Miny
• Maximize The Array

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 90

DSA :

• POTD
• Longest subarray with sum divisible by K
• Maximum length Bitonic Subarray
• Largest Sum Subarray of Size at least K

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 91

DSA :

• POTD
• Number to words
• Sum of XOR of all pairs
• Minimum sum

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 92

DSA :

• POTD
• Sum of permutations
• Overlapping Intervals
• Large Factorials

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 93

DSA :

• POTD
• Minimums in Array
• Counts Zeros Xor Pairs
• Count the Zeros

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 94

DSA :

• POTD
• Remove duplicate element from sorted Linked List
• Add two numbers represented by linked lists
• Delete a Node in Single Linked List
• Merge two sorted linked lists
• Pairwise swap elements of a linked list
• Find length of Loop
• Intersection of two sorted Linked lists

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 95

DSA :

• POTD
• Union of Two Linked Lists
• Rearrange an array such that arr[i] = i
• Frequencies of Limited Range Array Elements
• Swapping pairs make sum equal
• Largest subarray with 0 sum
• Check if array contains contiguous integers with duplicates allowed
• Non-Repeating Element

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 96

DSA :

• POTD
• Sum of leaf nodes in BST
• Level order traversal
• Check for Balanced Tree
• Level order traversal Line by Line
• Count distinct elements in every window
• Find duplicates in an array
• Reverse Level Order Traversal

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 97

DSA :

• POTD
• Stock span problem
• Sum of Leaf Nodes
• Sum of Right Leaf Nodes
• Max Level Sum in Binary Tree
• Minimum Depth of a Binary Tree

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 98

DSA :

• POTD
• Populate Inorder Successor for all nodes
• Print Nodes having K leaves
• Maximum difference between node and its ancestor

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 99

DSA :

• POTD
• Number of Turns in Binary Tree
• Fixing Two nodes of a BST
• Maximum of minimum for every window size

Leetcode

• POTD
• 5 question - Leetcode Top Interview 150

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

LOOSER BOX :

---

Day 100

DSA :

• POTD
• Need Some Change
• Count Pairs in an Array
• First negative integer in every window of size k
• Remove all duplicates from a given string
• Distinct absolute array elements

Leetcode

• POTD
• 1 question - Leetcode 75

  HackerEarth

• Basic programming-2 Questions

Interviewbit

• Prepare on Saturday and Sunday - level-wise ( 10 questions/week)

Finished 100 Days of Code Successfully 🔥.