Tip 1: Practice DSA as much as you can. Watch videos and code the problems simultaneously.
Tip 2: Make a proper roadmap for your placement preparation. Don’t just start with anything and then switch to something else.
Tip 3: Be consistent and work on improving your interpersonal skills as well.
Tip 1: Apart from web development projects, include ML-related work in your resume as well.
Tip 2: Be confident about whatever you include in your resume.



You can’t sell without buying first.
For the given array [ 2, 100, 150, 120],
The maximum profit can be achieved by buying the stock at minute 0 when its price is Rs. 2 and selling it at minute 2 when its price is Rs. 150.
So, the output will be 148.



An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.
For e.g.- The non-empty subarrays of an array [1,2,3] will be- [1],[2],[3],[1,2],[2,3],[1,2,3].
If arr = {-3,4,5}.
All the possible non-empty contiguous subarrays of “arr” are {-3}, {4}, {5}, {-3,4}, {4,5} and {-3,4,5}.
The product of these subarrays are -3, 4, 5, -12, 20 and -60 respectively.
The maximum product is 20. Hence, the answer is 20.
Can you solve this in linear time and constant space complexity?
My hackathon use case was that we were given datasets for three countries in their regional languages. The data consisted of client addresses in an unstructured format, and the task was to convert this data into a structured format and then create a website for it, including the CRUD API.
We had to present the solution we created in 24 hours to the jury, and they evaluated it on an individual basis. The topic of the presentation was the solution we devised for the problem of unstructured address data.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?