write a program to translate alphanumeric phone number to numbers only
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
Question #1: What is the most challenging engineering project you've dealt with, and how did you ensure it was successful?
How to answer
How to answer: This question requires you to give a specific example. Ideally, you're able to choose a project that mirrors the type of work you'd do in the role you're interviewing for. Even if it's not your most challenging project, make sure you describe your obstacle(s) and the successful outcome clearly and enthusiastically.
Question 2
Question #2: In your current role, what steps do you take to avoid making mistakes?
How to answer
How to answer: Whether you have a formal process or not, list any specific measures you employ (i.e., digital tools, consulting with colleagues, etc.). Make sure your answer demonstrates a commitment to quality control, efficiency, and safety.
Question 3
Question #3: Describe a time you dealt with a difficult client or stakeholder.
How to answer
How to answer: This one also requires a specific example that demonstrates patience and good judgment. An employer is looking for evidence that you're able to confidently and calmly stand by your decisions. Share an example with a positive outcome.
841,870 engineer interview questions shared by candidates
Given a series of words written using a scrambled alphabet, figure out what order the letters of the alphabet are in.
Difference between RB trees and B trees?
Suppose you have an arbitrarily connected graph with n nodes. Come up with an algorithm to identify each set of connected nodes (i.e. identify all the islands in the graph). What's the complexity? Can you find a solution in O(n log n)?
Guessing game - I pick a number between 1 and 100 and you are trying to guess it. Every time you query a number I tell you if it is higher or lower. Part 1- Write the code of it, if cost of querying a number is equal. Part 2- How about if cost of querying number x is x? How would you change the algorithm?
Implement hash table. Given a mountain of integers :: like 1 2 3 9 6 5 or 4 9 3 give the maximum
Given a string, find the longest substring which contains 2 unique characters. ""abcbbbbcccbdddadacb" => "bcbbbbcccb"
Given an array of character you must delete all the characters that got repeated 3 or more times consecutively and add '0' in the end of the array for every deleted character Example: "aabbbbcdddee" -> "aacee0000000" "22221" ->"00001 " The problem must be solved in: O(1) memory O(n) time And you can't overwrite a cell in the array more than once.
Why Bloomberg? Tell me about yourself and what you do? Given 11000111, output how far each 0 is from the current index. So output should be 21000123
Write a program to reverse the numbers (e.g 12345 to 54321), without using vectors.
Viewing 721 - 730 interview questions