每日一贴: http://www.mitbbs.com/article_t/JobHunting/33037695.html

每日一贴: http://www.mitbbs.com/article_t/JobHunting/33037695.html

1. Write a iterator to iterate a nested array.    For example, for given array: [1, 2, [3, [4, 5], [6, 7], 8], 9, 10]    call iterator.next() 10 times should return 1,2,3,4,5,6,7,8,9,10.    用了stack存(array, index)的tuple。 3. Implement HashTable 主要看dynamic expanding 4. Implement MaxHeap. 。要求实现核心算法。可以给出一些helper function定义不需实现。 6. LeetCode 付费题 157 & 158 - Read N Characters Given Read4()。提供int  read4(char* buf)，实现int read(char* buf, int len)。read4函数读至多4个字符， 除非EOF，并返回实际读到的字符个数。题没有难度要注意一些细节问题。 7. Given an array with length n + 1. The array contains numbers from 1 to n, with one of the number duplicated. Now find the duplicated number.    讨论各种解法以及时间空间复杂度，最后实现O(N)时间O(1)空间的解法。数组可以 mutate. 8. Given a bag of characters and a dictionary, find longest string that can  be constructed. 9. Given a grid of characters and a dictionary, find all possible words from grid.    以上两题都用的标准Trie树解法。讨论复杂度，和优化方案。 10. Given a grid with 'o' and 'x'.

Read full article from 每日一贴: http://www.mitbbs.com/article_t/JobHunting/33037695.html