Regularly engage in competitive programming practice.
Explore the experiences of individuals who have gone through interviews.
Seek advice and insights from senior employees working in that particular organization
Tip 1: Seek a professional review for your work.
Tip 2: Include only the information you are knowledgeable about.
This round was conducted on a coding platform in the afternoon. It comprised 12 questions, out of which 10 were multiple choice while 2 were coding questions. It was of medium level, you can easily crack it if you have basic knowledge of Linux and programming.
Step 1: Upon reading the problem, I recognized it as a fundamental dynamic programming problem.
Step 2: I created a 2D array called dp and utilized loops to populate it with the necessary values.
Step 3: The function returns the value at the dp array's bottom-right index.
If the given linked list is 1 -> 2 -> 3 -> 4 -> 5 -> NULL.
Then rearrange it into 1 -> 5 -> 2 -> 4 -> 3 -> NULL.
Step 1: Begin traversing the linked list starting from the head node.
Step 2: Remove nodes at odd indexes, which means deleting every node occurring at index 1, 3, 5, and so on, while storing them separately in a new linked list.
Step 3: We now have two linked lists: one containing nodes with even indexes (head1) and the other containing nodes with odd indexes (head2).
Step 4: Locate the tail of head1 and set its "next" pointer to head2.
Step 5: The two linked lists are now merged, and we can return them as the output.
Assume that the Indexing for the linked list starts from 0.
Input: ‘N’ = 5, 'LIST' = [1, 1, 2, 3, 4, -1], ‘POS’ = 1.
Output: 1 < - > 2 < - > 3 < - > 4
Here in the given list, we can see that the node at position 1 is deleted.
This problem required the concept of a self-balancing tree.
Compose a query to retrieve the student with the second-highest marks from the table.
Employ the fundamental approach by first identifying the highest marks and then utilizing a nested query to locate the second-highest marks that are not equal to the highest. This method will yield the second-highest marks.
For further understanding, consider watching SQL tutorials on Gate Smashers videos.
Describe your projects, including the use case, tech stack, and your contributions to each project.
Besides academics, what activities have you engaged in during college? (TPC and SCOPE courses mentioned)
Could you explain why your Final year project isn't listed on your resume?
Subsequently, he inquired about Inheritance and its feasibility in Python.
Outline the disparities between HTML and HTML5.
Define TypeScript.
Enumerate various data types in JavaScript.
Develop a scalable online food delivery system akin to Uber Eats or DoorDash platforms. The system must facilitate user interactions such as restaurant browsing, order placement, delivery tracking, and payment processing. Consider crucial elements, including user interfaces, database design, order management, and delivery logistics.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?