Given an array n integers and an integer x, provide an algorithm that determines if a pair of integers in the array sum to x.
Internship Software Engineer Interview Questions
23,657 internship software engineer interview questions shared by candidates
Algo & DS type questions
If given a glass with 3 cups of water and another with 5 cups of water, how do you get 15 cups?
Why Epic
Tell us about a project you've worked on.
One of the final interviews was with a developer where I was asked to describe a project.
Verify palindrome
The fourth and hardest coding question: "Given a square grid of numbers, print out the longest 'snake sequence'. A snake sequence is a sequence of adjacent (not diagonal) numbers such that each number is within +-1 of its neighbors in the sequence. Snake sequences can only go down and right. If there are multiple snake sequences of largest length, print out them all." Third question: "You are given a sequence of numbers like 1234. You know that each number can map to a certain amount of keys; for example, 2 can map to [w,s,x], and 3 can map to [e,d,c]. Print out every possible sequence of characters that the sequence of numbers might correspond to." Don't remember the second question. First question: "Someone is entering a code on a keypad, but (at most) one of the keys is intermittently faulty. Therefore, there is some lenience about what code is entered. If a number is missing in the input, the keypad still accepts it, provided that all other numbers are present and in their proper place. If the passcode is 11223311, then valid inputs would include 1223311, 2233, 112211, and 11223311, but not 112311."
Given a Boolean 2D array representing a board with Red pieces vs. Black pieces, determine the 'winner' of the game based on the pieces on the board. 3 pieces in a row horizontally, vertically, or diagonally equates to 1 point (therefore 4 pieces in a row is 2 points, 5 is 3 points, etc.).
NDA
Viewing 1231 - 1240 interview questions