Buddy bitmap clear bit and event handler
Software Engineer Interview Questions
467,266 software engineer interview questions shared by candidates
The recruiter did an initial technical screening on the phone. The questions were multi choice type. He read the questions and then read the choices. There were about 10 questions. Pretty basic.A day later I was scheduled for the first round of phone interview which was an hour long technical assessment. The questions were simple. At the end of this interview I was asked to code a solution for a simple problem. There was a screen share so that the interviewer could look at my screen. A day later I got a call saying they'd want to schedule an on-site. I wasnot given the details as to how many rounds of interview to expect. I wasnot not even given a schedule that listed how long the individual interviews would go for. Was just told the interview would take 2-3 hours. A day before the interview I received an e-mail saying the interview time was pre-poned by like 2 hours. It was very unprofessional to inform me of pre-poning a day before. I had to take the day off at work. I had 2 rounds of interview on-site. For both the rounds there were 2 interviewers. The first round was just a resume walk through and a few behavioural questions. the second interview consisted of 2 parts 1. cognitive interview. 2. root cause analysis type. For the cognitive part, the interviewers would give you a question( like how many ice-creams are sold in US each year) and would want to see your approach for it. for the second part, they'd give you a problem and expect you to come up with the root cause for it.
My processor is consuming too much power, write a program to reduce processor power consumption.
Given a message "one two three four five six seven eight nine", chop it in chunks(no exceed the give buffer size) and print out to the screen. Need to maintain the word and do not chop it off. I.E.: buffer size is 15 one two three (1/4) four five six (2/4) seven eight (3/4) nine (4/4)
How to process a big number that cannot be stored in any data structure. How you would represent it.
Given a maze, represented as a matrix, and the initial and final points write an algorithm to solve this.
Write a function to find intersection of 2 sorted arrays.
a very long single linked list, how to find the n-th entry from the end.
Easier questions 1) Two variations of a program exist, A and B. When run on machine 1, A runs twice as fast as B. When run on machine 2, A runs 10x as fast as B. How would you investigate this? -same datasets -same versions of OS and libraries -same hardware 2) Had to code a method that calculated the factorial, first simply, then a second one recursively.
Find a repeated number in a list of numbers
Viewing 1851 - 1860 interview questions