Given an array of cartesian points to large to fit in memory, find the k nearest to the origin.
Internship Engineer Interview Questions
24,416 internship engineer interview questions shared by candidates
Two coding question in the leetcode style. One is binary search, another is disjoint set.
Given array of points find the K closest to the origin
Given a sorted array and integer K find the number of occurrences of K, and there was a follow up question what will happen if there is m queries with different K how can you handle this, but didn't ask for the code for the follow up
Check for balanced parentheses in an expression.
Describe one of my projects on the resume, solve a coding problem
Under Confidentiality contract
Implement the sqrt() function.
Question 91 on LeetCode (Decode Ways)
first round: Set Matrix Zeroes from leetcode second round: Max Consecutive Ones III from leetcode
Viewing 1931 - 1940 interview questions