Tip 1: Solve as many puzzle problems as you can. It will be really helpful for you.
Tip 2: Practice solving DSA problems using any one language.
Tip 1: Put only correct and concise information.
Tip 2: Double-check your resume before the interview.



A certain bug's home is on the x-axis at position x. Help them get there from position 0.
The bug jumps according to the following rules:
It can jump exactly a position forward (to the right).
It can jump exactly two positions backwards (to the left).
It cannot jump backwards twice in a row.
It cannot jump to any forbidden positions.
The bug may jump forward beyond its home but cannot jump to positions numbered with negative integers.
Given an array of integers forbidden, where forbidden[i] means that the bug cannot jump to the position forbidden[i], and integers a, b, and x, return the minimum number of jumps needed for the bug to reach its home. If there is no possible sequence of jumps that lands the bug on position x, return -1.
You are blindfolded and 10 coins are placed in front of you on the table. You can touch the coins but can’t tell which way up they are by feel. You are advised that there are 5 coins head up, and 5 coins tails up but not which ones are which.
I need to make two piles of coins each with the same number of heads up. I can flip the coins any number of times.
A person is working for you, and each day you pay him with a gold bar per day. The gold bar is segmented into 7 pieces. You must give the worker a piece of gold each day after completing the work. What is the number of cuts that you can make to the gold bar to allow you to achieve this?
Condition: here we need to minimize the number of cuts.
Design HLD for Short URL
You start by asking for requirements, and what functionalities it should have.
List down all your functional and non-functional requirements for example function should be highly available and low latency etc.
Here we need to find QPS (Queries per second), memory, and CPU requirements.
Will it be write heavy or read heavy ask that based on that find these metrics.
Which hashing technique you will be using etc.?
mainly we need to draw the HLD for it including databases, cache, Kafka, Flink, load balancers etc.

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