Tip 1 : Try to solve coding questions from top platforms and make sure you have a working code with all edge cases covered.
Tip 2 : Try to code on pen and paper as in the interview sometimes you are asked to code on paper and if there are a lot of cancellations it does not turn out well.
Tip 3 : Try to think out loud while solving design problems and even in DSA/problem-solving rounds, take interviews as more like collaborative problem solving and not one-sided monologues
Tip 1 : Try to include verbs like "developed", "designed" and summarise deliverables instead of "analyzed" or "worked on" which are more broad and vague.
Tip 2 : Try to not go too technical into details of projects and just specifically put down your part in the project with the business impact



N = 12, M = 3 and STR = ‘CODINGNINJAS’

There are three rows (‘M = 3’) in the zig-zag pattern. Row one contains ‘CNN’, row two contains ‘OIGIJS’, and row three contains ‘DNA’. After concatenating the three rows, we get the string ‘CNNOIGIJSDNA’. So, the answer is ‘CNNOIGIJSDNA’.
1. The string ‘STR’ consists of capital letters only (i.e., characters from ‘A-Z’).
Step 1: I tried to understand the question with a description and a few test cases
Step 2: I tried to implement the brute force approach
Step 3: The solution was passing for all test cases.



Input: ‘L’ = ‘1’ , 'R' = ‘3’
Output: 1
As ‘1’ is the only Beautiful Number.
3 is not Beautiful as,
3 -> 9
9 -> 81
81 -> 65
65 -> 61 … and so on
It can be shown that we cannot get 1.
Step 1: I tried to understand the question with a description and a few test cases.
Step 2: I tried to think of the brute force approach
Step 3: I checked back the constraints and figured out that brute force won't pass, I tried to optimize for the solution and thought of a few approaches
Step 4: I figured out that the problem can be solved optimally with dynamic programming
Step 5: I implemented the bottom-up approach
Step 6: It was passing in all test cases after some basic debugging.
It was during the afternoon.
Environment was good
The interviewer was very friendly and made me comfortable



The given linked lists may or may not be null.
If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL
The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
This is a standard DSA question solved here as well - https://www.geeksforgeeks.org/merge-two-sorted-linked-lists/



If ‘ARR’ is {1,2,3,4} and ‘K’ = 4, then there exists 2 subsets with sum = 4. These are {1,3} and {4}. Hence, return true.
This is an extension of a standard question which is solved here - https://www.geeksforgeeks.org/subset-sum-problem-dp-25/
Tip: Always start with brute force and then try to optimise, in this case optimal solution is DP, try to explain the states well in dp as coding it will hardly take 5 minutes. focus on clarity of the state in dp questions.
Design a chatbot
Tip 1: When in vague problem statements like design questions set the expectation right in the beginning if the interviewer would like you to focus more on LLD or HLD
Tip 2: When thinking of LLD always think of a neat design and try to avoid redundancy in storage and DB design
Tip 3: Always try to optimize and think things like microservice architecture
1. Describe a project where you had to take the initiative?
2. At PayPal, we are proud of our ability to stay one step ahead of our competitors. How will you contribute to this trend?
3. Tell me what others would say about you.
4. Why do you want to join PayPal?
Tip 1: The single tip for this round is be honest and if you really want to join the company it will be reflected.

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?