There was no difficult or unexpected questions. for instance: -sort an array with just two types of elements, optimize your algorithm -find common letters in two strings and put them in a sorted order -compare sorting algorithms
Development Engineer Interview Questions
37,146 development engineer interview questions shared by candidates
Simple linked list question I wasn't prepared to deal with (it had been a while since I practiced my coding, and I had midterms so I didn't have time). Elements of a linked list can have a "dirty" boolean tag, implement void setDirty(node) and boolean hasDirtyDescendants(node)
Find if two nodes in a binary tree have a common ancestor.
Find the number of '0' bits in an integer.
The on-site interview consisted of five technical questions; code was required for four of the five: 1. Write a small parser for strings that determines whether a string is a sequence of space-separated words 2. Write an API for working with a specific type of document 3. Given an undirected cyclic graph, find all paths from A to B without cycles 4. The delivery of the fourth question was very confusing - basically they wanted me to implement a stack as a means of counting parentheses 5. Given a function prototype and a return value, hypothesize regarding 'what happened' The on-campus interview was a single technical question; the interviewer was extremely bored: A. I've forgotten this question; it was a relatively trivial string analysis problem
You have 2 linked lists, return a list with the intersection. For example: Input: L1 = { 1,2,5,10} L2 = {9,4,5,10,15} return {5,10}
Hardest challenge faced?
Too nervous to get a solution quickly and bug free.
First round interview asked to write program that took a file of text, and then counted and stored all words from file.
Given any two nodes in a binary tree, develop program that determined their highest common ancestor.
Viewing 2191 - 2200 interview questions