by 1337c0d3r
September 30, 2010 in backtracking
Given a target number, and a series of candidate numbers, print out all combinations, so that the sum of candidate numbers equals to the target.
Read the rest of this entry →
by 1337c0d3r
September 29, 2010 in binary tree
Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called ‘serialization’ and reading back from the file to reconstruct the exact same binary tree is ‘deserialization’.
by 1337c0d3r
September 28, 2010 in binary tree
Describe an algorithm to save a Binary Search Tree (BST) to a file in terms of run-time and disk space complexity. You must be able to restore to the exact original BST using the saved format.
by 1337c0d3r
September 18, 2010 in binary tree
Have you ever thought of pretty-printing a binary tree?
Read the rest of this entry →
by 1337c0d3r
September 18, 2010 in binary tree
Given a binary tree, print out the tree in zig zag level order (ie, from left to right, then right to left for the next level and alternate between). Output a newline after the end of each level. Read the rest of this entry →
by 1337c0d3r
September 17, 2010 in binary tree
Given a binary tree, print out the tree in level order (ie, from left to right, level by level). Output a newline after the end of each level. Breadth First Search (BFS) is not allowed. Read the rest of this entry →
by 1337c0d3r
September 16, 2010 in binary tree
Given a binary tree, print out the tree in level order (ie, from left to right, level by level). Output a newline after the end of each level. Read the rest of this entry →
by 1337c0d3r
September 14, 2010 in binary tree
Write a function isBST(BinaryTree *node) to verify if a given binary tree is a Binary Search Tree (BST) or not.
by 1337c0d3r
September 11, 2010 in linked list
Given a singly linked list, find if there exist a loop.
by 1337c0d3r
September 11, 2010 in linked list
Given a list, split it into two sublists — one for the front half, and one for the back half. If the number of elements is odd, the extra element should go in the front list. So FrontBackSplit() on the list {2, 3, 5, 7, 11} should yield the two lists {2, 3, 5} and {7, 11}.
by 1337c0d3r
September 9, 2010 in bit operations
Write a function that takes an unsigned integer and returns the number of ’1′ bits it has. Read the rest of this entry →
by 1337c0d3r
September 8, 2010 in bit operations
What does the following function mystery() do?
1 2 3 | bool mystery(unsigned int x) { return !(x & (x-1)); } |