Tip 1 : I Practiced mainly on Leetcode Daily and did around 2-3 Problems per day.
Tip 2 : Used GeeksForGeeks wherever I got struck and It also helped in strengthening my bacis.
Tip 3 : Build Projects based on your expertise and focus on any one language rather than focusing on a bunch of them.
Tip 1 : Build one page resume's. Many companies prefer one page resume rather than 2 or 3.
Tip 2 : Build as much project as you can and put only those things in resume that you are fully confident of.
Due to the COVID-19 Pandemic, Online Round was Conducted Virtually . It was scheduled in day time around 9 am and was about 3hrs long until 12 pm. It consisted of around 90 mcq and 2 coding questions. MCQ ( Multiple Choice Questions) were mainly on Verbal Ability,Reasoning Ability,Numerical Ability,Programming Logic. The level of questions were medium and each qustion was timer based. We cannot navigate back to previous questions.



'arr '= [1,2,3,4,5]
'k' = 1 rotated array = [2,3,4,5,1]
'k' = 2 rotated array = [3,4,5,1,2]
'k' = 3 rotated array = [4,5,1,2,3] and so on.
Approach:
Step 1 : We will first take mod of K by N (K = K % N) because after every N rotation array will become the same as the initial array.
Step 2 :Now, we will iterate the array from i = 0 to i = N-1 and check,
If i < K, Print rightmost Kth element (a[N + i -K]). Otherwise,
Step 3 :Print array after ‘K’ elements (a[i – K]).
A thief, jack Sparrow plans to escape from jail. He , being a monkey man, can jump over a wall. jack has practiced well and succeeds in jumping X meters. However, the wall is slippery, so he slides down Y meters after every jump. To escape from jail, he must cross N number of walls, where the height of each wall is given in an array. Your task is to return the total number of jumps Jack needs to make to escape from the jail.
Steps:
Step 1: First we want to declare a variable jump that tells about the number of jumps needed.
Step 2 : Accordingly, while the reach that is intialized to X meters is less than height of the wall then in that case we add the left out portion that is X-Y due to slipping and add it to the reach.
Step 3: Incremented the jump variable that is intialized to 1 everytime we follow in the for loop and at last adds up to our variable jumps.
Step 4: Finally we return the total number of jumps needed.
def calculateTime(X, Y, n, walls):
jumps = 0
for i in range(0, n):
reach = X
jump = 1
while reach < walls[i]:
reach += (X-Y)
jump += 1
jumps += jump
return jumps;
X = int(input())
Y = int(input())
n = int(input())
walls = list(map(int, input().split(" ")))
print(calculateTime(X, Y, n, walls))
This round waas mainly the technical Round. It lasted around 45-50 mins. First the Interviewer asked to introduce myself and then he asked about my minor project and all the questions related to my project. Then he asked me to code the fibonacci series and told me to optimize the given solution using two variables instead of three. He told me to write the code in notepad and asked me to share my screen. He then asked me about OOP's and gave a few questions to solve that were based on OOPS. After that he looked satisfied and asked me some managerial questions. After that he told me that I cleared this round and wait for document Verification by HR.



F(n) = F(n-1) + F(n-2),
Where, F(1) = F(2) = 1.
For ‘N’ = 5, the output will be 5.
In fibonacci series, next number is the sum of previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. The first two numbers of fibonacci series are 0 and 1.
Using Recursion: Since Fibonacci Number is the summation of the two previous numbers. We can use recursion as per the following condition:
Get the number whose Fibonacci series needs to be calculated.
Recursively iterate from value N to 1:
Base case: If the value called recursively is less than 1, the return 1 the function.
Recursive call: If the base case is not met, then recursively call for previous two value as:
recursive_function(N – 1) + recursive_function(N – 2);
Return statement: At each recursive call(except the base case), return the recursive function for the previous two value as:
recursive_function(N – 1) + recursive_function(N – 2);
Documents were were verified in this round and standard HR Questions were asked like your job location, Was I aware of the Agreement made by TCS ( bond for 2 yrs ) etc.
What is your preferred Job Location?
Are you comfortable with night shifts?
Have you got any other offers?
Tip 1 : Don't Hesitate to clarify any doubt if not been able to understand .
Tip 2 : Speak Confidently and clearly. without any pressure
Tip 3 : Join the meeting 10-15 mins prior and check if you have a stable internet connection if interview is conducted virtually.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: