Tip 1 : Competitive Coding helps initially, later Leetcode, GFG
Tip 2 : Add at least 2 projects in your resume
Tip 1 : Add atleast two projects on Resume
Tip 2 : Study in depth from Resume and make your friend take your mock interview
The round started at 8 PM. There was one question with several test cases and had to pass every test case in order to get a call for interview.
F(n) = F(n - 1) + F(n - 2),
Where, F(1) = 1, F(2) = 1
"Indexing is start from 1"
Input: 6
Output: 8
Explanation: The number is ‘6’ so we have to find the “6th” Fibonacci number.
So by using the given formula of the Fibonacci series, we get the series:
[ 1, 1, 2, 3, 5, 8, 13, 21]
So the “6th” element is “8” hence we get the output.
It was first round for 45mins and only one question was asked.
It was again 45 min interview and after an intro we quickly jumped in coding.
For the given string “what we think we become”
“what”,” think”, and “become” occurs 1 time, and “we” occurs 2 times in the given string.
It was an Technical + HR round. The interviewer was very understanding and he checked the overall knowledge of the subject.
What is difference betweeen thread and process?
What is deadlock?
If 'N' is 5 and 'K' is 3 and the array is 7, 2, 6, 1, 9
Sorting the array we get 1, 2, 6, 7, 9
Hence the 3rd smallest number is 6.
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?