Given an array of times (hh:mm) ranging from 00:00 to 24:00 (inclusive), calculate the smallest number of minutes between any two times. Includes wrap-around (ie. 23:20 and 00:10 would be a 00:50 interval)
Forward Deployed Engineer Interview Questions
687 forward deployed engineer interview questions shared by candidates
Given a time series data. How will you check if time when maximum users have logged in?
Determine whether a crossword (a grid of 0s and 1s) is valid - i.e. all 1s are reachable from other 1s.
You have two arrays with numbers in them. You have to stop the program once you've found the largest difference between one number in the 1st array and one number in the 2nd array. You do not have to return the numbers, just stop once you've found it.
You have to detect input from keyboard, and detect whether the words are in the same row in the keyboard. For example, "asdf" will return YES, and "asde" will return NO. Write a code to solve this and what's the application to this? What if the input are of different language?
Standard interview questions; standard HackerRank Assessment
The following question was the programming question during the second phone interview. The coding portion was conducted using Stypi (similar to Google Docs). I was allowed to use my language of choice (Python) rather than being forced to use Java. I was asked to write a routine to verify that all the words in the solution of a crossword puzzle were valid words. The crossword puzzle was represented as a two-dimensional array of single-character strings (and empty strings for the empty blocks). While this question is pretty straightforward, but there is a "better" solution than others which seemed to pique the interest of the interviewer—see the answer section for details. It is also worth pointing out that I later found that certain technical details of my solution were incorrect, but either the interviewer didn't notice or didn't care. I think the question was intended more to see how I work.
Given an nxn matrix of 1's and 0's, figure out if all of the 1's are connected.
Given an array/list that contains boolean values for a system being in a failed state, figure out the fastest way to find the index of the first version that failed given that once the system fails it remains in the failed state. For e.g. given a list like [False, False, False, False, ...., False, True, True, True, True, True], write an algorithm that finds the index of the FIRST occurrence of 'True' in the FASTEST time.
Design a stack system interpreter for a list of instructions. Possible operations: - push (x - print - add (with last 2 in stack) - sub (with last 2 in stack) ...
Viewing 21 - 30 interview questions