Tasks

• Add your folders to 100 days of code.
• Add your Name to the main README file.

Day 10

Tasks

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

Day 19

DSA :

Data Structure(Compulsory)

• Kadane's Algorithm
• Minimum Platforms
• Maximum Index

GSOC

• Work on some issues and try to fix them.

Day 26

Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.

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

Day 32

DSA :

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

GSOC

• Work on some issues and try to fix them.

Day 10

Tasks

DSA :

Data Structure(Compulsory)

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

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.

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

GSOC

• Work on some issues and try to fix them.

Day 6

Tasks

DSA :

Data Structure(Compulsory)

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

Algorithms(Optional)

• Primes sum
• Largest prime factor

GSOC

• Work on some issues and try to fix them.

Day 46

DSA :

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

GSOC

• Start making Proposal for GSOC.

Day 29

DSA :

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

GSOC

• Work on some issues and try to fix them.

Day 29

DSA :

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

GSOC

• Work on some issues and try to fix them.

Day 45

DSA :

• Mirror Tree
• Chinky and diamonds
• Next Right Node

GSOC

• Start making Proposal for GSOC.

Day 3

Tasks

DSA :

Data Structure(Compulsory)

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

Algorithms(Optional)

• Sort a stack
• Recursively remove all adjacent duplicates

GSOC

• Work on some issues and try to fix them.

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
• Largest prime factor
• First non-repeating character in a stream
• LRU Cache
• Maximum of all subarrays of size k
• Root to leaf path sum

GSOC

• Work on some issues and try to fix them.

Day 42

DSA :

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

GSOC

• Start making Proposal for GSOC.

Day 22

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

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
• Card Rotation

GSOC

• Work on some issues and try to fix them.

Day 15(Same as 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
• Largest prime factor
• First non-repeating character in a stream
• LRU Cache
• Maximum of all subarrays of size k
• Check for BST

GSOC

• Work on some issues and try to fix them.

Day 47

DSA :

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

GSOC

• Start making Proposal for GSOC.

Day 7

Tasks

DSA :

Data Structure(Compulsory)

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

Optional

• First non-repeating character in a stream

GSOC

• Work on some issues and try to fix them.

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 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 💪 .

Day 28

DSA :

• Binary Heap Operations
• Heap Sort
• Rearrange characters
• Learn Graph Traversal Methods.

GSOC

• Work on some issues and try to fix them.

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
• 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
• Diameter of Binary Tree
• Boundary Traversal of binary tree

GSOC

• Work on some issues and try to fix them.

Day 9

Tasks

DSA :

Data Structure(Compulsory)

• Equilibrium point
• Maximum Index
• Inversion of array

GSOC

• Work on some issues and try to fix them.

Day 4

Tasks

DSA :

Data Structure(Compulsory)

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

Algorithms(Optional)

• Activity Selection
• Max length chain

GSOC

• Work on some issues and try to fix them.

Day 33

DSA :

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

GSOC

• Work on some issues and try to fix them.

Day 12

Tasks

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

Day 34

DSA :

• Card Rotation
• Make Binary Tree From Linked List
• Check Mirror in N-ary tree
• Print Binary Tree levels in sorted order
• Deque Implementations

GSOC

• Work on some issues and try to fix them.

Day 24

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

IDIOT BOX : Dhruv, Vaibhav, Shashwat, Janmaijai, Deepak

• All the questions that are present in this repository are Interview Questions.
• You should put all the questions that you had a hard time-solving in a README file(You can call it Important questions).
• You should visit those questions again once a week so that you digest their concept properly.
• Also, try to add a comment in the solution of those questions so that when you visit them again you can understand them easily.

Day 21

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

Day 13

Tasks

DSA :

Data Structure(Compulsory)

• Sum Tree
• Check for BST
• Root to leaf path sum

GSOC

• Work on some issues and try to fix them.

Day 2

Tasks

DSA :

Data Structure(Compulsory)

• Finding middle element in a linked list
• Reverse a linked list
• Detect Loop in linked list

Algorithms(Optional)

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

GSOC

• Work on some issues and try to fix them.

Day 18

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

Day 20

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

Day 23

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

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
• 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

GSOC

• Work on some issues and try to fix them.

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
• 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

Day 35

DSA :

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

GSOC

• Work on some issues and try to fix them.

Data Structure(Compulsory)

• Subarray with given sum
• Missing number in array
• Leaders in an array

Algorithms(Optional)

• Kth smallest element
• Majority Elementy

GSOC

• Find an Organisation to contrinute to, you can this data to select an organisation.
• Find some good first issues to solve, you can also cotribute in Documentation of the Organisation.

Day 5

Tasks

DSA :

Data Structure(Compulsory)

• 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

GSOC

• Work on some issues and try to fix them.

Day 16(Same as 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
• Largest prime factor
• First non-repeating character in a stream
• LRU Cache
• Maximum of all subarrays of size k
• Check for BST

GSOC

• Work on some issues and try to fix them.

Day 27

Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.

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

GSOC

• Work on some issues and try to fix them.

Day 39

Try and Complete the incomplete questions. Here is a list of all the questions that were not completed by anyone.

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

GSOC

• Work on some issues and try to fix them.

Day 31

DSA :

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

GSOC

• Work on some issues and try to fix them.

Day 43

DSA :

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

GSOC

• Start making Proposal for GSOC.

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
• Find whether path exist
• Delete nodes having greater value on right
• Card Rotation
• Check Mirror in N-ary tree
• Boundary Traversal of binary tree

GSOC

• Work on some issues and try to fix them.

Day 17

DSA :

Data Structure(Compulsory)

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

GSOC

• Work on some issues and try to fix them.

Day 8

Tasks

DSA :

Data Structure(Compulsory)

• Spirally traversing a matrix
• Search in a matrix
• Flood fill Algorithm

GSOC

• Work on some issues and try to fix them.

Day 44

DSA :

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

GSOC

• Start making Proposal for GSOC.