Write an algorithm to calculate the total number of paths possible from point (0, 0) to point (m, n) in an m by n grid. (You cannot retrace a line you already made when forming a path.)
Intern Engineering Interview Questions
56,348 intern engineering interview questions shared by candidates
Given an array of (unsorted) integers, arrange them such that a < b > c < d > e... etc.
What's the best way to detect a loop in a linked list?
how would you find the shortest path between two nodes in a social network?
Print a linked list in reverse recursively and non-destructively.
Design a data structure that supports insert, delete min, delete max, get min, and get max, all in log(n) time.
Write a C function to define strstr(char *haystack, char * needle) to return the first occurrence of needle in haystack. Code must compile and execute.
Say you have a single-column table of entries of variable size. Implement this table to also contain methods to lengthen one cell, cut a cell shorter, and to return which cell we're pointing at if given a certain distance from the beginning of the table. All methods need to be fast (assume a single-column table with many many entries).
Given an array of arrays which contain characters, find all the arrays with at least one common character and return them as pairs.
Given a list of 4 billion integers, find an integer not in the list using 4MB of memory.
Viewing 21 - 30 interview questions