Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Freshworks (Chennai) em mar. de 2017
Entrevista
Four rounds
All technical
First round
Telephonic round, where the interviewer asked me to code for simple data structures problem on a tool called collabedit.
The interviewer was really friendly and engaging. He gave me ample time to prepare my solution. And asked me to first explain the solution and made sure I solved all the edge cases. And then made me write the code. The code was not run on a compiler. They simply wanted a code without errors.
Second Round
F2F where the interviewer asked me questions on the things I mentioned on resume. Be thorough in what you know.
Questions on TCP/IP, HTTP/HTTPS, JMS, APIs, web services and their types. They asked me these questions because I have mentioned that worked on web services.
Tough one. I did not do that round well.
One algorithms question - To solve the longest common sub sequence.
Design a grocery shop database. I created tables based on Customer, products, Order.
One complex SQL based on the database I designed for grocery shop.
I did the db design and sql okay. And I solved the algorithms problem without any issues.
Third Round
One puzzle. I solved it. It was easy.
One simple SQL query. I wrote it fine.
Questions on data-structures. Like how to reverse a stack. And it's complexities.
I felt the third round was easy. Considering only very few questions were asked.
Fourth Round
By the time I got to this round, I was really exhausted.
I got one problem on chess board. I didn't completely solve all the cases.
I was asked to apply data structure to implement an LRU(Least Recently Used) cache.
I did not complete it.
After this round I was asked to go home. If there is anything they would call me back. I felt bad. Because this usually means bad news.
But after two weeks, I was offered the job.
Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Freshworks (Chennai) em nov. de 2017
Entrevista
The first round was conducted on hackerrank which contains 3 programming questions(1 easy, 1 moderate, 1 hard) and the time allotted was 60 minutes.I solved 2 out of 3. After I was called for interview at Freshworks office at SP infocity , Chennai.I had three technical rounds and finally HR round. Interviewers helped me whenever I was stuck up with logic. Great experience!!
Technical 1:
Logical questions & puzzles
Datastructures & Algorithms mostly
OOPs Concepts
Database Queries
Technical 2:
OOPs Concepts
2 Programming Questions
Technical 3:
Questions on Java Class Designing
Questions on Probability
Finally HR Round
Perguntas de entrevista [7]
Pergunta 1
Find whether a given number is a Exact power of 2 or not.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fui entrevistado pela Freshworks (Thanjāvūr) em out. de 2017
Entrevista
Held at SASTRA University.800 students applied overall.
1st Round was a online coding round consisting of 3 questions in Hackerrank Platform.
(Solving 1.5 was the cutoff)
27 cleared it
2nd round(2 F2F) was F2F Interview on DataStructures , Algorithms , Puzzles ....
15 cleared it
3rd round(2 F2F) was F2F Interview on Frontend WebD , Testing , Algorithms....
9 cleared it
4th round(HR) Basic HR questions
7 Selected for intern+FTE
If you clear Round 1 and you aren't selected they will call you for off campus interview.Be strong in web development and better to know Ruby on Rails.
Perguntas de entrevista [1]
Pergunta 1
Design a Web page given UI drawn on paper.They test whether you know the HTML tags.
Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 dias. Fiz uma entrevista na empresa Freshworks.
Entrevista
The first round was conducted on hackerrank which included 15 multiple choice questions and 3 programming questions and the time alloted was 1 hour and 40mins.
The second round was held the next day which had two technical rounds and 1 HR.
The first technical round was difficult..The second technical round was moderate.
Covered topics from os, networking,testing, normalisation and programming algorithms.