This is the place that I've been using to test my C++ Kung Fu. http://icpc.baylor.edu/past/default.htm
Search google for data structures, but basic ones are stacks, linked lists, binary trees, how to search / traverse each. Then use them to do the problems above. - Sean On Thu, Oct 23, 2008 at 7:43 PM, Jeffrey Melloy <[EMAIL PROTECTED]> wrote: > > There's also project Euler and spoj. Both focus on algorithmic > challenges and not programming design -- I think my longest python > script for project Euler is a couple hundred lines. But they're a good > refresher for algoritms and problem solving. > > Sent from my iPhone > > On Oct 23, 2008, at 5:15 PM, "Robert Eickmann" <[EMAIL PROTECTED]> > wrote: > > > > > I really liked the book hackers delight. Lots and lots of fun bit > > twiddling, I spent a couple of happy weekends with that book. > > > > Probably the old standard is the book 'moving mount Fuji'. Its the how > > to get a job a Microsoft in the 90s book. Lots and lots of silly > > questions involving manhole covers and why door keys work the way that > > they do. That said it will refresh your brain for interviewing with > > formerly with 'it' managers. > > > > Their is a book called Aceing the technical interview that I haven't > > read but I have heard good things about. > > > > And their are the red cover with as many ugly geeks as we can find > > series of books called 'Programming Interviews Exposed'. Haven't > > actually read that one. > > > > Seriously read Mt Fuji and drop a copy of Knuth on the floor and read > > and work though the next few pages and you should be good to go. > > > > -R > > > > > > > > > > > > > > > > On Thu, Oct 23, 2008 at 4:45 PM, Justin Martenstein > > <[EMAIL PROTECTED]> wrote: > >> > >> Howdy, all! > >> > >> So I'm back on the job hunting trail now, and I'm trying to figure > >> out > >> the best way to prep for some basic programmer interview questions. > >> Does anyone have any recommendations for good programming practice > >> questions. Stuff like "write a function that lists all the primes > >> between 1 and N", or "write a function that shows the given Nth > >> number > >> in a Fibonacci sequence". Any suggestions? I'm looking for something > >> similar to Dave Thomas's Code Katas (which are also very super-cool). > >> > >> -- > >> Justin Martenstein > >> [EMAIL PROTECTED], (206) 527-3091 > >> http://www.linkedin.com/in/jmartenstein > >> > >>> > >> > > > > > > > > > --~--~---------~--~----~------------~-------~--~----~ Website: http://saturdayhouse.org/ Post: [email protected] Unsubscribe: [EMAIL PROTECTED] -~----------~----~----~----~------~----~------~--~---
