Given a sorted array of integers in increasing order (can contain duplicates), return the last index of a specified target integer, or return -1 otherwise. Thus 1, 2, 2, 3, 4 and the target is 2, the function should return 2.
Development Interview Questions
137,325 development interview questions shared by candidates
1. Find the minimum number of train stations required given a list of departure and arrival times. 2. The online screens had a couple of SAT style questions and some debugging questions.
What algorithm would you use to search a sorted list? What is the complexity of the algorithm? Implement the algorithm in your language of choice.
The input to a function is an array of n elements.Output of that function is also an array where each element is product of all elements in the input array except the one with same index. Input ::::: 1 2 3 4 Output ::::: 2*3*4 1*3*4 1*2*4 1*2*3
Hasp map concepts theory questions coding question : Program to check if binary tree is a BST Complexity of the module written
Create a Queue using two Stacks.
Give you an array of integers without duplication. Let you write a piece of code to return the pairs that their sum is 100.
Given an array of integers and k, print all the pairs of numbers (a,b), both of them inside the array, such that a+b=k
Most efficient algorithm for sorting infinitely long array
Questions related to stacks, queues (Eg:Implement a queue using stacks) Trees were heavily asked as well (Print a tree spirally, check if one BT is a mirror of another BT)
Viewing 1241 - 1250 interview questions