Signed a non-disclosure agreement so can't give exact questions. Though they're pretty standard interview questions based on Data Structures, String manipulations etc. My best advice would be think about what you would like to ask the interviewer. I totally forgot to prepare questions and I felt like they were waiting for me to ask them something.
explain binary search, running time, when is it advantageous
find the smallest node in BST that falls into a given range find intersections of two arrays
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.
write an algorithm to determine if an integer given is prime, write an efficient and inefficient implementation of the algorithm.
Describe the project on your resume
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)],
Java, Frameworks, Agile, CI, CD, Code Review, Tools, version control, behavioural questions, managerial questions
Viewing 561 - 570 interview questions