🪐 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 moreThe country is not specifiedThe category is not specified
1 091
Subscribers
+824 hours
+427 days
+23630 days
Posts Archive
Variations of DP:
-Dynamic programming in one dimension
-Dynamic programming over
graphs and matrix
-Dynamic programming with
bit masks
Steps to start over DSA:
1. COMPLEXITY:
How to analyze algorithms?
Introduction to Big-O Notation?
What is time complexity?
What is space complexity ?
Reverse engineering a solution
Complexity Calculation:
- Time Complexity Calculation - Standard Case
Time Complexity Calculation - Iterative Case #l
Time Complexity Calculation - Iterative Case #2
Time Complexity Calculation - Standard Case & Recursive Case
Space Complexity Calculation - Standard Method
Space Complexity Calculation - Recursion Tree Method
Space Complexity Calculation - Back Substitution Method
2. ARRAYS
Why are arrays fastest?
-Understanding resizable arrays
-Problems based on arrays
-Two Pointer Approach
-Moving pointers towards each other
-Sliding Window Approach & Fixed Window Approach
-Resizable Window
3.LINKED LISTS
- Linked Lists And why we use them, implementation part
-Linked List Standard Technique
-Linked List Multi Pointer Technique
- Linked List Implementation Techniques
-Linked List Pointer Manip
Technique
+ STACKS AND QUEUES
4. Search Algorithms:
Binary Search & Linear Search
Search Problems:
-Standard Binary Search Technique
- Modified Binary Search Technique
- Binary Search Over Range Technique
- Binary Search - Rotation Technique
5. TREES AND HEAPS
General Trees & Binary Trees
- Types of Binary Trees
-Binary Tree - PostOrder Problems
-Binary Tree - PreOrder Problems
- Tree Construction Problems
- Heaps & Heap Problems
- BST Construction Problems
6. GRAPHS
Graph Traversal
- Shortest Path Problem
Graph Problems:
~ Problems based on BFS
- Problems based on DFS
0-1 BFS
Problems based on backedge
calculation
Ad-hoc problems based on graph
7. GREEDY AND DP
Greedy Algorithms
- Greedy Algorithms & Applications
Greedy + Data Structure
Dynamic Programming
https://drive.google.com/drive/folders/1o7RB_AYkZB7ivEMnYoetZSFBer9jv8_m
DSA Logic Based Learning Resources 🤯
Follow: @leetcoded
Top 10 Best Github Repositories For Web Developers 🔥
Web Developer Roadmap : https://github.com/kamranahmedse/developer-roadmap
30 Seconds Of Code : https://github.com/30-seconds/30-seconds-of-code
Awesome Cheatsheets : https://github.com/LeCoupa/awesome-cheatsheets
CSS Protips : https://github.com/AllThingsSmitty/css-protips
33 JS Concepts : https://github.com/leonardomso/33-js-concepts
You Dont Know JS : https://github.com/getify/You-Dont-Know-JS/tree/2nd-ed
Front End Checklist : https://github.com/thedaviddias/Front-End-Checklist
Javascript Questions : https://github.com/lydiahallie/javascript-questions
Clean Code Javascript : https://github.com/ryanmcdermott/clean-code-javascript
Free programming books : https://github.com/EbookFoundation/free-programming-books
Follow: https://t.me/leetcoded 💯
SDE SHEET, HELPFUL FOR INTERVIEWS!
https://takeuforward.org/interviews/must-do-questions-for-dbms-cn-os-interviews-sde-core-sheet/
follow: https://t.me/leetcoded
