Me postulé a través de una recomendación de un empleado. El proceso tomó 1 día. Acudí a una entrevista en TinyOwl Technology (Mumbai) en ago 2015
Entrevista
They called me for a Face 2 face Interview at their development center. Interview was smooth and nice. One of the best experience. It took almost 2.5 hours of interview with lot of discussions.
Preguntas de entrevista [1]
Pregunta 1
Simple Android concepts, programming question - asked about finding the second largest number in an array. Internal implementation of HashMap, write custom HashSet using hashmap, fragment lifecycle, git workflow, commands. Interviewers was nice and jolly guys, One of the best interview I had.
Me postulé a través de otra fuente. El proceso tomó 2 días. Acudí a una entrevista en TinyOwl Technology en jul 2018
Entrevista
Rounds:
1 .Online test: -
1 coding question to be done in 1 hour. Difficulty: Easy
2. Technical 1:-
Basic questions on Databases, Tables and SQL queries.
Questions based on resume.
3. Technical 2:-
Basic implementation of a priority queue.
Ranking of search results based on input keyword.
Questions related to web error status codes, server applications.
Preguntas de entrevista [1]
Pregunta 1
Q.) Given an array with integer data items, we need to find the minimum number of jumps needed to reach the end of the array where the number of cells we can jump at each step is equal to or less than the integer data item at that array index.
Q. To find the lowest common ancestor of two nodes in a binary search tree.
Me postulé a través de una facultad o universidad. Acudí a una entrevista en TinyOwl Technology (Roorkee) en sept 2015
Entrevista
The interview process was quite smooth. The interviewers were very friendly. It consisted of two technical rounds. Round 1 went for around 20 minutes. Round 2 was longer and went on for about 1.5 hours. An Online coding test was to be cleared in order to be shortlisted for the interviews.
Preguntas de entrevista [5]
Pregunta 1
Given an array with integer data items, we need to find the minimum number of jumps needed to reach the end of the array where the number of cells we can jump at each step is equal to or less than the integer data item at that array index.
Search an item in a matrix where all the elements are in ascending order both row and column-wise. Implement it using the best time complexity(worst-case).