Recursive Algorithm Interview Questions
(Posted anonymously by job candidates)
| 18 Interview Questions: 11–18 of 18 | Sort by |
Nov 17, 2011
Interview Question for Software Engineer at Meebo:
|
“Write the function nqueens(num_rows, num_cols, num_queens) -- where num_rows and num_cols is the size of an arbitrary chess board. Function returns "true" if there exists a way to place "num_queens" queens without any queen threatening any other queen, false if it isn't possible. |
Nov 11, 2011
Interview Question for Senior Consultant at CIBER:
|
“Describe a case where you would need to use a cursor to return records from a table.” |
Oct 17, 2011
Interview Question for Software Engineer at TripAdvisor:
|
“Write a function that raises a number to an exponent in C or Java...” |
Feb 7, 2011
Interview Question for Software Engineering Intern at Facebook:
|
“Implement a power function to raise a double to an int power, including negative powers.” |
May 8, 2010
Interview Question for Software Engineer at Google:
|
“Write a function Brackets(int n) that prints all combinations of well-formed brackets. For Brackets(3) the output would be |
Oct 15, 2009
Interview Question for Member of Technical Staff at VMware:
|
“I don't remember exactly, but some standard low-level C/C++/Java questions. Maybe something about string manipulation, bit play, recursive algorithms, threads, networking, etc.” |
Apr 29, 2009
Interview Question for Software Engineer at Microsoft:
|
“How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?” |
Mar 18, 2009
Interview Question for Software Development Engineer Intern at Microsoft:
|
“Write an algorithm that does an in-order traversal of a tree recursively. Now, write the same algorithm iteratively.” |
