面经

Google

teoplitz matrix -- google面经题，geeksforgeeks有tutorial同OJ

Snapchat

Amicable Pair less than n -- math / hashtable

443 String Compressionctci189 1.6 String Compression --

edit distance to palindrome -- DP

对角线打印矩阵 -- 与L185很像不过比那题简单一点点，可以用102的方法做。

BigInt sub

xml parser

亚麻

从n个数里random抽k个。这个题可以用 Reservoir sampling 做，不过不知道不多开array会不会影响结果。面试官要求constant space

Equilibrium index of an array

Uber

Serilization and Deserialize n-ary Tree

Weighted ramdom sampling

Forward backward slash sperated squares

password generate according to list

csv parser

fully distributed expression

sloving equation

gift wrapping algorithm

message cut to max length then send

Dropbox & limebike

file access / employee