Resources for Programming Interviews
Introduction
General Refs
LeetCode
0. Basic Data Structures
0.0 Primitive types
0.1 List
0.2 String
0.3 Heap
0.4 Queue
0.5 Stack
0.6 Dict
0.9 Time and Space complexity
2. Trees
2.1 Tree Construction
2.2 Tree Traverse
2.3 Tree Manipulation
2.4 BSTs
2.5 Tries(Prefix Trees)
2.7 Argmented Trees
2.7.1 Interval Tree
3. Graph
3.1 Graph Representation
3.2 Graph Traversal
3.3 Topological Sort
3.4 Dijkstra Algorithm(shortest path)
4. Search
4.1 Binary Search
4.2 Depth First Search(DFS)
4.3 Breadth First Search(BFS)
5. Subset, Combination, Permutation and More
5.1 Backtracking
6. Regular Expression
7. Bit Manipulation
8. Divide and Conquer
9. Dynamic Programming
10.Greedy
49. Sort
50. Maze
51. Palindromes
52. Game
53.Parse
89.Memory Management
90. Python
90.0 Python for C\/C++ programmers
90.1 Code Style
90.2 Data Types
90.3 Operators
90.4 I\/O
90.5 Format
90.6 Iterator, Generator, and Yield
90.7 Decorators
90.8 OOP in Python
91.CPP
91.1 Questions
91.2 Templates, Exceptions, and Files
92. Probability and Statistics
93.System Design
93.1 Operating System
99. Classic Problems
99.1 Different Ways to Add Parentheses(LC 241)
99.2 Bitwise AND of Numbers Range
99.3 Course Schedule
99.4 Reorder List
99.5 Surrounded Regions
99.6 Word Ladder I&II
100. gitbook
TODO
To Read
101. Resume
102. Machine Learning
102.1 NLP
Powered by
GitBook
3.3 Topological Sort
3.3 Topological Sort
Refs:
U of Washington CSE326 lecture 20:
Topo-Sort and Dijkstra’s Greedy Idea
topics covered: topo sort(quadratic and linear solutions), BFS, Dijkstra's method
Stanford Data Structure and Algorithm:
topo sort
(recommended by
LC
)
Problems:
LC 207 - Course Schedule
results matching "
"
No results matching "
"