YOTTA 線上課程 面試軟體工程師 ，你不能不會的演算法｜用對思維，速解 50 則精選考題(含教材)胡秩瑋 (Brian) (Technical Solution Consultant) 影音教學 中文發音 繁體中文字幕版(DVD版)
課程類型:求職面試
致親愛的工程師們： 想給自己一次機會，到不同的環境下趕deadline嗎?XD 這堂課就是為了幫助所有在學習演算法的途中找尋捷徑的你而準備的：『面試軟體工程師，你不能不會的演算法』線上工具書!
ㄧ、Big O
1 What is Big O
2 進階 Big O
3 進階 Big O (2)
二、Math
4 Plus one
5 Pow
6 Reserve Integer
7 Palindrome Number
三、Array/String
8 Two Sum
9 Two Sum 2
10 Valid Palindrome
11 STRSTR()
12 ATOI
13 Valid Number
14 Longest Substring Without Repeating Characters
15 Longest Substring with At Most Two Distinct Characters
16 Reverse words in a string
17 Reverse words in a string 2
18 Missing Ranges
19 One Edit Distance
20 Read N Characters Given Read4
21 Read N Characters Given Read4 – Call multiple times
四、Linked List
22 Linked List 簡介
23 Merge Two Sorted Lists
24 Add Two Numbers
25 Swap Nodes in Pairs
26 Merge K Sorted Linked Lists
27 Copy List with Random Pointer
五、Binary Tree
28 Binary Tree 簡介
29 Validate Binary Search Tree
30 Maximum Depth of Binary Tree
31 Minimum Depth of Binary Tree
32 Balanced Binary Tree
33 Convert Sorted Array to Balanced Binary Search Tree
34 Convert Sorted List to Balanced Binary Search Tree
35 Binary Tree Maximum Path Sum
六、Binary Search
36 Search Insert Position
37 Find Minimum in sorted rotated array
38 Find Minimum in sorted rotated array 2
七、Bit Manipulation
39 Bit Manipulation 簡介
40 Single Number
41 Single Number 2
42 Power of Two
43 Missing Number
八、MISC
44 Spirial Matrix
45 Integer to Roman
46 Roman to Integer
47 Clone Graph
九、Stack
48 Min Stack
49 Evaluate Reverse Polish Notation
50 Valid Parentheses
十、Dynamic Programming
51 Climbling Stairs
52 Unique Paths
53 Unique Paths 2
54 Maximum Sum Subarray
55 Maximum Product Subarray
56 Coins in a Line
|
|
專業知識教學
