Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 2 días. Acudí a una entrevista en FastFox.com (Patiala) en sept 2016
Entrevista
There was an online test consisting of three easy programming questions and one difficult question-one was a dp(mine was to find the LIS),one was to find all the depermutations of a given string,another one mainly checked our skills of data type conversion,the difficult questions was of greedy.There were three technical interviews in my case,for others the no. of technical interviews varied,no hr round.Interviewers were very cool and helpful.I was asked to write codes and was asked some puzzles.
Preguntas de entrevista [1]
Pregunta 1
Q.Draw the tables of your project.
Q.SQL queries related to the project.
Solicité el puesto a través de la recomendación de un empleado. El proceso duró 1 semana. Acudí a una entrevista en FastFox.com (Bengaluru) en sept 2018
Entrevista
Fastfox
I asked my brother's friend for a referral. They were saying they are not hiring freshers but on multiple insisting an interview was arranged.
First Round - Technical, Telephonic
Interviewer introduced himself and asked me to introduce myself. He seemed very professional. He asked me what technologies I am familiar with. He asked me why I am not working (I was not working at the time of the interview). Then my internship experience was discussed for next 5-6 minutes, I explained to him what I did there
(oh I see what you did there).
Then he shared with me a link to the collaborated coding environment. He said he wanted to discuss coding problems with me.
First Problem
Given an array of unique numbers, find a number which is a local maximum, you can return any local maxima if multiple.
Eg -4 5 1 0 3 2
Ans could be 5 or 3
I suggested O(n) solution, he said to optimize it.
After thinking for too much, I couldn't optimize and then he started helping me in thinking.
He said to try to divide your search space. After that, he kind of started walking through the solution.
He told me complete approach-make 4 cases-
for any three consecutive numbers l,m and n there exits 4 possible cases
l<m>n
l<m<n
l>m>m
l>m<n
From here search space can be divided binarily and we can reach to an O(log N) solution.
After explaining me the solution he told me to write working code for it.
He said I will judge you on the basis of your speed and your implementation skills. Again very professional.
I started writing the code but could not come up to a working code, there were compilation errors and my code would have failed in some corner
cases.
Then he ended the interview by asking whether I have any questions.
I tried reaching to the HR for updates many times but didn't receive any updates from them.
Preguntas de entrevista [1]
Pregunta 1
Given an array of unique numbers, find a number which is a local maximum, you can return any local maxima if multiple.
Eg -4 5 1 0 3 2
Ans could be 5 or 3
Solicité el puesto a través de la escuela superior o la universidad. El proceso duró 1 día. Acudí a una entrevista en FastFox.com (Allahabad) en ago 2016
Entrevista
I applied through university . The process took one day. There were 6 rounds.
First was coding round in which 4 questions were given (3 moderate level and 1 difficult)
Then 4 technical and 1 HR. Much question were asked from linked list stack and tree .
And Discussion on Project (pls prepare well).
Preguntas de entrevista [2]
Pregunta 1
Given a linked list and a pointer to a particular node you have to delete it.