Q1:
You are given a list of points in a 2d plane. Points are all placed in (0, 0) - (1, 1) sqaure.
Return the id of smallest possible squre that all points fit into.
Square ids can be indefintelly shrinked in such a way:
List of points can looks something like this: [[0.312, 0.1][0.410, 0.198][0.289, 0.03][0.11, 0.2]]
Q2:
Cord Tree representation
There are internal nodes that contain length and left and right nodes
There are leafs that contains data and len of this data
(Left values are before right values)
[Root(len = 15)
[Root.left(5, ABCDE)]
[Root.right(len = 10)
[right.left(4, EFGH)]
[right.right(6, IJKLMN)]
]
]
a) Design a structure of this tree (how would node impl look like?)
b) Using your structure, find Character at index N in tree cord.
N = 3, result = D | N = 11 result = K
c) Using your structure, find String of length L starting at index NQ3:
You are given a non overlapping list of intervals that employees work during the year.
It's hourly based so there are up to 24*365 working hours in a year.
You can hire up to K contractors and each one of them can work for Q hours. Contractor work can overlap with each other and with employees.
Return the smallest possible not covered time in a year, using minumum number of contractors.
Example:
Intervals: [[100-1000], [2000-3000]]
K: 1
Q: 4000
ans: [2100, 1], our best bet is to hire the contractor anywhere from 3000 to 4760 so he covers as much not overlapping time as possible. And we are using one contractor
Q4:
You are writing an internet server for a version of Battleship game. The game is played on a fixed grid 10 x 10, where a
player places game pieces called "ships". Ships are rectangles 1 x N with fixed counts of expected ships of each size N.
Player arranges them arbitrarily, some horizontal and some vertical. Ships are not allowed to touch each other, either
by sides or corners - there should be at least one empty space between them (note that this is different from popular
rules of this game where ships can touch).
Players submit initial board position to your server. We don't trust client, it can be modified to win games unfairly or
to hack into our server. We need to validate whether the submitted board is correct.
public record Ship(Integer x, Integer y, Boolean isHorizontal, Integer length) {}
As an input we are getting a list of ships.
Followups: What if we have constrains about how many ships of given len should be on board?
Followups: What if board size can be changed?
Result: Reject
I have done over 350 questions on leetcode. From the questions above, what i did on an acctuall interview:
1st question solved fully with optimazation
2nd question didn't finished coding 'c' followup but told how i would do that
3rd question - this i found insanlly hard for a 45min interview, after long think i coded a solution for 1 contractor with n^2 time, then optimized for O(n)
4th question solved fully to the point when interviewer told me that he doesen't have any more questions.
The behavioral round went really good.
I guess 2nd and 3rd interviews not going as good as other ones have been decisive. I haven't got any feedback about it.
Overall my expirience is mixed, some of the interviewers were giving the impression of beeing bored to even talk to me. Like I'm trying to understand the question and explain my solution to them and i see that they are looking out of the window and not even listening.
Reject after so much grind is paintfull, honestlly i feel like you need to be lucky to get just the right questions and interviewers to pass.
Something about me:
YOE - about 4
working as SWE in other top tier tech company.
PS: I didn't apply, google recruiter have reach out to me.