Interview tips for programmers | LeetCode



1) Algorithms/Data structure
2) Programming language-specific / General CS knowledge
3) Brain teaser

I’ll go over with more details on each of them:
1) Algorithms/Data structure
You should understand these topics deeply from a typical data structure course: Array, Linked-list, Binary tree, Hash table… You should be able to tell when to use an array vs. linked-list, implementation details of linked list such as reversing a list…

Interviewer typically test your problem-solving ability by asking algorithmic questions. Some examples are:
- Reversing the words in a sentence.
- Reversing the letters in a word. (Try both iteration and recursion solutions)
- How to find duplicate data in a list.
- Generating permutations of n digits. (hint: recursion)
- Find the median of combination of two sorted arrays of numbers. (hint: divide and conquer)
- How to spell-check and correct a word (hint: edit distance)

2) Programming language-specific / General CS knowledge
If you’re applying a C++ programmer position, be prepared for lots of C++ questions. Same with other languages. If the position you applying does not have a language-specific role, you may be asked general CS knowledge, such as difference between allocating on a stack and heap, …

Some C++ related questions I encounter often:
- What are virtual functions? How is it implemented? What are the trade-offs using virtual functions?
- What is a virtual destructor? When do you need them? What if you don’t implement a destructor as virtual?
- What is copy constructor and when is it being called?
- What’s the difference between malloc and new?

3) Brain teaser
Some interviewers like to ask a brain teaser question to end the interview :) You’ll know it when they ask: Do you like puzzles? Prepare for some creative thinking :)

Some sample questions:
- Two eggs problem:
You have two identical eggs and you are given access to a 100 story building. You would like to know the highest floor for the egg not to break when dropped. The problem is the egg might break on the 1st floor, or even the 100th floor, you just don’t know. Find the maximum number of trials you need to conduct in order to find the answer.

- Reverse the bits in one byte data as fast as possible.

- You have 5 identical jars. 4 of the jars contain balls with identical size weighing 10g each, while 1 of the jar contains balls weighing 9g each. You are given a digital scale, find out the 1 jar that has the 9g balls with only 1 weighing.


Read full article from Interview tips for programmers | LeetCode


No comments:

Post a Comment

Labels

Algorithm (219) Lucene (130) LeetCode (97) Database (36) Data Structure (33) text mining (28) Solr (27) java (27) Mathematical Algorithm (26) Difficult Algorithm (25) Logic Thinking (23) Puzzles (23) Bit Algorithms (22) Math (21) List (20) Dynamic Programming (19) Linux (19) Tree (18) Machine Learning (15) EPI (11) Queue (11) Smart Algorithm (11) Operating System (9) Java Basic (8) Recursive Algorithm (8) Stack (8) Eclipse (7) Scala (7) Tika (7) J2EE (6) Monitoring (6) Trie (6) Concurrency (5) Geometry Algorithm (5) Greedy Algorithm (5) Mahout (5) MySQL (5) xpost (5) C (4) Interview (4) Vi (4) regular expression (4) to-do (4) C++ (3) Chrome (3) Divide and Conquer (3) Graph Algorithm (3) Permutation (3) Powershell (3) Random (3) Segment Tree (3) UIMA (3) Union-Find (3) Video (3) Virtualization (3) Windows (3) XML (3) Advanced Data Structure (2) Android (2) Bash (2) Classic Algorithm (2) Debugging (2) Design Pattern (2) Google (2) Hadoop (2) Java Collections (2) Markov Chains (2) Probabilities (2) Shell (2) Site (2) Web Development (2) Workplace (2) angularjs (2) .Net (1) Amazon Interview (1) Android Studio (1) Array (1) Boilerpipe (1) Book Notes (1) ChromeOS (1) Chromebook (1) Codility (1) Desgin (1) Design (1) Divide and Conqure (1) GAE (1) Google Interview (1) Great Stuff (1) Hash (1) High Tech Companies (1) Improving (1) LifeTips (1) Maven (1) Network (1) Performance (1) Programming (1) Resources (1) Sampling (1) Sed (1) Smart Thinking (1) Sort (1) Spark (1) Stanford NLP (1) System Design (1) Trove (1) VIP (1) tools (1)

Popular Posts