Ist ein 2D-Feld gegeben, das ein Feld beschreibt (0 = Wasser, 1 = Land), schreiben Sie einen Algorithmus, der die Anzahl der Inseln zählt (zwei Stücke Land berühren sich, wenn sie entweder vertikal oder horizontal nebeneinander liegen, nicht diagonal).
Define binary search tree. Develop a procedure to verify a binary search tree.
There were 2 questions: 1 design and 1 implementation. The design was something like the following: you have a billion google searches a day, design a data structure which lets you pull out the top 100 unique ones at the end of the day.
Wie würden Sie eine Reihung von einer Million Zahlen sortieren?
1. mutable, non mutable classes in Java 2. declaring constants in Java 3. x^y algorithm and its optimization. 4. second largest number from Binary Tree
Find the number of ways to get from one corner of a grid to the opposite corner, by going down or right only.
Check if a string is balanced
Grid Illumination: Given an NxN grid with an array of lamp coordinates. Each lamp provides illumination to every square on their x axis, every square on their y axis, and every square that lies in their diagonal (think of a Queen in chess). Given an array of query coordinates, determine whether that point is illuminated or not. The catch is when checking a query all lamps adjacent to, or on, that query get turned off. The ranges for the variables/arrays were about: 10^3 < N < 10^9, 10^3 < lamps < 10^9, 10^3 < queries < 10^9.
Given a 1TB file of serialized 4 byte integers, and 2GB of ram, sort the integers into a resulting 1TB file. My interviewer was very collaborative in entertaining various solution ideas until we came up with a combo that would work performantly and reduce the number of passes over the 1TB file and intermediate files.
Implement the div operator without using / or %
Viewing 491 - 500 interview questions