Extract the N largest floating point numbers from a large file of floating point numbers.
Engineer Interviews
Engineer Interview Questions
Engineers are responsible for designing and building products. In an interview context, expect to be quizzed on your technical skills, and also evaluated for your ability to work as a part of a team to get things built. The specific questions you are asked will depend on what type of engineering position you are looking for such as a specific engineering discipline like software engineer, electrical engineer, or mechanical engineer.
Top Engineer Interview Questions & How to Answer
Question #1: What is the most challenging engineering project you've dealt with, and how did you ensure it was successful?
Question #2: In your current role, what steps do you take to avoid making mistakes?
Question #3: Describe a time you dealt with a difficult client or stakeholder.
842,611 engineer interview questions shared by candidates
Given an array of integers, all but one of which appears an even number of times, find the one integer which appears an odd number of times. Upon completion, asked to improve the algorithm in terms of both time and space, eventually asked to do it in O(n) time and constant space.
2. You have an array (size is not known) and whose elements are having the values from 0-> 99. Find out the three largest elements in that array and return those.
Find the numbers in an array that appear an odd number of times.
Given the word "HEAD" and the word "TAIL," write code and/or describe using computer science algorithms how you would transform from the word HEAD to the word TAIL. Each change must be by only one letter, you cannot change the letter in a given position twice, and each new word must be a valid word.
Given an integer array which consists of numbers from 1 to N with 1 number missing find the missing number. What will you do if 2 numbers are missing?
Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.
Implement a Queue using 2 Stacks
Given an integer, re-arrange the integer such that first and last digit will be at first and second, second and second last digit will be at third and fourth position from left of the re-arranges integer and so on. Example: Input -> 12345678, Output -> 18273645 Input -> 1234567, Output -> 1726354
find number of 1's in a number
Viewing 1241 - 1250 interview questions