2019 年算法教学相关写作任务
其他
2019-05-06 11:31:42
阅读次数: 0
大纲
- Introduction and Settings
- Introduction
- Interview triks
- What you need to know before start
- Complete Free Java course
- Install Java JDK
- Install Eclipse
- Exercise files
- 代码的复杂度 Code Complexity
- Big-O, Omega and Theta
- Big-O Examples
- Code complexicity
- Data Structure
- Why Data Structure?
- One-Dimension Array & Implementation in Java
- Two-Dimension Array & Implementation in Java
- Dynamic Array & Implementation in Java
- Linked List & Implementation in Java
- Doubly Linked List Implementation in Java
- Compare Linked List vs Array
- Combine two Linked List (Google Interview Question)
- Hash-Table & Implementation in Java
- Find unique number in Array (Amazon Phone Screen Interview )
- Key Phrase problem: TF-IDF
- Stack
- Stack Implementation in Java Use Array
- Stack Implementation in Java Use Dynamic Array
- Stack Implementation in Java Use Linked List
- Queue
- Queue Implementation in Java Use Array
- Queue Implementation in Java Use Dynamic Array
- Queue Implementation in Java Use Linked List
- Priority queue
- Best data structure for Array With Many Zeros (Google Interview Question)
- Collections in Java
- Data Structure functions in Java
- ArrayList
- LinkedList
- HashMap
- TreeSet HashSet
- Stack
- Queue and Priority Queue
- Sort array of Objects
- Recursion
- Searching Algorithms
- Linear Search & Implementation in Java
- Binary Search & Implementation in Java
- Interpolation Search & Implementation in Java
- Sorting Algorithms
- Bubble sort & Implementation in Java
- Selection Sort & Implementation in Java
- Quick Sort & Implementation in Java
- Merge Sort & Implementation in Java
- Heap Sort & Implementation in Java
- Tree Theory
- Binary Tree and Binary Search Tree
- Binary Search Tree Implementation in Java
- Problem of the Day
- Red-Black Tree
- Google Interview: Determines if two BST are equal
- HW||Find SubTrees (Google Interview Question)
- Graph Theory
- Matrix and Adjacency List
- Depth First Search(DFS)
- DFS Implementation in Java
- Breadth First Search (BFS)
- BFS Implementation in Java
- Backtracking
- Preorder and PostOrder
- Visit Cities in best Weather (Google Interview Question)
- Nearest post office HW explain (Microsoft Interview Question)
- Nearest post office
- Short Path in Graph Theory
- Nearest Neighbor and Shortest path
- Dijkstra’s Algorithm
- A* Algorithm
- Dynamic Programming
- Dynamic Programming concept
- Edit distance
- Find Word in list of characters
- Knapsack problems
- Knapsack solution in Java
- NP Complete problems
转载自blog.csdn.net/weixin_43145361/article/details/89813820