Given a function for a fair coin, write a function for a biased coin that returns heads 1/n times (n is a param).
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,080 engineer interview questions shared by candidates
Given a multi-step product feature, write SQL to see how well this feature is doing (loading times, step completion %). Then use Python to constantly update average step time as new values stream in, given that there are too many to store in memory.
SQL: 1. Percentage increase in revenue compared to promoted and non-promoted products. 2. Products classes that has the highest transactions 3. Count of Customers who bought 2 items type (A,B) 4. Don't remember Python: 1. Average length of letters to words. 2. Parse an ip address (This is a favourite FB question) 3. [[A],[A,B],[A,C],[B,D],[C,A]] -- Find the alphabet with highest neighbors? -- (Wasnt able to solve because of time limit but the interviewer was like I get what I want to convey.. I gave her an algo of what I would I have done)
The first one is, given a tree, each node contains a digit. Calculate the sum of all numbers formed by paths from root to leaf. The second one is given a string, remove all 'b's and duplicate all 'a's.
My 30 min coding question was related to tree where all nodes were managers each node has a value which was the number of months they worked.We have to find the maximum tenure which is I remember can be calculated using the average of its child nodes.
code a function that takes 2 parameters and an algorithm, print out all the numbers between the 2 parameters that completes the algorithm
In python code, given a json object with nested objects, write a function that flattens all the objects to a single key value dictionary. Do not use the lib that actually performs this function. { a:{b:c,d:e} } becomes {a_b:c, a_d:e} ( not, a:"b:c,d:e" }
1 of very few questions that were not in STAR format: where do you see yourself in the next 5 years? (This is not a question about your ambition for the future, it's about whether you plan on sticking with this position in GM)
(following the previous one) You got only TWO baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height? (This is the one I think is kind of brain-teaser one.)
Write an algorithm to see if a tree is a BST.
Viewing 501 - 510 interview questions