Coding: Create a stack with the usual push() & pop(), but with an additional function getMiddle() that returns the middle element of the stack in constant time.
Sr Software Engineer Interview Questions
67,191 sr software engineer interview questions shared by candidates
find a number in a sorted array and then find the number in an unsorted array ?They will unsort the array on their own .
Interview 1: - Abstract classes over interfaces. Why we use interfaces over abstract classes. - Given a sentence with each letter as a node of the linkedlist. Reverse the order of the words (not the word itself). "My name is Batman" -> "Batman is name my" - Zigzag level traversal of a tree.
Finding out the area of the intersection of two rectangles
on a grid find the minimal meeting point for different people.
1. How to encrypt a set of string e.g. WAAAYYFFFFFAIIIRR to W1A3Y2F4A1I3R2 etc... And how to decrypt it back to original string (2 separate functions) 2. How to design a system so that user can check in their location thru their phone, and how to scale it when the app gets popular and millions of users are using it. How would you expand the application features when popularity grows. 3. How to design a database of Warehouse, Suppliers and Customers and they ask you to write various SQL queries to pull products sold, how many customers bought more than 30 products etc 4. A coding problem to simulate the coin game and gambler's fallacy (if they are 4 Heads in a row, gambler would bet on Tail, and vice versa).
Implement a class called AirMap that has two methods: 1. add_route(start, destination) - adds ONE WAY connecting flight from one airport to another 2. print_all_routes(start, destination) - prints all possible routes from start to destination Given the following routes, print all possible routes between the airport C and D: A -----> B B -----> A A -----> C C -----> A A -----> D D -----> A B -----> C C -----> B B -----> D D -----> B Expected Output: C,A,B,D C,A,D C,B,A,D C,B,D
Create a class implementing iterator interface to go through AVL tree.
Simple OOPs question, a BFS problem, elementary number theory problem
Given an array of integers, find the maximum number that can be reached by summing the best possible consecutive subsequence of the array.
Viewing 141 - 150 interview questions