All sorts of brain teasers (monte hall problem, etc)
Development Interview Questions
137,413 development interview questions shared by candidates
How to insert a Node in a Linked list.
The interviewer confused me like hell when describing the question. Every node of the tree has a pointer to its left most child. each node has a pointer to its next sibling. Its a BST. Find the smallest value in the tree.
Solve: M is a 2D matrix of integers (nXm) they are sorted in both row and column Write a function search(int s) that return the exact location of the number or Null using lgn
1. Given a non-negative integer array that is then shuffled and 1 element is removed, find which element was removed. 2. Assume you are designing/writing code for some small business software how would you go about creating a clean, extensible method for calculating sales tax that can be extended easily to work in different parts of the world. 3. (Two separate questions) 3a. Given an integer array, remove the duplicate values and return an integer array 3b. Test a dice role generator method 4. Design a system for tracking employee applicants through the interview process
"You have billions of strings sorted in an array. You don't have any access to it. You just have a method that returns the string pertaining to a index. Use only that method to find the location of a given string" I started out at 0(n^2) and kept on improving to o(logn)
Given an integer as input, return how many 1's are in the binary representation of that integer.
Reverse the words in a sentence.
Print all permutations of a string *using no extra memory\data structures* (pointer variables are ok) + after i solved that it became tougher - handle duplicates (E.g aaab permutation should not print duplicates)
how to reverse words in a string preserving the formatting
Viewing 1081 - 1090 interview questions