Tip 1: Practice at least 250 questions
Tip 2: Do at least 2 projects
Tip 3: Have a strong hold on the computer fundamentals like OOPs, OS, DBMS, and CN
Tip 1: Have some projects on resume.
Tip 2: Do not put false things on resume.
Timing- In the morning from 10 AM
For the query of type 1, you can assume that the array has at least k values. And at any time, the product of any contiguous sequence of numbers will fit into a single 32-bit integer without overflowing.
I applied the brute force approach to store the infinite stream in a vector of infinite size and then perform the following operation. The interviewer asked me to optimise the solution. Then I gave the solution using a queue.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?