N00tc0d3r
Sunday, September 29, 2013
System Design for Big Data [tinyurl]
›
What is tinyurl? tinyurl is a URL service that users enter a long URL and then the service return a shorter and unique url such as ...
25 comments:
Clone Graph
›
Clone Graph Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. class UndirectedGraphNode { ...
2 comments:
Topological Sort
›
Topological Sorting Sandro is a well organised person. Every day he makes a list of things which need to be done and enumerates them from ...
1 comment:
Sunday, September 22, 2013
System Design for Big Data [Consistent Hashing]
›
Suppose you are designing a distributed caching system. Given n cache hosts, an intuitive hash function is key % n . It is simple and com...
3 comments:
Thursday, September 19, 2013
Inorder Binary Tree Traversal with Constant Space
›
Inorder Binary Tree Traversal with Constant Space Implementing inorder traversal with O( n ) space is pretty straight forward. Could you dev...
1 comment:
Monday, September 9, 2013
Count Numbers That Has A 4 In It
›
Count Numbers That Has A 4 In It Given a positive integer N , calculate the number of positive integers under N that has at least one dig...
8 comments:
Saturday, August 31, 2013
Implement LRU Cache
›
Implement LRU Cache Least Recently Used (LRU) caching scheme is to discard the least recently used items first when the cache is full and a...
3 comments:
Sunday, August 25, 2013
Implement Iterator for BinaryTree III (Post-order)
›
Implement Post-order Iterator for Binary Tree Suppose the data structure for a Tree node is as follows: public class TreeNode { int val...
5 comments:
Implement Iterator for BinaryTree II (Pre-order)
›
Implement Pre-order Iterator for Binary Tree Suppose the data structure for a Tree node is as follows: public class TreeNode { int val; ...
1 comment:
Implement Iterator for BinaryTree I (In-order)
›
Implement In-order Iterator for Binary Tree Suppose the data structure for a Tree node is as follows: public class TreeNode { int val; ...
›
Home
View web version