Tip 1 : Be regular in Competitive Coding
Tip 2 : Brush up your Fundamentals regularly
Tip 3 : Always be open to learn new tech stacks in the market
Tip 4 : Do 2 -3 Projects that has an impact in your surronding.
Tip 1 : Be Brief in your resume. Don't make it too lengthy
Tip 2 : Be honest about whatever you write in your resume.
Mcq was provided on an online platform and we were given 60 minutes to answer them
Tip 1 : Have your basic clear
Tip 2 : Practice queries
one Coding questions were there and we have to answer them in 30 mins
Consider the array { 1, 1, 0, 2, 0 }.
For the given array the modified array should be {0,0,1,1,2} .
Arrays { 0, 0, 1, 2, 1 } and { 0, 0, 2, 1, 1 } are not the correctly reorganized array even if they have all the zero values pushed to the left as in both the arrays the relative order of non-zero elements is not maintained.
Can you solve the problem in linear time, and constant space?
First I made a loop for detecting 0 then on encounter made it go front on the array and shift the element left until it encounters the place of 0 moved.
One-on-one interview ..
The environment was pretty relaxed I was asked about my internship and projects, then a few coding problems.
It was about the knapsack approach. I had to explain what is Knapsack and its approach.
Tip 1: Have a clear idea about algorhitms.
A HR round just asking me about my future plans
Tip 1: Be confident in your answers
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you select an element by class name in CSS?