[leonid]

Read Introduction to Algorithms

You should know what data structures to use for certain problems right away, and the efficiencies of them in Big-O notation
Master basic sorting algorithms; know the efficiencies for best, average, and worst cases in Big-O

You should be able to write simple codes on a whiteboard
Know how to code in C (or C++), JAVA, and Python

Learn some OOP; Know how to plot starter classes to solve complex problems. Learn about inheritance, encapsulation etc etc

Read aloud anything that goes through your mind while solving a problem. If you are on the right track, interviewer will mark that positively. If you aren't, interviewer might add subtle hints to help you out

If in doubt, shout "HASH TABLES" and you will probably be right



If you have mentioned your previous works on your resume, interviewer might ask you about them.. Be prepared to briefly talk about it. If those are too old for you to be recalled, just get rid of them (interviewers hate long-ass resumes i.e. more than two pages)