The two coding problems are not hard at all. Both are can be solved with binary search, it's a bit redundant.
Software Developer Intern Interview Questions
2,851 software developer intern interview questions shared by candidates
Design a data structure that has constant time pop, push, and constant minimum value of data currently in structure.
1st interview: Implement the algorithm for playing minesweeper. 2nd interview: Implement a^n in log(n) time both recursively and iteratively
Create an algorithm to find the length of a binary tree.
It was essentially a more difficult version of the "fizz buzz" question. No algorithms or data structures were involved, only if-else logic.
In general the OA questions were pretty manageable (probably leetcode medium at worst), and I got a pretty easy question about binary trees during the phone interview.
Finding the total number of possible sub-arrays from an array, given an Integer that must be the maximum number of odd numbers within each sub-array.
How to reverse a linked list?
I was asked system design type questions
Q1: Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time. Q2: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amount of water a container can store.
Viewing 2771 - 2780 interview questions