156 Users, 315 Questions
A collection of technical interviews questions in PDF format.
(Last updated on 12/03/2008)
Latest questions |
Browse all questions
max window of matching patterns
Views:13,Comments:0,Saved by 1 2010-09-01 10:33:15 | spellscroll
Given two sequences of length N, how to find the max window of matching patterns. The patterns can be mutated.
For example, seq1 = "ABCDEFG", seq2 = ...
binary matrices with boundary filled by 1
Views:10,Comments:0,Saved by 1 2010-09-01 10:30:44 | spellscroll
Given a binary matrix A, i.e. each entry is either 1 or 0, design an algorithm to find a complete set
{A1, A2, ..., Ak} of sub-matrices of A ...
a worm on a cord
Views:44,Comments:0,Saved by 1 2010-08-21 10:21:53 | spellscroll
There is a worm on a cord of length 2. The worm climbs from one end to the
other at speed 1/min.
Each minute the length ...
SELECTION IN SORTED X + Y MATRICES
Views:141,Comments:0,Saved by 1 2010-07-19 06:06:08 | spellscroll
Let X[0::n-1] and Y [0::m-1] be two sorted arrays, and de ne the mxn matrix A by A[j][i] = X[i] + Y [j]. Give an efficient algorithm for selecting the ...
Shortest excerpt containing all keywords
Views:109,Comments:0,Saved by 1 2010-07-19 05:54:03 | spellscroll
You're looking for a set of words in a file. Return the location of the shortest excerpt containing all of these target words.
Welcome!
spellscroll.com is a collaboratively edited site for sharing and discussing programming interview questions, math puzzles, and brainteasers.