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
How you determine yourself?
Random coding questions
Algorithm questions. Get prepared with Tree, graph, array related ds
We treat the interviewing process like "dating" You get to meet each other and see if there is any chemistry. Don't you agree with this?
Viewing 621 - 630 interview questions