This time it was a tough question about writing a program where given a sorted array, repetitions allowed, and given an integer, I had to return the start index and end index of that integer in the array. I chose the Binary Search approach but some modifications had to be made to make it optimistic in run-time.
String manipulation and graph theory questions
Generate all possible lock combinations on an android lock screen of length 5 such that each numbers are adjacent to each other and no repetitions within a combination.
Questions were Leetcode medium(hackerrank) to hard problems(Telephonic).
Train a Markov chain to generate sentences
Was a simple card game question with some specific rules.
API Calls and OOP Design
for phone interview, the question is: given an array of integer sorted in order of ascending, find the missing number in that array. For example, the given array is [0,1,3,4], [1,2,3,4], [0,2,3,4], so there's always a missing number in that array and you have to find that one.
I think LC medium-ish quesetions.
Algorithm question related to trees and json data structures.
Viewing 201 - 210 interview questions