Tip 1 : Code Daily one problem on any coding platform.
Tip 2 : Make a good Project for interview
Tip 3 : Focus on Communication Skills
Tip 1 : Make a detailed one-page resume.
Tip 2 : Mention all details of the Project
Timing : Morning 10 AM
Group Discussion having 10 panelist each ( 2 were selected from each panel)
Topic: Will AI Replace Humans or Assist Us?
Timing : 2 PM
Mode : Virtual
What are hooks? (Learn)
Hooks are used to give functional components an access to use the states and are used to manage side-effects in React. They were introduced React 16.8. They let developers use state and other React features without writing a class For example- State of a component It is important to note that hooks are not used inside the classes
What are props in React? (Learn)
This is one of the coolest features of React. We can make components to interact among themselves. We will consider two components Parent and Children to explain this. We will pass some information as props from our Parent component to the Child component. We can pass as many props as we want to a component.
What is database normalization? (Learn)
It is a process of analyzing the given relation schemas based on their functional dependencies and primary keys to achieve the following desirable properties:
1. Minimizing Redundancy
2. Minimizing the Insertion, Deletion, And Update Anomalies Relation schemas that do not meet the properties are decomposed into smaller relation schemas that could meet desirable properties.
This was the last round of the placement journey, and 20 were selected out of 200 for HR round. It was two days after the Technical Interview.
Tell me about yourself.
Why do you want to work for our company?
Why should we hire you?
Tip 1: Prepare well before giving it.
Tip 2: Focus on your resume.
Tip 3: Speak confidently.
DSA Questions



Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
In this approach we will be using two pointers(l and r) along with an iterator(i). The entire array will be divided into three ranges:
Index 0 to l-1 (range containing 0)
Index l to r (range containing unknown elements)
Index r+1 to n (range containing 2)
Initialise l=0 and r=n-1.
Inside a for loop, make sure i<=r and do the following steps:
If the i-th element is 0, swap it with arr[l] and increment l and i.
If the i-th element is 2, swap it with arr[r] and decrement r (not i). The loop will automatically check for the next updated value of arr[i].
If the i-th element is arr[i], simply increment i and continue.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
Initialize three pointers prev as NULL, curr as head, and next as NULL.
Iterate through the linked list. In a loop, do the following:
Before changing the next of curr, store the next node
next = curr -> next
Now update the next pointer of curr to the prev
curr -> next = prev
Update prev as curr and curr as next
prev = curr
curr = next
Describe file systems. (Learn)

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