Write a function to tell if two line segments intersect or not.
Software Developer Co Op Interview Questions
710,400 software developer co op interview questions shared by candidates
Given a sequence of numbers (34128) and an input map such as a dial pad on a phone (2->[a,b,c], 3->[d,e,f], 4->[g,h,i]) write an algorithm to return all possible words from the sequence. E.g. Input: 232 Output: [ada, adb, adc, aea, aeb, aec, afa, afb, afc, bda, bdb, bdc, bea, beb, bec, bfa, bfb, bfc, cda, cdb, cdc, cea, ceb, cec, cfa, cfb, cfc]
+-----------+ | 1 | 2 | 3 | +-----------+ | 4 | 5 | 6 | +-----------+ | 7 | 8 | 9 | +-----------+ | * | 0 | # | +-----------+ +---+ | U | +---+ +---+ +---+ +---+ | L | | S | | R | +---+ +---+ +---+ +---+ | D | +—+ Input String: "180*", output is the number of minimum operations needed to dial the input */ 2)How do you test login page?
Find if a word is anagram (e.g. ana is an anagram).
how many scale measurements does it take to know which ball out of 8 balls weighs more? Then how many does 28 balls take?
My strengths and weaknesses
Implement a class that can calculate the running average of a stream of input numbers up to a maximum of N numbers.
First, a mathematic question, asking about a card game with how many possible way for the combination based on the rules it given. Second, let you to print out all the combination of 3 digit numbers with no duplicate, ex. 012, 013, ....123, 124, 125...
Intersection of n sets without using a hash table.
Get numeric number out of a roman string, linear time Given: mapping I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1000 Input/Output: II = 2, III = 3, IV = 4 VI, VII, VIII IX = 9 XL = 40, XLIX = 49
Viewing 201 - 210 interview questions