Round 1: You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Strong core Technical Questions
various questions based on technical aspects of voice infrastructure and PBX
What was your worst course in college?
What is your salary expectation and your current salary?
Link List, Binary, Problem Solving, Data Structure, Pointers were some of the questions
Data structures and algorithm based questions
Leetcode Easy, Linux Commands, System Design Concepts, Behavioral
1)How do u find the Circles in a graph. Write the algorithm on the board.. 2) Implement a Queue using Stacks 3) Reverse a linked list in a optimized algorithm
Describe a problem that you solved.
Viewing 61 - 70 interview questions