https://github.com/aniketfuryrocks/cs-self-taught-guide
guide to becoming a self-taught software engineer (in progress)
https://github.com/aniketfuryrocks/cs-self-taught-guide
algorithms asymptotic-analysis enginneering graph traversal trees
Last synced: about 2 months ago
JSON representation
guide to becoming a self-taught software engineer (in progress)
- Host: GitHub
- URL: https://github.com/aniketfuryrocks/cs-self-taught-guide
- Owner: aniketfuryrocks
- License: mit
- Created: 2020-11-25T12:16:18.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2020-12-05T12:08:10.000Z (over 4 years ago)
- Last Synced: 2025-04-01T14:17:48.813Z (about 2 months ago)
- Topics: algorithms, asymptotic-analysis, enginneering, graph, traversal, trees
- Homepage:
- Size: 8.79 KB
- Stars: 1
- Watchers: 0
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# cs-self-taught-guide
This Github repo is a guide to becoming a self-taught software engineer. I have listed all the essential topics that one needs to know, with their respected resources. All resources are free in the public domain. Feel free to submit a pull request and help the community further.
This repo is still in early development, more topics will be added with time.
### Data Structures And Algorithms
The best place you can refer to is no other than [GeeksForGeeks](https://www.geeksforgeeks.org).
**Analysis of Algorithms(Asymptotic Analysis)**
You need to know how to analyze time and space complexity. It is not required to get into its math just yet. But you should have a jist of it, especially
Big O Notation. One should deeply understand this concept before approaching for an interview. You can read further on this topic [here](https://www.geeksforgeeks.org/analysis-of-algorithms-set-1-asymptotic-analysis/). I advise you to first do basic dsa and then read about Asymptotic Analysis.
**Data Structures**
+ Array
+ Stack
+ Queue
+ Linked List
+ HashMap (Dictionaries in python, Map or Objects in JS)
+ HashSet
+ [Tree](https://towardsdatascience.com/8-useful-tree-data-structures-worth-knowing-8532c7231e8c)
+ + [Binary Tree](https://www.geeksforgeeks.org/binary-tree-set-1-introduction/?ref=lbp)
+ + [Binary Search Tree](https://www.geeksforgeeks.org/binary-search-tree-data-structure/)
+ + [Heap](https://www.geeksforgeeks.org/heap-data-structure/)
+ Advance Tree
+ + [AVL tree](https://www.geeksforgeeks.org/avl-tree-set-1-insertion/)
+ + [Red-Black Tree](https://www.geeksforgeeks.org/red-black-tree-set-1-introduction-2/)
+ + [Splay Tree](https://www.geeksforgeeks.org/splay-tree-set-1-insert/)
+ + [Trep](https://www.geeksforgeeks.org/treap-a-randomized-binary-search-tree/)
+ + [B-tree](https://www.geeksforgeeks.org/introduction-of-b-tree-2/)
+ [Graph Theory](https://www.geeksforgeeks.org/mathematics-graph-theory-basics-set-1/?ref=lbp)
+ + [Video Source](https://www.youtube.com/watch?v=cWNEl4HE2OE)
For both Tree and Graph, you need to know their traversal techniques.
[In-Order, Pre-Order, Post-Order for trees](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/)
[Breadth and Depth First Traversal, for Tree and Graph](https://www.youtube.com/watch?v=cWNEl4HE2OE)
**Algorithms**