本文為匿名代po 請勿回信 以前受到不少幫助, 不過就職已經過了一段不短時間, 儘量就記憶所及 提供一些資訊. 有錯請見諒. 1. 技術性 - Two sum in one pass[1]. - How do you design a scalable short url architecture? - Finding duplicate elements in an array. - Please explain Concurrent Mark Sweep (CMS) Collector. - Binary search. - In Linux, what tool do you use to check memory for a process? - What's different between graph and tree? - How do you imlpement (Java version) HashMap/ HashSet? - Reverse Polish notation. - Permutation of a string. - Find out if a string is palindrome. - What is deadlock? - In two threads execution, how can you avoid lock or synchronization without race condition? - Give an example where embarassing parallelism won't help improve preformance. - Given a relationship of managers, employees, please find the lowest common ancestor. - Merge two sorted integer array in one pass[2]. - How do you reshard a database without whole database offline? - How do you detect a loop in linked list? - Implement quick sort. - 8 queens. 2. 非技術性 - What is your greatest failure? - Waht's the biggest challenge you ever had to overcome? 感想: 題目種類很多, 不過Map/ Set 實作, thread safety, 還有 Big O 這類型 重覆很多次. 另外在找的過程中, 有留意到歐洲柏林有不少機會, 主要是新創公司類型. 履歷的內容儘量量化, 例如改善專案程式, 增近效能約X%. 會比只有單純寫改 某些程式要容易讓人注意. 希望有點幫助. [1]. https://web.stanford.edu/class/cs9/lectures/04/Two-Sum.pdf [2]. https://www.quora.com/ \ What-will-be-an-easy-way-to-merge-two-sorted-arrays --

※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 99.59.169.69 ※ 文章網址: https://webptt.com/m.aspx?n=bbs/Oversea_Job/M.1497163518.A.809.html