Tip 1 : Practice Leetcode/coding ninjas as much as possible
Tip 2 : Go through Past Interview Experiences
Tip 3 : Focus on your resume
Tip 1 : Be precise and focus on Quantitative Data
Tip 2 : Mention all the major projects which shows how much you have contributed towards your firm.
1. solved using 4 loops for each direction.
2. optimised using queue
Level order traversal from bottom to top is the traversal from the bottom of the tree and printing the nodes level by level from right to left.
For the given binary tree
The reverse level order traversal will be {7,6,5,4,3,2,1}.
1. solved using recursion
2. Optimised using queue.
Print only those distinct strings that can be formed by removing the minimum number of parentheses.
If the string is already balanced, return the original string.
(()
Expected string is:
[ () ]
Design a data structure that supports insertAtgivenIndex(int index,int value), deleteAtgivenIndex(int index), deleterandom() and getelemntAtIndex(int index) in constant time.
Tip 1: Analyze the CRUD operations complexity of each data structure
Tip 2: Design classes as per the oops concepts
Tip 3: Involve interviewer in the discussion.
Design KYC System where in you will accept all the important documents and register that across all paytm platforms.
Tip 1: Keep in mind the flexibility that we need so that new additions can be done in the future wrt any info.
Tip 2: Design should be loosely coupled.
Tip 3: Get the requirements beforehand.
Design elevator
Tip 1: understand the requirements and ask questions to check what exactly one is looking out for.
Tip 2: Follow the design patterns as much as you can.
Tip 3: Follow the oops concepts
Design API rate limiter
Tip 1: understand the requirements and ask questions to check what exactly one is looking out for.
Tip 2: Follow the design patterns as much as you can.
Tip 3: Follow the oops concepts
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What can be the possible extension for the HTML5 file?