Pass a list of word to a function [car, rats, arc, star] and have the function group the words which are anagrams of eachother.
Engineer Interview Questions
843,597 engineer interview questions shared by candidates
Output a single linked list in reverse, in linear time and constant space, and recursively
How to implement Sqrt(double k) efficiently?
Given n+1 buckets with n of them with ball inside and move(a,b) function, that moves ball from bucket a to bucket b. Each ball has a different number from [1,n] on it. Move balls, so each bucket has a ball with matching number in it.
Given 2 arrays sorted in ascending orders (a[n] and b[n*2]) with the second half of array a[] being empty, create a function that merges both arrays into a single sorted array.
You are given an array of N elements in the form "property1: value1; property2: value2;...;propertyX: valueX;" for some some N and any X. There is also another array of M elements of the form "property: value". You are supposed to write an algorithm to remove every element in the N length array that has a "property: value" pair in the M length array. The trick is that the most intuitive solution of iterating through the M array and filtering the N array at each element is already written. You must come up with a solution that solves the problem in less than O(NM) time.
introduction about yourself, how you think will fit in role, stress strain curve in detail. powertrain of an EV. explain components in detail. where id the maximum power from battery used in car? other consumptions in car. heat dissipation in EV. explain the cooling system with the function of each component. traction control system. center of gravity. comparing material on the stress strain curve. interpretation. where will the curve head if force is stopped in between the stress strain curve.
Given two binary trees, return true if they have same elements (irrespective of tree structure)
Give a dictionary with a huge set of words and a string with wildcard. You are required to find whether there is a match in the dictionary for this given string.
Write a function to take a BST and a value k as input and have it print the kth smallest element in the BST.
Viewing 801 - 810 interview questions