Find the union of two strings?
Engineer Interview Questions
933,580 engineer interview questions shared by candidates
You have 2 light bulbs. You are in multistory building such that if you drop a bulb from a floor of a certain height or higher the bulb will break: for ex: if the bulb will break at a minimum height of 10th floor, then the bulb will break if dropped only if dropped from a floor higher than tenth floor. it will not break if dropped from ninth floor or less. using the two bulbs how will you figure out at which floor will the bulb break?
Phone interview 1 : a) Simulate a Queue with stacks ? b)Find repeated occurrence of character in a string ? Phone interview 2 : a) Given a 2D matrix of numbers find the position of number . Constraints of matrix number always in increasing order left to right and top to bottom . b)When should version control be used . And a tricky discreet math problem ?
One independent survey showed that 70% on people asked like coffee. Another independent survey showed that 80% of people like tea. What is the upper and lower bound of peoples who likes both coffee and tea
Given the daily values of a stock, find how you can lose the most with one buy-sell trading.
If you had 26 hours in your day , how would you spend those additional two hours.
I thought the interview was all about communication skill... no c c++ java.. no unanswerable questions... no domination... quite cool... he had to see me speaking confidently with out the bias of fear r something else... so he kept the interview cool... of-course, i have tried my best for that... You will be almost selected if u pass the written exam... provided with acceptable communication levels and confidence.. no need of Hollywood level speed or verbal skills... just convey your matter in a cool and simple way.. Take some care to protect your character by answering with contradiction or domination.... if done so.. u have got yourself a job at Infosys...
1 or 2 Technical questions that depend on what you've written in your resume. General behavioural questions. Do you mind working something that may be repetitive?
Quiz
Given an array of integers eg [1,2,-3,1] find whether there is a sub-sequence that sums to 0 and return it (eg 1,2,-3 or 2,-3,1) Checking every sub-sequence is O(n^2) which is too inefficient
Viewing 81 - 90 interview questions