Java program in round 3 was the most difficult question in my case. A matrix halfly-filled with numbers - almost randomly was given . And You need to fill the blank matrix of same size with those numbers in similar arrangement in a program using 2D arrays and loops.
However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).
Given a big image, how will you pan and zoom into the image in a way so as to focus on the important parts ot the image.
Merge 2 sorted arrays A and B Result should end up in B, which has available space for all items Utilize the space in B, not using temporary arrays Result in sorted array in B A { 2, 5, 8, 12, 15} B { 3, 5, 7, 9, , , , , , }
You have two intersecting linked lists. Describe a function that returns a pointer to the node where they intersect.
Check if a string which represents a math exercise is balanced in terms of parentheses Remove spaces from a string
Peer Programming Round: A coding problem statement was given which had to be implemented in 4 hours. The reviewer was not interested in understanding the approach.
Getting the min from a stack in O(1) time
Convert number above in hexadecimal 312312 Ex. 255 -> FF 254 -> 254 div 16 = 14, int(254/16) = 15. -> F, E Later I found the detailed Division-remainder in source base http://en.wikipedia.org/wiki/Hexadecimal#Division-remainder_in_source_base
How to write an evaluator for a string like "(1+3 * ( 5 / 4)) and get a numeric result.
Viewing 2061 - 2070 interview questions