Write a small program that checks for matching brackets. For example, the program would return true if it were given "( ( { ( { [ ] } ) } ) )" where all brackets pair correctly as they would in a program, and return false for something like "( ( [ ] )" or "( [ ) ]".
You are given a phone keypad (1-2-3;4-5-6;7-8-9;x-0-x) and a Knight from a game of chess, write a program that given two inputs, (int k, int n) outputs the total number of possible combinations of phone numbers length k that can be generated by moving the Knight starting at the number n.
Data modeling, queries
Given a list of dominoes (represented as tuples), what is the longest row of dominoes that you can place down such that adjacent sides of neighboring dominoes have the same label? An example list of dominoes is [(0,3), (3,1), (2,1), (4,0)] and a valid row would be [(0,3), (3,1), (1,2)],
write an algorithm to determine if an integer given is prime, write an efficient and inefficient implementation of the algorithm.
Random coding questions
How you determine yourself?
Tell me about a time you had to convince someone using data/logic.
Tell me about yourself
Find two integers in an unsorted array that produced a certain sum in linear time.
Viewing 621 - 630 interview questions