Find intersection of two lists
Intern Software Engineer Interview Questions
9,764 intern software engineer interview questions shared by candidates
What are the core data types.
What have you learned from your education that might be useful for growth of the company?
Tell us about your projects?
Walk me through your resume
Write a function that finds a number in an array that does not have a duplicate. For example [2,5,8,3,8,2,5] - > the answer would be 3.
some medium/hard leetcode questions, the platform they used was codesignal
Let's say a triple (a, b, c) is a zigzag if either a < b > c or a > b < c. Given an array of integers numbers, your task is to check all the triples of its consecutive elements for being a zigzag. More formally, your task is to construct an array of length numbers.length - 2, where the ith element of the output array equals 1 if the triple (numbers[i], numbers[i + 1], numbers[i + 2]) is a zigzag, and 0 otherwise. Example • For numbers = [1, 2, 1, 3, 4], the output should be solution(numbers) = [1, 1, 0]. o (numbers[0], numbers[1], numbers[2]) = (1, 2, 1) is a zigzag, because 1 < 2 > 1; o (numbers[1], numbers[2] , numbers[3]) = (2, 1, 3) is a zigzag, because 2 > 1 < 3; o (numbers[2], numbers[3] , numbers[4]) = (1, 3, 4) is not a zigzag, because 1 < 3 < 4; • For numbers = [1, 2, 3, 4], the output should be solution(numbers) = [0, 0]; Since all the elements of numbers are increasing, there are no zigzags. • For numbers = [1000000000, 1000000000, 1000000000], the output should be solution(numbers) = [0]. Since all the elements of numbers are the same, there are no zigzags.
so tell me about yourself
Nothing difficult. The first question is about combination of HashMap and ArrayList, which the best answer should be LinkedHashMap but it's OK if you didn't know about this class. The second interview is to find the same element in two lists
Viewing 1021 - 1030 interview questions