I applied through other source. I interviewed at Enosis Solutions (Bangladesh) (Dhaka) in May 2026
Interview
There were a total of four rounds: a one-way video interview, a HackerRank test, a live technical discussion, and an HR round. The Hacker Rank test consisted of logical reasoning MCQs, one basic JavaScript problem, two Leet Code medium-level coding problems, and two SQL problems to solve.
Interview questions [1]
Question 1
During the technical discussion, we talked about my projects and they asked a few basic trivia questions. After that, they gave me three coding problems to solve live in hacker rank, along with a database schema design task.
I applied through university. I interviewed at Enosis Solutions (Bangladesh) (Dhaka) in May 2026
Interview
Given my online screening round, now waiting for the call up for the technical round. The online round was on hackerrank and it was automatically monitored, good enough to prevent any illegal measures.
Interview questions [1]
Question 1
Gave two problems to solve, one sql and some iq related mcqs
I applied online. I interviewed at Enosis Solutions (Bangladesh) (Dhaka) in Jan 2026
Interview
Round 1: Online Screening & Coding TestFormat: Conducted online via platforms like HackerRank or a shared document without an IDE.Duration: Ranges from a quick 15-minute screening to a 60–90 minute comprehensive exam.Content: Typically includes 2 Data Structures and Algorithms (DSA) problems, 1 SQL query, and 4–6 analytical or aptitude multiple-choice questions.Problems: Range from easy array manipulation to LeetCode Medium questions like mirror rotation or process queues.Environment: Monitored closely, often recorded, and AI tools are strictly prohibited.Round 2: Live Technical InterviewFormat: A 1-hour live session conducted over video call using a shared document.Content: Consists of 2–3 coding questions lasting about 20 minutes each.Topics: Focuses on recursion, string operations (like text justification), stacks, graphs, and building hierarchical tree views.Expectations: Candidates must explain their thought process, analyze time and space complexities, and discuss alternative solutions.
Interview questions [1]
Question 1
Problem Statement:You are given an array of objects where each object represents a node. Each node has an id, a name, and a parentId. If the parentId is null, it means the node is the root. Write a function to transform this flat array into a deeply nested tree structure.