People are really smart and hard-working.
Nothing I can think of.
The HackerRank questions they ask are very similar to their LeetCode tagged questions, but with some modifications. There was one number theory question. Make sure you have a basic understanding of modulo arithmetic.
Phone screen with HR. They ask you about your resume, past project experience, impact, and scope. They will then ask about your interests and intentions. You will also discuss compensation expectations.
Given the start and end days of availability for different customers, find the maximum number of customers the seller can meet with, at most one customer per day. For example: start days = [1, 10, 11] end days = [11, 10, 11] The answer is 3. Expla
The HackerRank questions they ask are very similar to their LeetCode tagged questions, but with some modifications. There was one number theory question. Make sure you have a basic understanding of modulo arithmetic.
Phone screen with HR. They ask you about your resume, past project experience, impact, and scope. They will then ask about your interests and intentions. You will also discuss compensation expectations.
Given the start and end days of availability for different customers, find the maximum number of customers the seller can meet with, at most one customer per day. For example: start days = [1, 10, 11] end days = [11, 10, 11] The answer is 3. Expla