Find Kth smallest element in a BST.
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,850 engineer interview questions shared by candidates
Generate a new array from an array of numbers. Start from the beginning. Put the number of some number first, and then that number. For example, from array 1, 1, 2, 3, 3, 1 You should get 2, 1, 1, 2, 2, 3, 1, 1 Write a program to solve this problem.
Write a function that takes 2 arguments: a binary tree and an integer n, it should return the n-th element in the inorder traversal of the binary tree.
The first coding question was to determine whether a list of integers with size N, contains all the numbers from one to N.
Given a sorted array, where each element but one occurs only once, return the element that repeats. (For example, given 1, 2, 3, 3, 4, return 3. Given 1, 2, 3, 4, 6, 6, 7, 8, 9, return 6.)
Coding Challenge 3) You are given a linkedlist with next and arbitary pointers. Create a new linkedlist similar to the given linkedlist. You need to create a code for deep copy of a linkedlist.
Asked me about Networking, Windows Servers, SQL query and Linux. Basic commands and scenario based question.
Given an large list of unsorted numbers, find the smallest number. You can access the list only 3 numbers at a time, and keep moving forward 1 number at a time.
Find the last element of a linked list.
1. In an array provide pairs of numbers that add to a particular value 2. In fibonacci series provide sum of all even numbers
Viewing 481 - 490 interview questions