en
Feedback
🪐 Leetcode DS & Algo Resources

🪐 Leetcode DS & Algo Resources

Open in Telegram

Discuss here 😌👉 @leetcoded_discuss What will be shared here ? 😃👇 - Tons of coding resources ❤️ - Interview Experience of people - Trending Coding News - Crack FAANG💪 #compulsory for CS/IT students !! Buy 6 months Linkedin Premium 👉 @dishu_disha

Show more
The country is not specifiedThe category is not specified
1 091
Subscribers
+824 hours
+427 days
+23630 days
Posts Archive
GREEDY_Algorithms.pdf22.25 MB

🎯 𝐃𝐮𝐬 𝐃𝐢𝐧 𝐀𝐫𝐫𝐚𝐲𝐬 𝐈𝐧 (10 𝐃𝐚𝐲𝐬 𝐑𝐨𝐚𝐝𝐦𝐚𝐩 𝐏𝐥𝐚𝐧 𝐟𝐨𝐫 𝐌𝐚𝐬𝐭𝐞𝐫𝐢𝐧𝐠 𝐀𝐫𝐫𝐚𝐲𝐬) 📌 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 —> https://lnkd.in/dcXDGjJb 📔 Leetcode Question 50 —> https://lnkd.in/d8XnAp22 📌 Day 6 📔Understand 2D matrix/ @D Arrays 📔Search a 2D Matrix Leetcode question 74 --> https://lnkd.in/db7cGdez 📔 Set Matrix to Zero —> Leetcode 73 —> https://lnkd.in/dV3gUPEf 📔 Pascals Triangle —> Leetcode 118 —> https://lnkd.in/dCrmGNby 📔 Rotate Matrix —> leetcode 48 —> https://lnkd.in/d7wkU8UV 📌 Day 7  📔 Kadane’s Algo —> Maximum Subbarray Leetcode 73 —> https://lnkd.in/dJ2X9gzw 📔 Sort Array of 0’s 1’s and 2’s Leetcode 75. —> https://lnkd.in/dNWw6Bp8 📔 Two Sum Problem —> Leetcode 1 —> https://lnkd.in/dqsSyqBB 📔 Find Duplicate —> https://lnkd.in/dMdz7KXq 📌 Day 8 —> Level Up 📔Stock Buy and Sell —> Leetcode 121 —> https://lnkd.in/dGv_8HUE 📔 Next Permutation —> Leetcode 32 —> https://lnkd.in/dNfymKti 📔 Merge Intervals — > Leetcode —> https://lnkd.in/dxbbt7wF 📔Merge Sorted Arrays —> https://lnkd.in/dNzpA3eU 📌 Day 9 —> Level up 📔Reverse pairs —> https://lnkd.in/d7erN9PU 📔 Grid Unique Paths —> https://lnkd.in/dUS3mxaS 📔 3 Sum problem --> https://lnkd.in/djjGS4ep 📔 4 Sum Problem —> https://lnkd.in/dtKJ-a5K 📌 Day 10 📔Repeat Missing Number Array —> https://lnkd.in/d4C26Bn8 📔 Reverse Pairs —> https://lnkd.in/d7erN9PU 📔 Longest Consecutive Subsequence —> https://lnkd.in/d-PBiptg 📔 Subarray with given Xor —>https://lnkd.in/dzCVTG_x 📔 Longest Substring without repeat —> https://lnkd.in/dtMzQbaf

LeetCode_Cheatsheet_Topicwise_.pdf1.49 KB

Next topic : TWO POINTERS Resource video : https://youtu.be/2wVjt3yhGwg How to identify problems that involves this technique? Two Pointers Pattern Two Pointers is a pattern where two pointers iterate through the data structure in tandem until one or both of the pointers hit a certain condition. Two Pointers is often useful when searching pairs in a sorted array or linked list; for example, when you have to compare each element of an array to its other elements. How To Identify - It will feature problems where you deal with sorted arrays (or Linked Lists) and need to find a set of elements that fulfill certain constraints - The set of elements in the array is a pair, a triplet, or even a subarray Questions - Squaring a sorted array (easy) - Triplets that sum to zero (medium) - Comparing strings that contain backspaces (medium) ————————————————- Fast and Slow pointers The Fast and Slow pointer approach, also known as the Hare & Tortoise algorithm, is a pointer algorithm that uses two pointers which move through the array (or sequence/linked list) at different speeds. This approach is quite useful when dealing with cyclic linked lists or arrays. By moving at different speeds (say, in a cyclic linked list), the algorithm proves that the two pointers are bound to meet. The fast pointer should catch the slow pointer once both the pointers are in a cyclic loop. How To Identify - The problem will deal with a loop in a linked list or array - When you need to know the position of a certain element or the overall length of the linked list Questions - Linked List Cycle (easy) - Palindrome Linked List (medium) - Cycle in a Circular Array (hard) Next topic : SLIDING WINDOW, will be shared after 2 days.

DAY-2, Problem Solving on HASHING. Read and solve problems from this for today (easy ones) : https://leetcode.com/explore/learn/card/hash-table/ For the implementation of Hashmap in the deeper way, check out this: Java - https://youtu.be/2ijH5vcKIxQ C++ - https://youtu.be/7mUKGHznpfg Tomorrow I will share some important problems to solve from GFG and LEETCODE. Stay consistent and Happy Coding.🤓

Hello guys, this is my Hashing handwritten notes. (PART-1) You will easily understand Hashing after reading this! Will be sharing other parts soon.

75 Leetcode Must-know questions. The below Leetcode questions are so… | by Mini Chang | Medium https://medium.com/@miniChang8/75-leetcode-must-know-questions-953b3749c7e9

Complete DSA.pdf7.24 MB

Also contains best problems!!

Some Tree Notes!.pdf1.01 MB

Bit_Manipulation_notes.pdf1.32 MB