Given a tree where every right node is a leaf, meaning that it can only extend on the left side, invert it such that the leftmost node is now the root, and all of the previous left nodes are now on the right side. The former right nodes will be on the left side.
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,634 engineer interview questions shared by candidates
How to check if the string is palindrome ?
A couple tricky questions. One required writing a modified binary search, the other dealt with data structures and how to efficiently check if a given set of numbers contained two numbers summing to some other number x.
2. /** * A tournament tree is a binary tree * where the parent is the minimum of the two children. * Given a tournament tree find the second minimum value in the tree. * A node in the tree will always have 2 or 0 children. * Also all leaves will have distinct and unique values. * 2 * / \ * 2 3 * / \ | \ * 4 2 5 3 * * In this given tree the answer is 3. */ class Node { Integer value; Node left, right; Node(Integer value, Node left, Node right) { this.value = value; this.left = left; this.right = right; } } class Solution { /** * This should return the second minimum * int value in the given tournament tree */ public static Integer secondMin(Node root) { } }
Print a tree level by level
Asked a question to determine the sum of an array of integers. Recursive problem.
Write a program that takes an integer and prints out all ways to multiply smaller integers that equal the original number, without repeating sets of factors. In other words, if your output contains 4 * 3, you should not print out 3 * 4 again as that would be a repeating set. Note that this is not asking for prime factorization only. Also, you can assume that the input integers are reasonable in size; correctness is more important than efficiency. PrintFactors(12) 12 * 1 6 * 2 4 * 3 3 * 2 * 2
They asked to write a function that takes a string and check if it is a number. The second question was given a sorted array that has been rotated, find a number in that array {6,7,1,2,3,4,5}
Basic OOP related questions and Java question about different data structures.
Viewing 1811 - 1820 interview questions