Tip 1: Focus on understanding the basics of any topic before jumping to the advanced level.
Tip 2: Spend more time thinking about the approach to a problem before jumping to the solution.
Tip 3: Consistency is key.
Tip 1: Make sure it's a one-pager with all the important things highlighted.
Tip 2: You should have in-depth knowledge of all the projects you mention in your resume.
This round was based entirely on Data structure and algorithm along with OOPS.



You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the step with index 0, or the step with index 1. Return the minimum cost to reach the top of the floor.
I used DP to solve this problem.
Just found the minimum cost to reach the ith stair stored it in the dp array and used it to find the same for the n-1th index.



You are given the root of a binary tree containing digits from 0 to 9 only.
Each root-to-leaf path in the tree represents a number.
For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123.
Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer.
A leaf node is a node with no children.
The intuition behind this solution was to perform a level-order traversal of the binary tree using a queue. While traversing the tree level by level, we keep track of the current sum along the path from the root to each node. When we encounter a leaf node, we add its corresponding sum to the total sum of all root-to-leaf numbers.
I was asked OOPS concept in depth with implementation, was asked to implement polymorphism, friend function and inheritance
Tip 1: A basic understanding of OOPS helped me to solve this question and answer any cross-questions.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?