Tip 1: Stay consistent.
Tip 2: Never get disappointed by failures.
Tip 3: Practice at least 200 DSA questions on coding platforms.
Tip 1: Have projects from different domains in your resume.
Tip 2: Have good communication skills.
Coding questions, OOPs, CN



In the given linked list, there is a cycle, hence we return true.

Initialize two pointers at the head. Move the slow pointer one step at a time. Move the fast pointer two steps at a time. If slow equals fast at any point, a cycle is detected. If fast or fast.next is null, there is no cycle.



Input: ‘n’ = 5
Output: 0 1 1 2 3
Explanation: First 5 Fibonacci numbers are: 0, 1, 1, 2, and 3.
You don't need to print anything. Just implement the given function.
Asked about the projects I worked on during my previous internship, my willingness to relocate, and some basic HR questions.
What project did I work on during my last internship?
Tip 1: I gave an overview and explained my role in the project.
Tip 2: Then, I explained the models used.
Tip 3: I described the real-world use cases of the project.

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