Associate Software Engineer

Given the root of a binary tree, print the nodes that are visible when the tree is viewed from the left side. The left view contains the first node encountered at each level when traversing the tree from top to bottom. Your task is to implement the logic to determine and print these nodes in order.

You are given a list of intervals represented as a 2D array, where each interval consists of a start time and an end time. Some intervals may overlap. Your task is to merge all overlapping intervals into non-overlapping intervals that cover the same ranges. The output should be a list of merged intervals sorted by their start time.

In the interview, I was asked general JavaScript concepts, including the differences between var, let, and const, as well as the concept of hoisting. Additionally, I was asked fundamental database-related questions, such as the difference between DBMS and RDBMS.

You are given two arrays of digits (0–9). Your task is to construct the smallest possible number by selecting exactly one digit from each array. The resulting number should be formed by arranging the two selected digits in such a way that it is as small as possible.

In the interview, I was asked to explain my project in detail, followed by questions on various technical concepts. These included a brief explanation of JWT (JSON Web Token), the differences between DDL and DML commands in SQL, the distinction between a primary key and a unique key, and an explanation of ACID properties along with the concept of transactions in databases. Additionally, I was given a reasoning question based on a number series and was required to determine the next number in the sequence.