Hello everyone, thanks for joining this group

Linked lists are very important for your interviews and there are some fixed number of questions which you need to know

Nobody is going to ask you anything else about linked lists, so I would recommend you to go through all of them as linked lists are a very common interview topic.

Here are some top linked list questions. Please practice these and try to solve all of these with a time constraint as you won't get distracted and your attention span will improve.

Please add your friends in this group so that they can use this too :)

Akele mat job lagvana, doston ki bhi lagne do :)

If you're a first year student getting started with C programming, this free course might help you

Please like, subscribe and share with your friends :D

If you want to know how to apply for companies while in college or even after college, you need to watch this.

Please like, share and subscribe 🙏

I have seen a lot of people not able to present their thoughts in an organised way during a system design interview and thus, are not able to express their thought process to the interviewer.

This template will help you with that.

https://leetcode.com/discuss/career/229177/My-System-Design-Template

If you're confused where to start learning DS and Algorithms, this video will clear all your doubts :)

Please like, subscribe and share with your friends :)

Learn Time Complexity:
https://youtu.be/luXiytGnYpY

Topic-wise links:

1. Arrays

-Bare Minimum
a. https://www.geeksforgeeks.org/top-50-array-coding-problems-for-interviews/

-Bonus
a. https://www.interviewbit.com/courses/programming/topics/arrays/
b. https://leetcode.com/tag/array/


2. Strings
-Bare Minimum
a. https://www.interviewbit.com/courses/programming/topics/strings/

-Bonus
a. https://leetcode.com/tag/string/
b. https://www.hackerrank.com/domains/algorithms?filters%5Bstatus%5D%5B%5D=unsolved&filters%5Bsubdomains%5D%5B%5D=strings&badge_type=problem-solving


3. Linked Lists
-Bare Minimum
a. https://www.interviewbit.com/courses/programming/topics/linked-lists/

-Bonus
a. https://leetcode.com/tag/linked-list/
b. https://www.geeksforgeeks.org/top-20-linked-list-interview-question/

4. Stacks and Queues
-Theory:
a. https://www.geeksforgeeks.org/stack-data-structure-introduction-program/
b. https://www.geeksforgeeks.org/queue-set-1introduction-and-array-implementation/

-Bare Minimum
a. https://www.interviewbit.com/courses/programming/topics/stacks-and-queues/

-Bonus
a. https://leetcode.com/tag/stack/
b. https://leetcode.com/tag/queue/
c. https://www.geeksforgeeks.org/queue-data-structure/
d. https://www.geeksforgeeks.org/stack-data-structure0

5. Tree-based data structures:
-Theory:
a. https://www.geeksforgeeks.org/binary-tree-data-structure/
b. https://www.geeksforgeeks.org/binary-search-tree-data-structure/
c. https://www.geeksforgeeks.org/trie-insert-and-search/
d. https://www.geeksforgeeks.org/heap-data-structure/
e. https://www.geeksforgeeks.org/hashing-data-structure/

-Bare minimum:
a. https://www.interviewbit.com/courses/programming/topics/tree-data-structure/
b. https://www.interviewbit.com/courses/programming/topics/heaps-and-maps/
c. https://www.interviewbit.com/courses/programming/topics/hashing/

-Bonus
a. https://leetcode.com/tag/tree/
b. https://leetcode.com/tag/heap/
c. https://leetcode.com/tag/trie/
d. https://leetcode.com/tag/hash-table/


6. Graphs:
-Theory:
a. https://www.geeksforgeeks.org/graph-and-its-representations/

-Standard Algos:
a. BFS - https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/
b. DFS - https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/
c. Dijkstra - https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/
d. Prim's - https://www.geeksforgeeks.org/prims-minimum-spanning-tree-mst-greedy-algo-5/
e. Kruskal - https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/
f. Floyd-Warshall - https://www.geeksforgeeks.org/floyd-warshall-algorithm-dp-16/
g. Union Find - https://www.geeksforgeeks.org/union-find-algorithm-union-rank-find-optimized-path-compression/


-Bare Minimum:
a. https://leetcode.com/tag/graph/ (Easy and Medium)

-Bonus:
a. https://www.interviewbit.com/courses/programming/topics/graph-data-structure-algorithms/


7. Dynamic Programming:
-Video lectures:
a. Lec 1 - https://www.youtube.com/watch?v=OQ5jsbhAv_M&list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78
b. Lec 2 - https://www.youtube.com/watch?v=ENyox7kNKeY&list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78&index=2
c. Lec 3 - https://www.youtube.com/watch?v=ocZMDMZwhCY&list=PLcDimPvbmfT8qAxD6JH_kmXiQwTNcoK78&index=3

-Bare minimum (Standard problems):
a. https://www.geeksforgeeks.org/program-for-nth-fibonacci-number/
b. https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/
c. https://www.geeksforgeeks.org/coin-change-dp-7/
d. https://www.geeksforgeeks.org/compute-ncr-p-set-1-introduction-and-dynamic-programming-solution/
e. https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/
f. https://www.geeksforgeeks.org/longest-common-subsequence-dp-4/
g. https://www.geeksforgeeks.org/longest-common-substring-dp-29/


-Bonus:
a. https://www.interviewbit.com/courses/programming/topics/dynamic-programming/
b. https://leetcode.com/tag/dynamic-programming/

All the links from video description^