In the technical interview they asked about solving a problem where you get 2 arrays, one for integer numbers where the numbers in it can repeat themselves called "nums", and one for integer numbers as well called "data". You are asked to compute how many each number from nums show up in total in data and return the total sum of numbers from nums. Numbers can show multiple times in nums and in data as well and you need to take repeats into account.
Tell me about a project you feel comfortable talking about
We were given a medium sized, badly defined, exercise to do and submit.
What is your tech stack
Explain how does http work?
coding problems similar to leetcode medium-hard
You're given N sorted arrays, each of them with length of O(k). Implement an algorithm to return one long sorted array, when k >> N
Implement reverse linked list. Implement bubble sort
regex based question and heap based one
2 questions on the Hackerrank website.
Viewing 601 - 610 interview questions