Sollicitatievragen voor Software Developer | Glassdoor.nl

Software Developer sollicitatievragen

179

Sollicitatievragen voor Software developer gedeeld door sollicitanten

Top sollicitatievragen

Sorteren: RelevantiePopulair Datum

Call a function F in a loop. F returns a string of 140 chars. Write to the output 1 when F returns a string with the same letters (basically a permutation) of a string previously returned. (the question was not this well formed)

7 antwoorden

Build an hashmap where for every letter you count how many times it appears in the string, and put it in a set. For every string check if the set contains the built hash. OR sort the string, and put it in a set

I think sorting the word would work much better and is easier to understand

This is called Anagram

Given the following list of objects {user, loginTime, logoutTime}. What is the maximum number of concurrent users logged in at the same time? Input: [ {user: A, login: 1, logout: 3}, {user: B, login: 3, logout: 4}, {user: C, login: 1, logout: 2}, {user: D, login: 123123123, logout: 987987987}, {user: E, login: 1, logout: 3} ] Output: 3

7 antwoorden

We have a log file, can grow pretty big. Each line is a trace-log, and the first field is the RequestID. We need to scan the file, and print all the logs for requests which resulted in error .. 001 BEGIN 001 fetched from db 001 some processing .. 002 BEGIN .. 002 fetched from db 001 returned success 003 BEGIN 001 END 003 some work 002 ERROR 003 some other work

5 antwoorden

Union of n arrays with x elements. Output common members contained in at least 2 arrays. Explain the complexity of the algorithm used. We have a digested server log with username, visited page and timestamp. Create a processing algorithm that will output the most visited page/areas in such a way that will match partial path as well. i.e. { { user: "user1", page="/home" }, { user: "user1", page="/home/account" }, { user: "user1", page="/home/account/profile" }, { user: "user1", page="/home/account/login" }, { user: "user2", page="/about" }, { user: "user2", page="/about/contact" }, { user: "user2", page="/home" } } the output user1 - home/account - home user2 - /about PS I'm rephrasing because I cannot recall exactly the question

5 antwoorden

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

3 antwoorden

One of the questions I could remember and completed successfully. 1. Identify whether there exists a pair of numbers in an array such that their sum is equal to N - My take-away from all this is that HackerRank is a poor indicator of a developer's problem solving capabilities, and like so many of these things is only really good at assessing one thing, namely how good the candidate is at completing HackerRank tests.

2 antwoorden

Given a string of parentheses, check if the parentheses are balanced. Then the question was extended to all types of brackets.

2 antwoorden

Q: Count number of islands in a matrix.

3 antwoorden

How will you implement auto-complete ?

2 antwoorden

- (Phone call coding interview) calculate the complexity of the previous function. They gave me hints and later they considered my answer as weak.

2 antwoorden
110 van 179 Sollicitatievragen

Sollicitatievragen weergeven voor vergelijkbare functies