Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit. Note that you cannot sell a stock before you buy one.
How to find maximum number in BST
Q: Given a list of bus schedules, find the minimum bus stop required in a bus station. A bus station can have more than one stops. A bus requires one stop.
Q: How would you choose between Java / NodeJS?
On singleton pattern, and linked list
find the optimised algorithm for mapping.
Describe Java
You have a grid of 10 rows and 10 columns. Write a program to count how many squares there are. (it is not 100, there is the giant 1 square, a 1x1 square, 2x2, 3x3...etc from the left corner, but your points can start from the middle, or any other positions in the 10x10 square)
what is public and static modifier in Java?
Will you be able to work up to 14 h a day if got selected as the work is given foremost importance in the company?
Viewing 1881 - 1890 interview questions