Tip 1 : Focus on DSA-PRACTICE
Tip 2 : Prepare CS fundamentals
Tip 3 : Do atleast two development or ML projects
Tip 1 : Try to follow a basic format and highlight important achievements
Tip 2 : Mention atleast two good projects
Timing was 7-9 pm
Environment was good



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].
To solve this I applied kadane's algorithm, where you keep two variables to store, stores the maximum sum contiguous subarray ending at current index and a variable stores the full sum of contiguous subarray found so far.



Input: 'n' = 5, 'arr' = [1, 2, 3, 4, 5]
Output: 5
Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5.
Run a loop through the array to find the largest number.



You do not need to print anything, it has already been taken care of. Just implement the given function.
Let ‘NUM1’ be: “5”
Let ‘NUM2’ be: “21”
The sum of both numbers will be: “26”.
Reverse the strings, keep adding digits one by one and also keep track of carry. At last reverse resultant string.
Timing was 10 am.
Environment was good.
Interviewer was very friendly.



If the given grid is this:
[7, 19, 3]
[4, 21, 0]
Then the modified grid will be:
[7, 19, 0]
[0, 0, 0]
In this first approach, I told to store which column and rows has zeroes in a separate matrix and then run a loop again , and make row and column zero containing zeroes. Interviewer asked me to optimize this by reducing the space complexity. So following approach I gave was that we can store zero at 0th index of every column and row if any zeroes exist in that column or row.
What are OOPS pillars?
What is the difference in encapsulation and abstraction?
How do you apply abstraction with an example and code?
Some more problems from abstraction in deep.
Tip 1 : Read OOPS concepts very thoroughly
Tip 2 : Focus on abstraction pillar more.
Where do we use DBMS?
What are ACID properties?
Some SQL queries
Tip 1 : Read DBMS thoroughly
Tip 2 : Practice SQL queries
Tip 3 : If you know MySQL, its a plus point.



First approach is to run loops to sort. Then he asked me to optimize it. So i applied priority queue to reduce time complexity.
Timing was 12 pm
Environment was good
Interviewer was friendly.
Introduce yourself.
Why do you want to join this company?
Where do you see yourself in 5 years?
What are your expectations from company?
Tip 1 : Read about company in detail
Tip 2 : Know about your role very well
Tip 3 : Ask some questions from your side as well.

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