Interview Question – two algorithm questions each phone interview. Two of them were a bit challenging . One of them was : given a value k and an array , design an efficient algorithm that should output the number of pairs that sum up to k. They wanted a n log n solution, wich i provided, but I wasn't handy with the implementation. We spent several minutes with questions like why would you want to work for us? or how did you heard and what you know about us ?
What is the computational speed of looking something up in a hash table?
Given a binary matrix (0's and 1's), how many groups of connected 1's are there?
How immediately you can join
Goldman Sachs conducted a Hackerrank test which had coding question (3) and mcqs for the initial interview selection. The questions were of high difficulty level.
Write a function that takes in an array of strings and outputs a dictionary with the first character of each string as the key and the remaining characters as the object.
how to find square root of integer
From which maximum floor can you throw an egg without breaking it?
Difference between Heap and Stack
What is the best way to store an array?
Viewing 2171 - 2180 interview questions