First is a codility test. then the recruiter called for a skype interview. Then a technical interview with one of the engineers.
Backend Software Interview Questions
15,450 backend software interview questions shared by candidates
Why you are looking for a switch ?
/* * Your previous Plain Text content is preserved below: * * # Step 1 Throughout this interview, we'll pretend we're building a new * analytical database. Don't worry about actually building a database though – * these will all be toy problems. * * Here's how the database works: all records are represented as maps, with * string keys and integer values. The records are contained in an array, in no * particular order. * * To begin with, the database will support just one function: min_by_key. This * function scans the array of records and returns the record that has the * minimum value for a specified key. Records that do not contain the specified * key are considered to have value 0 for the key. Note that keys may map to * negative values! * * Here's an example use case: each of your records contains data about a school * student. You can use min_by_key to answer questions such as "who is the * youngest student?" and "who is the student with the lowest grade-point * average?" * * Implementation notes: You should handle an empty array of records in an * idiomatic way in your language of choice. If several records share the same * minimum value for the chosen key, you may return any of them. * * ### Java function signature: ``` public static Map<String, Integer> * minByKey(String key, List<Map<String, Integer>> records); ``` * * ### Examples (in Python): ``` assert min_by_key("a", [{"a": 1, "b": 2}, {"a": * 2}]) == {"a": 1, "b": 2} assert min_by_key("a", [{"a": 2}, {"a": 1, "b": 2}]) * == {"a": 1, "b": 2} assert min_by_key("b", [{"a": 1, "b": 2}, {"a": 2}]) == * {"a": 2} assert min_by_key("a", [{}]) == {} assert min_by_key("b", [{"a": * -1}, {"b": -1}]) == {"b": -1} ``` */
Build an in memory file system
You have 2 unsorted arrays of integers that only differ by one element. Find that element in the most efficient way.
What are some things to take note of when designing distributed services
Given an array with n integers, check if it could become non-decreasing by removing at most 1 element. Example: Input: [3,2,4,3], Output: false Input:[1, 4, 2, 3], Output: true Input:[4, 3, 2], Output: false Input:[1, 2, 3], Output: true
What’s the difference between java and JavaScript
Do you believe in aliens?
CLI Taschenrechner implementieren mit 4 Grundrechnungsarten, Wurzeln, negativen Zahlen und Klammern
Viewing 21 - 30 interview questions