I have a list of integers representing the stock prices in each day. Write a function that returns what days to buy the stock and what days to sell the stock to maximize profit. Initially you can only buy, you can choose to not buy any at all. You can only sell after having bought, and can only buy again after having sold. Try to get as close to O(n) time complexity as possible.
To write a class a stack with individual methods representing actions you can perform against the stack
Dealing with collisions in hashmaps.
Reverse a linked list in O(N), the most optimized solution was expected
Remove duplicate entry for a given x from the array in-place and return the length of newly formed such array.
Find the middle of a linked list, I only had to explain the approach for this one hence no coding.
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
problem was regarding strings and words occurrences. it had many follow up where we started building different solution with different data structures
Descripe one time you faced a challenge. Descripe one time you recieved bad feedback.
A DP hard question with a few tweaks, which might've made it a medium question at best
Viewing 2521 - 2530 interview questions