-Asked to write a function to find the start point of "$" and ";" in a string -Asked to write a regular expression to find text between "$" and ";" unless there was a space after "$". -How do you know if a linked-list is circular (even a middle item could point to one of the previous items) if you know its size?
Relatively simple questions based on arrays and trees.
Delete duplicate characters
Count # of A's in a sentence
Write the strstr function.
"Tell me about your biggest achievement?"
Write a function that takes in 3 sides (lengths) of a triangle and determine if it is a valid triangle. (see, it's not too bad, remember the basics and you'll be fine)
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
Find if two nodes in a binary tree have a common ancestor.
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
Viewing 411 - 420 interview questions