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
Softwareentwickler Im Test Interview Questions
12,348 softwareentwickler im test interview questions shared by candidates
Find if two nodes in a binary tree have a common ancestor.
Hardest challenge faced?
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
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.
Mostly technical question around work done earlier
Testing Process
reverse words in a string
Asked one question to solve: The “Ransom Note” problem.
Viewing 761 - 770 interview questions