Showed a struct definition in C and asked its size?
Entwickler Interview Questions
467,504 entwickler interview questions shared by candidates
Explain the graphics pipeline in a GPU core.
What is the difference between a class, an abstract class, and an interface?
Waiting for the result of online test.
How would you reverse a singly-linked list?
how would you detect a cycle in a DAG.
It was a puzzle Two people, let "A" and "B" are talking. "C" tries to listen to them. "A' says to "B", I have 3 daughters, the product of their age is 72. Can you tell their age? "B", says "NO". "A" again said to B about some of his daughter's age. "C" could not hear the sum. A asked to B Can you tell their age now. "B" again said NO. They "A" says my eldest daughter's age is equal to my house's street number. B immediately answered A about the age. What was their ages?
Implement a function all_anagram_groups() that, given many input strings, will identify and group words that are anagrams of each other. An anagram is word that is just a re-arrangement of the characters of another word, like "reap" and "pear" and "a per" (whitespace is ignored). But "pear" and "rep" are not, since "rep" does not have an "a". Also, "the" and "thee" are not anagrams, because "the" only has one "e". Given this example input: [ "pear","dirty room","amleth","reap","tinsel","hamlet","dormitory","listen","silent" ] The output should be an array-of-arrays (or list-of-lists) [ ["pear","reap"], ["dirty room","dormitory"], ["amleth","hamlet"], ["tinsel","listen","silent"] ]
Implement a function nondecreasing_subsequences() that, given a sequence of numbers such as: [ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ] ... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists) [ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ] (Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see: http://en.wikipedia.org/wiki/File:Monotonicity_example1.png
1. Started with a HackerRank - session 5 questions - 90 mins, not very hard After that 6 rounds of interview: 2. HR round - to understand interest level, work experience and knowledge about Booking.com 3. Technical round - pair programming on a shared code-collaborator environment, 2 programming questions (basic array and hash questions) Invited to Amsterdam - for face to face interview 4. HR round - for answering any questions, salary discussions etc. 5. Technical round - design graphite from scratch, evolved designed system to handle scaling scenarios 6. Technical round - 2 problems - a. retweet twitter tweets if newer one is an anagram of older one, b. 20 boxes - 500 GB log files on each - no processing box on server file, aggregate data on one box and parse for phone numbers - bookings. Efficiently. 7. Technical and Culture fit round: Discussed various scenarios encountered during work and how will be your behavior on them 8. HR round - offer ! - Offer very low pay, considering high cost of living NL - Amsterdam declined the offer
Viewing 2211 - 2220 interview questions