Drivestream SQL Developer Interview Questions and Answers

Q1. Past experience
Add your answer
Q2. How much da u know
Add your answer

Q1. Merge sort in js
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.
• Divide the array into two halves recursively

• Sort each half using merge sort recursively

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Hoising based question
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The platform was HackerEarth time duration was 1 hour.
2 Coding questions were asked, 30 minutes for each were allotted.

Q1. 
Longest Substring Without Repeating Characters Problem Statement
Given a string S of length L, determine the length of the longest substring that contains no repeating characters.
Example:
Input:
"abac...read more
Ans. Brute Force
In the brute force approach, we will use two nested loops. The outer loop is used to select the starting index of the substring and the inner loop is used to fix the ending index of the substring. After selecting the substring, we will use another loop (or a method) to check whether the substring contains all unique characters or not using a HashSet.
Space Complexity: O(n)Explanation:
O(L), where L is the len...read more
Answered Anonymously
Add your answer
Q2. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

This was a 2 hours round, with the following problem statement. At the end of the allotted time you had give a demo and explain your implementation.

Round duration - 45 Minutes
Round difficulty - Medium

The platform was Zoom, time duration was 45 mins. Started with Tell me something about yourself. I told them, that I like solving algorithms and real life problems.

Round duration - 20 Minutes
Round difficulty - Easy

Interviewer was very friendly. Asked few questions about myself and then asked questions about what I know about the company.

Coding test of your skills and how well can you cope up with a problem given.

Q1. LAC of 3 nodes
Ans. 
LAC stands for Location Area Code, a unique identifier for a group of cells in a mobile network.
• LAC helps in identifying the location of a mobile device within a cellular network.

• It is used for handover procedures when a device moves between different cells.

• In a network with 3 nodes, each node would have a unique LAC assigned to it.
Answered by AI
Add your answer
Q2. Reverse of the array
Ans. 
Reverse the order of strings in an array
• Use the reverse() method to reverse the array

• Example: ['apple', 'banana', 'cherry'] -> ['cherry', 'banana', 'apple']
Answered by AI
Add your answer
Q3. Sum or product asked
Add your answer