Candidatei-me online. O processo levou 3 dias. Fui entrevistado pela Webileapps (Hyderābād) em nov. de 2024
Entrevista
The interviewer asked for my native place (which was not Andhra/Telangana) and his attitude towards me changed and asked a DSA question which I got almost right and then he says I'm done with the interview no more further questions. I want someone who is capable of answering this basic DSA question.
Candidatei-me online. O processo levou 1 dia. Fui entrevistado pela Webileapps em ago. de 2025
Entrevista
I had an online interview in August 2025 for a Node.js Developer role. Surprisingly, the interview didn’t asked any questions specifically related to Node.js. There was a total of four questions:
1) Self-introduction
2) DSA question
3) Another DSA question
4) An SQL query question
(I’ve added the exact questions below.)
During the problem-solving part, the interviewer did provided hints whenever I seemed stuck, such as suggesting what to check or which approach to try. Once I gave the solution to a question, he simply verified it and moved on without any cross-questioning or deeper discussion.
There wasn't any question related to Node.js or even Javascript, surprisingly. Only DSA and SQL question was asked.
Overall, the experience felt quite average and unengaging. It seemed more like the interviewer was just going through a checklist rather than showing genuine interest in the whole conversation. In the end, he said the HR will contact you and dropped off the call, not giving the chance to ask him about the company or something else.
Perguntas de entrevista [3]
Pergunta 1
DSA question: Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". /
Example:
Input: str = ["flower","flow","flight"]
Expected Output: "fl"
A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks.
You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array.
You must write an algorithm that runs in O(log n) time.
Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.
This was a SQL question where there were 2 tables and some data was inserted in them. You were needed to write a Query based on some conditions.
The topics which you may need to know, to be able to write that query are:
JOINS
COUNT
GROUP BY
CONDITIONS
AS keyword
and of course knowledge of SQL :P
