Having milions of points with coordinates (x,y), how would you find points that are at distance at most d from the point given X, Y for every query?
Software Engineer Intern Interview Questions
9,765 software engineer intern interview questions shared by candidates
how to check if a string of difeerent parantheses is valid or not
did you have any problem where you were not able to complete the task and how did you take it
Interview 1: Given the following rules of python, write a compiler for it. 1st line has no margin on the left. Each subsequent line has margin which is greater than or equal to the margin of any of the lines above it(as in python). Each line which ends with a ‘:’ should have next line with alignment > the previous line (like function definition in python). Report erroneous line number if any of this is violated.
Interview 2: You have a string of words and 2 given words. Find the shortest substring that has both the words. Print 6 preceding words before the first word and 6 succeeding words after the last word in the original string. Ex. if the words are a & b, then the substring to be printed should be. word1 word2 … word 6 a …. b word7 word 8 … word 12 He later asked me to extend it if we have 3 words a,b and c. And the substring should contain all the words.
"Given an array of integers, return the indices of the two numbers that add up to a specific target." Example: Input: nums = [2, 7, 11, 15], target = 9 Output: [0, 1] Explanation: nums[0] + nums[1] = 2 + 7 = 9
DSA question: given an integer n, we have to print all possible valid parenthesis strings of length 2n.
Merge two sorted arrays with O(1) extra space
Given an array of n elements. Return the sum of min and max of all the subarrays.
Was mostly asked OOP questions
Viewing 1401 - 1410 interview questions