Blog Detail

World of BROCK

http://worldofbrock.blogspot.com/

You'll find here some algorithmic puzzles, tutorials... and stuff... solved interview questions, tips and tricks, basically everything that you'll ever need to know to get a job in IT.

• Added on: Sep 5th, 2009
• Country: Romania
• Language: English

• Author: BROCK
• Listed in: Technology Science
• Tags: tips tricks puzzles interview questions algorithms

Recent Posts

• How to hack daily puzzles on www.gameknot.com

  Posted on Tuesday December 22nd, 2009 at 04:30 in tricks

  What better way of wasting two hours of your life then hacking a website? :) Actually what I'm going to show here is just a simple example of javascript function overriding, it doesn't even deserve the name "hack". The site is not very secured, but t...

• How to generate random numbers in [1...7] from random numbers in [1...5]

  Posted on Saturday December 12th, 2009 at 11:41 in algorithms, google interview, microsoft interview, bit operations

  Well known as a Google/Microsoft interview question, the following problem is actually really complicated to solve correctly, although it looks easy: Given a function which produces a random integer in the range 1 to 5, write another function which ...

• Momentary break

  Posted on Wednesday November 25th, 2009 at 12:17

  M64FT7ZUTGK4 Been very busy the last few weeks. I will resume posting soon. ...

• How to find the missing number from an array

  Posted on Saturday October 31st, 2009 at 12:48 in tricks, algorithms, microsoft interview

  This is what I've been asked at an interview at Microsoft (over the phone): An array of length N (for example N = 6) is given, containing all the elements from 1 to N, except one which is duplicated. So instead of having: 1: 1, 2, 3, ...

• How to do integer partitioning

  Posted on Friday October 30th, 2009 at 10:54 in algorithms, google interview

  The problem statement: given a number N, for example 5, print all the partitions of this number, meaning: the sum of all possible number that add up to N. In this example: 1: 1+1+1+1+1 2: 1+1+1+2 3: 1+1+2+1 4: ...

• How to find all possible words from a phone number

  Posted on Monday October 26th, 2009 at 14:06 in algorithms, google interview

  The problem statement: Most phone numbers these days are like 1-800-COOLSTUFF, which means you have to type 1-800-266578833 on your phone to dial. Given an array of numbers like "266578833" above, find all the words which could be formed from them. T...

Comments & Reviews

This blog is currently rated a 5.00 out of a possible 5 based on 1 comment.

BROCK

Good information presented in a intelligible format

Posted: September 19th, 2009 | More Reviews From hello2 | Report This Comment

Post A Comment/Review

* Your IP is being logged.
* Your e-mail address is used only for verification purposes only and will not be sold, or shown publicly.
* No HTML tags allowed
* DO NOT use the Comments/Reviews to promote your own site.