摘要：
Question Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to 阅读全文
posted @ 2015-10-10 11:08
树獭君
阅读(243)
评论(0)
推荐(0)
摘要：
QuestionGiven a binary search tree, write a functionkthSmallestto find thekth smallest element in it.Note:You may assume k is always valid, 1 ≤ k ≤ BS... 阅读全文
posted @ 2015-10-10 08:01
树獭君
阅读(306)
评论(0)
推荐(0)
摘要：
Today, Infusion held a talk in Columbia University about tech interview.Talker: Nishit Shah @ Infusion, Techinical Account Manager, Dev -> Team Lead -... 阅读全文
posted @ 2015-10-10 05:10
树獭君
阅读(172)
评论(0)
推荐(0)
摘要：
Today, TripAdvisor held a tech talk in Columbia University. The topic is about k-d Tree implemented in TripAdvisor to efficiently search MASSIVE locat... 阅读全文
posted @ 2015-10-10 03:15
树獭君
阅读(184)
评论(0)
推荐(0)
摘要：
In this blog, we give a solution for Quick Select.Here, we have an improvement.The idea is to randomly pick a pivot element.Main difference is how we ... 阅读全文
posted @ 2015-10-10 00:30
树獭君
阅读(438)
评论(0)
推荐(0)
摘要：
(referrence: GeeksforGeeks, Kth Largest Element in Array)This is a common algorithm problem appearing in interviews.There are four basic solutions.Sol... 阅读全文
posted @ 2015-10-10 00:14
树獭君
阅读(756)
评论(0)
推荐(0)
浙公网安备 33010602011771号