Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 dia. Fui entrevistado pela Unthinkable (Greater Noida) em ago. de 2022
Entrevista
It was based on logical and coding. And then resume and project discuss . Also the recruiter asked some aptitude based questions. Good communication skill was also required. Try to be in a discussion mode rather than just saying no for questions you don’t know.
Perguntas de entrevista [1]
Pergunta 1
To print Numbers between two given numbers without using loop .
To compare two numbers for equality without using comparison operators.
Candidatei-me online. Fui entrevistado pela Unthinkable (Gurgaon, Haryana) em jan. de 2026
Entrevista
I recently appeared for a 1-hour Machine Coding Round at Daffodil Software, Gurgaon. The test included three problem statements and mainly focused on problem-solving, coding skills, and quick implementation under strict time constraints. Overall, it was a fast-paced round that checked how efficiently I could understand requirements, write clean code, and deliver working solutions within limited time.
Perguntas de entrevista [1]
Pergunta 1
The first problem was based on string manipulation and rotations. A string of length N was given, and we were allowed to perform K operations where in each operation the first character is removed and added to the end of the string (left rotation). For each rotation, we had to calculate a weighted score using a formula involving the position of characters in the alphabet and their indices, and finally determine the minimum possible score among all rotations.
The second problem was on arrays, where a circular array was given and we had to find the maximum possible subarray sum considering both normal and circular subarrays. This problem tested knowledge of Kadane’s Algorithm and handling circular conditions.
The third problem was based on a 2D matrix representing rotten and fresh mangoes. Each minute, a rotten mango could rot its adjacent fresh mangoes in four directions. We had to find the minimum time required to rot all mangoes using a BFS-based approach, similar to the classic Rotten Oranges problem.
