Quant365.com
1 Preface
2 Deepdive
3 Python
- 3.1 Decorator
- 3.2 Descriptor
4 Introduction
5 Bit
6 Array
7 String
8 Matrix
9 Linked List
10 Set and Map
11 Skip List
12 Stack and Queue
13 Heap
14 Binary Tree
15 Binary Tree (Continued)
16 Tree Traversal
17 Trie and Suffix Tree
18 Other Trees
19 Binary Search Tree
20 Graph
21 Computational Geometry
22 Approximation Algorithm
23 Math & Probability
24 Augmented Data Structure
25 Dynamic Programming
26 Greedy
27 Select Topics
28 Binary Search
29 Palindrome
30 Combinatorics
31 Sliding Window
32 Concurrency
33 Iterator
34 Google 2015
35 Google 2016 07
36 Google 2016 09
37 Google 2016 10
38 Google 2016 11
39 Google 2016 12
40 Google 2017 01
41 Google 2017 03
42 Google 2017 05
43 Google 2017 12
44 Facebook 2016 Interview Questions Part 1
45 Facebook 2017 Interview Questions Part 1
46 Facebook 2017 Interview Questions Part 2
47 Uber 2016 11
48 Linkedin before 2015
49 Linkedin 2015
50 Linkedin 2016 01-06
- 50.1 Reservoir sampling
- 50.2 Loop mutlidimentional arrays
51 Linkedin 2016 10
52 Linkedin 2016 11
53 Linkedin 2016 12
54 Linkedin 2017 Interview Questions Part 1
55 Linkedin 2017 Interview Questions Part 2
56 Linkedin 2017 Interview Questions Part 3
- 56.1 a==b but ++a != ++b
- 56.2 Sparse Matrix Storage
57 Airbnb 2016 11
58 Snapchat 2016 11
59 Bloomberg 2015
60 Bloomberg 2016
61 Bloomberg 2017
62 HFT 2016 11
- 62.1 Monty Hall Problem
- 62.2 Trader @ Akuna
63 MS Yahoo 2016 11
64 Other Companies
65 Amazon
- 65.1 How to prepare Amazon Behavior Question?
66 Pure Storage
67 Apple
68 Indeed
69 Oscar Health
- 69.1 Morse Codec
70 Company Summary
- 70.1 Linkedin
- 70.2 Facebook
References
Quant365

Programming Notes for Software Engineer

Fuheng Wu(i@quant365.com)

June 1, 2016

Programming Notes for Software Engineer

Chapter 1 Preface