+91 9404 340 614    gyaanibuddy@gmail.com

Like
0 Likes

๐ƒ๐š๐ญ๐š ๐’๐ญ๐ซ๐ฎ๐œ๐ญ๐ฎ๐ซ๐ž ๐‘๐จ๐š๐๐Œ๐š๐ฉ ๐…๐ข๐ซ๐ฌ๐ญ ๐Ÿ‘๐ŸŽ ๐ƒ๐š๐ฒ๐ฌ

Last updated on July 20, 2022, 11:52 a.m. by mohit

Image desc
In this article, we will discuss how to get start with Array ,LinkedList, Stack and Queues, Recursion.

๐ƒ๐š๐ญ๐š ๐’๐ญ๐ซ๐ฎ๐œ๐ญ๐ฎ๐ซ๐ž ๐‘๐จ๐š๐๐Œ๐š๐ฉ ๐…๐ข๐ซ๐ฌ๐ญ ๐Ÿ‘๐ŸŽ ๐ƒ๐š๐ฒ๐ฌ

๐ŸŽฏ ๐€๐ซ๐ซ๐š๐ฒ๐ฌ
๐Ÿ“Œ Day 1
๐Ÿ“”Understand Big O notation (Time and Space complexity)
๐Ÿ“Œ Day 2
๐Ÿ“”Study Basic Concepts of Array and get familiar with List DS in the programming language you chose.
๐Ÿ“” Reverse the array in place (space complexity should be constant)
Input —>> 3,5,9,4,2
Output —>> 2,4,9,5,3
๐Ÿ“” Insert an element in between of array
๐Ÿ“Œ Day 3 and Day4
๐Ÿ“” Understand Quick Sort, Merge Sort, Insertion Sort and Selection Sort
๐Ÿ“” Implement them all in your fav programming language
๐Ÿ“Œ Day 5
๐Ÿ“” Understand Binary Search Algorithm
๐Ÿ“” Search an element in Sorted Array
๐Ÿ“” Leetcode Question 33
๐Ÿ“” Leetcode Question 50
๐Ÿ“Œ Day 6
๐Ÿ“”Understand 2D matrix/ @D Arrays
๐Ÿ“”Search a 2D Matrix Leetcode question 74
๐Ÿ“” Set Matrix to Zero —> Leetcode 73
๐Ÿ“” Pascals Triangle —> Leetcode 118
๐Ÿ“” Rotate Matrix —> leetcode 48
๐Ÿ“Œ Day 7
๐Ÿ“” Kadane’s Algo —> Maximum Subbarray Leetcode 73
๐Ÿ“” Sort Array of 0’s 1’s and 2’s Leetcode 75
๐Ÿ“” Two Sum Problem —> Leetcode 1
๐Ÿ“” Find Duplicate
๐Ÿ“Œ Day 8 —> Level Up
๐Ÿ“”Stock Buy and Sell —> Leetcode 121
๐Ÿ“” Next Permutation —> Leetcode 32
๐Ÿ“” Merge Intervals — > Leetcode
๐Ÿ“”Merge Sorted Arrays
๐Ÿ“Œ Day 9 —> Level up
๐Ÿ“”Reverse pairs
๐Ÿ“” Grid Unique Paths
๐Ÿ“” 3 Sum problem
๐Ÿ“” 4 Sum Problem
๐Ÿ“Œ Day 10
๐Ÿ“”Repeat Missing Number Array
๐Ÿ“” Reverse Pairs
๐Ÿ“” Longest Consecutive Subsequence
๐Ÿ“” Subarray with given Xor
๐Ÿ“” Longest Substring without repeat
๐‹๐ข๐ง๐ค๐ž๐๐‹๐ข๐ฌ๐ญ
๐Ÿ“Œ Day 11
๐Ÿ“”Understand the concept of Linked List
๐Ÿ“”Understand its Advantages and disadvantages over Arrays
๐Ÿ“”Implement Linked list in the language you chose:
๐Ÿ“”Create Linked List class
๐Ÿ“”Create a Node
๐Ÿ“”Add Node
๐Ÿ“”Remove Node
๐Ÿ“”Find Node in Linked List
๐Ÿ“Œ Day 12
๐Ÿ“”Reverse Linked List
๐Ÿ“”Find Middle of the Linked List
๐Ÿ“”Remove Nth Node From End of List
๐Ÿ“”Merge Two Sorted Lists
๐Ÿ“Œ Day 13
๐Ÿ“”Add Two Numbers given in linked list
๐Ÿ“”Detect and remove Linked List Cycle
๐Ÿ“”Intersection of Two Linked Lists
๐Ÿ“”Palindrome Linked List
๐Ÿ“Œ Day 14
๐Ÿ“”Reverse Nodes in k-Group
๐Ÿ“”Rotate List
๐Ÿ“”Flattening a Linked List
๐Ÿ“”Copy List with Random Pointer
๐’๐“๐€๐‚๐Š
๐Ÿ“Œ Day 15
๐Ÿ“”Understand the basics of Stack Data Structures
๐Ÿ“”Relate with some real life examples like
๐Ÿ“”Stack of Note books and Stack of coins
๐Ÿ“”Implement the Stack using Arrays (Push Pop etc functionalities )
๐Ÿ“”Implement the Stack with Linked List

๐Ÿ“Œ Day 16
๐Ÿ“”Sort a Stack
๐Ÿ“”Valid Paranthesis: Leetcode 20
๐Ÿ“”Retrieve Minimum Element from the Stack Leetcode 155
๐Ÿ“Œ Day 17 (Level Up)
๐Ÿ“”Next Greater Element using Stack Leetcode 496
๐Ÿ“”Find largest rectangle in Histogram Leetcode 84
๐๐”๐„๐”๐„
๐Ÿ“Œ ๐ƒ๐š๐ฒ 18
๐Ÿ“” Understand the basics of Queue Data Structures
๐Ÿ“” Relate with some real life examples
๐Ÿ“” Implement the Queue using Arrays
๐Ÿ“” Implement the Queue using Linked List

๐Ÿ“Œ ๐ƒ๐š๐ฒ 19
๐Ÿ“” Implement Queue using Stack
๐Ÿ“” Implement Stack using Queue
๐Ÿ“” Implement and understand Double Ended Queue
๐Ÿ“Œ ๐ƒ๐š๐ฒ 20
๐Ÿ“” Understand and Implement Circular Queue
๐Ÿ“” Fine examples where circular Queues can be used.
๐Ÿ“” Implement Producer Consumer Problem
๐Ÿ“Œ ๐ƒ๐š๐ฒ 21
๐Ÿ“” Queue Reversal
๐Ÿ“” Implement LRU Cache
๐Ÿ“” Implement LFU Cache
๐Ÿ“Œ ๐ƒ๐š๐ฒ 22
๐Ÿ“” Learn Sliding window Coding Pattern
๐Ÿ“” Sliding Window Maximum Leetcode 239
๐Ÿ“” First negative integer in every window of size
๐Ÿ“Œ ๐ƒ๐š๐ฒ 23
๐Ÿ“” Trapping Rain Water (Stack based) Leetcode 42
๐Ÿ“” Simplify Directory Path (Stack Based) Leetcode 71
(No Priority Queue for now)

๐‘๐ž๐œ๐ฎ๐ซ๐ฌ๐ข๐จ๐ง
๐Ÿ“Œ ๐ƒ๐š๐ฒ 24
๐Ÿ“”Understand Recursion and its base conditions etc.
๐Ÿ“”Understand in depth not only what recursion is but also what kind of Data str it uses internally etc.
You will get to know how stackoverflow error occurs
๐Ÿ“Œ ๐ƒ๐š๐ฒ 25
๐Ÿ“”Fibonacci Number
๐Ÿ“”Reverse the Linked List using Recursive approach
๐Ÿ“”Reverse linkedList in k-groups
๐Ÿ“Œ ๐ƒ๐š๐ฒ 26
๐Ÿ“”Subset Sums
๐Ÿ“”Subsets II
๐Ÿ“Œ ๐ƒ๐š๐ฒ 27 (Level up questions)
๐Ÿ“”Combination Sum
๐Ÿ“”Combination Sum II
๐Ÿ“”Palindrome Partitioning
vPermutation Sequence
Revision
๐Ÿ“ŒDay 28-30
Revise Arrays, Linked List, Queues, Stacks and Recursion

...

by mohit
Shri Ramdeobaba College of Engineering and Management Nagpur

I am a final year computer science student at RCOEM, Nagpur. I am MERN stack developer. I enjoy building community and doing something meaningful for the community. Also part of GDG cloud, Nagpur.
blog comments powered by Disqus