Tip 1 : Give mock interview atleast once if you are giving for the first time directly.
Tip 2 : Solve Strivers DSA sheet.
Tip 3 : Have a good grip on Core Fundamentals i.e OS, CN, OOPs, DBMS
Tip 1: Be as clear as possible.
Tip 2: Be specific of the tasks you did in internships or personal projects
Tip 3: Don't add technology which you don't know in resume
Tip 4: Don't add unnecessary things like hobby, school grades, etc
My First Interview Round was conducted on Zoom in Morning from 11 AM-12 AM.
I was asked to introduce myself in terms of my technical skills and the technologies that I have used to date. And then he asked me in which language I was comfortable with the most. Told him that I was comfortable in C++ for DSA and JavaScript for Development. He was cool with that. He then asked me some questions related to python.
Questions were like
- What is Exception Handling ?
- Why is it so important?
In my last internship I worked in python I knew Exception Handling and told him about that.
Then he asked me about debugging, How will you do in these situations? and questions about that.
Interviewer was very friendly and was very coopeerative.
The question plot was, there were two tables: Customers and Orders which are linked to each other via a foreign key.
- Get the list of customers who has more than 1 orders.
- Get the top 3 orders in terms of amount.
- Get the list of all unique items.
Tip 1: DO SQL practice.
Tip 2: Solve SQL problems from leetcode, they are pretty enough to crack such interviews



Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
I started with O(N^3) solution.
He later asked me to optimize.
I optimized to O(N^2) and then to O(N).
He was very satisfied with my solution.
Second Technical round was scheduled on the same day in the evening around 5PM-6PM.
This round is purely based on DSA. Started with an introduction and asked me about the projects I worked on and Tech I used in them.
Here also, interviewer was very helpful and coooperative.


For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
1
/ \
2 3
/ \
4 5
Output: 1 3 2 4 5
After around 5 minutes I explained to him my approach, my approach to the problem was recursive. I start with both the possibility from the root node first go to the left direction and then in the right direction.
And in dfs call switch the direction and keep a counter that increments whenever we change direction consecutively. He then asked me to code and I struggled in between while writing code but he was very helpful and helped me in between. He was satisfied with my solution.

Let's say, 'PRICES' = [7, 1, 5, 4, 3, 6]
Purchase stock on day two, where the price is one, and sell it on day three, where the price is five, profit = 5 - 1 = 4.
Purchase stock on day five, where the price is three, and sell it on day six, where the price is six, profit = 6 - 3 = 3.
Total Profit is 4+3 = 7. Hence we return 7.
My first approach was using recursive. Pass one boolean argument in the recursive call 'buy' which will be used to know that on that recursive call we are buying or selling.
(if we are buying then next time we will sell else next time we will buy
-prices[i], because bought stock of prices[i], expend money, !buy because next time sell)
(it's time to sell
+prices[i], because we now gain (i.e) sell our stock at rate of prices[i])
After solving this, he asked me to optmize more in terms of space as this approach was using Auxiliary space.
I later explained to him about the linear solution and how we can make a profit by just seeing if yesterday’s price was low than today’s stock price, by just buying yesterday and selling it today and making a profit. And then I code this logic and he was pretty satisfied with my solution.
What is Polymorphism ? Types of Polymorphism ?
What are Overloading and Overriding? and main difference between them.
What is Abstraction?
Tip 1: Read all typical interview question of core subjects.
Tip 2: Read and implement the algorithms of operating systems
Tip 3: Be ready with real life analogy for OOP's concepts
HR round was scheduled on the other day in the evening around 5PM it lasted for 20 mins only.
He started the interview by taking the introduction of mine and was asked about my previous internship experience and the projects there I worked on, he asked some questions regarding that.
What tech stacks I have used so far and in which domain I am more inclined ?
I told him that I have worked on the Backend and am also inclined to work on the backend side.
And the last question was,
Why Tekion? I answered that pretty well I guess.
Tip 1: Be handy with all the typical HR questions
Tip 2: Don't over exaggerate the things you did in previous internships
Tip 3: Be confident while answering questions. Low tone might end you up rejected.

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