Monthly Archives: January 2012

Programming Interview Questions 27: Squareroot of a Number

Find the squareroot of a given number rounded down to the nearest integer, without using the sqrt function. For example, squareroot of a number between [9, 15] should return 3, and [16, 24] should be 4.

Posted in Programming Interview | 18 Comments

Programming Interview Questions 26: Trim Binary Search Tree

Given the root of a binary search tree and 2 numbers min and max, trim the tree such that all the numbers in the new tree are between min and max (inclusive). The resulting tree should still be a valid binary … Continue reading

Posted in Programming Interview | 15 Comments

Implementing Search Engines

Welcome to my ‘how to implement a search engine’ series. I describe how to implement an actual search engine with working code in python. Here you can find pointers to original detailed articles. I will continue to share in this … Continue reading

Posted in Search Engines | 5 Comments

Programming Interview Questions

The complete list of all my programming interview question articles with pointers to original posts. There are 28 questions in total, and since 28 is a perfect number (as Donald Knuth also mentioned) I decided that’s a good place to stop.

Posted in Programming Interview | 29 Comments

Programming Interview Questions 25: Remove Duplicate Characters in String

Remove duplicate characters in a given string keeping only the first occurrences. For example, if the input is ‘tree traversal’ the output will be ‘tre avsl’.

Posted in Programming Interview | 13 Comments

Programming Interview Questions 24: Find Next Higher Number With Same Digits

Given a number, find the next higher number using only the digits in the given number. For example if the given number is 1234, next higher number with same digits is 1243.

Posted in Programming Interview | 32 Comments