Lumiq Software Developer Trainee Interview Questions and Answers

General and basic data structure question

Q1. Coding over the video call
Add your answer
Q2. Java programs for strings , palindrome etc
Ans. 
Java programs for strings, palindrome, etc.
• Use the StringBuilder class to manipulate strings efficiently.

• To check if a string is a palindrome, compare it with its reverse.

• To count the occurrences of a substring in a string, use the indexOf method in a loop.

• To split a string into an array of substrings, use the split method.
Answered by AI
Add your answer
Q3. Projects questions on which you have worked
Add your answer
Q4. Explanation skill will also be considered
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

First round was a basic javascript problem-solving round. The interviewer judged my grasp on fundamental javascript concepts like objects, closures, polyfills, etc. It was during the afternoon and was conducted on google meet and leetcode playground.
The interviewer was very calm. I was first asked some general questions like why I'm applying for this role and what are the projects I've done.

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
This question asks to find the position of a target integer in a row-wise and column-wise sorted matrix.
• Iterate through each row and column of the matrix

• Compare the target integer with the current element

• If the target integer is found, return the position as {i, j}

• If the target integer is not found, return {-1, -1}
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

One DSA Question along with some javascript questions were asked like hoisting, difference between JSX and Javascript etc.

Q1. 
Trapping Rain Water Problem Statement
You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...read more
Ans. 
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
• Iterate through the array and find the maximum height on the left and right of each bar.

• Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

• Sum up the trapped water for all bars and return the total amount.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

It was a DSA round where I was asked 2 coding questions and optimised approaches for both.

Q1. 
Ninja and His Meetings Problem Statement
Ninja has started a new startup with a single conference room available for meetings. Given an array/list MEETINGS of consecutive appointment requests, Ninja must ...read more
Ans. 
Find the maximum total booked minutes possible in a conference room for all meetings with a 15-minute break between meetings.
• Iterate through the list of meeting durations and calculate the maximum total booked minutes considering the 15-minute break constraint.

• Keep track of the total booked minutes and skip consecutive meetings that violate the break constraint.

• Return the maximum total booked minutes for each test case
Answered by AI
Add your answer
Q2. 
Trapping Rain Water II Problem Statement
Given an M * N matrix where each cell's value represents its height in a 2-D elevation map, calculate the total volume of water that can be trapped after rainfall.
...read more
Ans. 
Calculate the total volume of water that can be trapped in a 2-D elevation map after rainfall.
• Iterate through each cell in the matrix and calculate the trapped water based on the surrounding heights.

• Use a stack or queue to keep track of the cells to be processed.

• Consider edge cases such as when the matrix is empty or has only one row or column.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

It was more of discussion around my projects and resume. Also asked some questions related to me. What are your hobbies? Willing to relocate?

Q1. 
Smallest Subarray With K Distinct Elements
Given an array A consisting of N integers, your task is to find the smallest subarray of A that contains exactly K distinct integers.
If multiple such subarrays...read more
Ans. 
Find the smallest subarray with exactly K distinct elements in an array.
• Use a sliding window approach to keep track of the subarray with K distinct elements.

• Maintain a hashmap to count the frequency of each element in the window.

• Update the window size based on the number of distinct elements.

• Return the smallest subarray with K distinct elements.
Answered by AI
Add your answer

Q1. Design LLD for Parking Lot
Ans. 
Design LLD for Parking Lot
• Create classes for ParkingLot, ParkingSpot, Vehicle, etc.

• Implement methods for parking, unparking, checking availability, etc.

• Consider different types of vehicles and parking spots (e.g. regular, handicapped, electric)

• Include features like ticketing system, payment processing, and security measures
Answered by AI
Add your answer

5 DSA Questions 2 Easy, 2Medium, 1 Hard, hackerrank

Q1. 3 DSA question were asked of medium level
Add your answer
Q2. Largest vertical rectangle in array
Ans. 
Find the largest vertical rectangle in an array of strings
• Iterate through each column in the array

• For each column, find the consecutive vertical rectangles of '1's

• Calculate the area of each rectangle and keep track of the largest one
Answered by AI
Add your answer

Q1. 1 DSA and around OS, DBMS, Resume
Add your answer

Q1. Around projects, Multithreading, LLD, HLD
Add your answer

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

Q1. Write a program to check if string is a anagram
Ans. 
Program to check if a string is an anagram
• Create a function that takes in two strings as input

• Remove all spaces and convert both strings to lowercase

• Sort both strings and compare if they are equal to determine if they are anagrams
Answered by AI
View 1 more answer
Q2. What is react lifecycle method
Ans. 
React lifecycle methods are special methods that are automatically called by React at specific points in a component's life cycle.
• React components have several lifecycle methods such as componentDidMount, componentDidUpdate, componentWillUnmount, etc.

• These methods allow developers to perform actions at specific points in a component's life cycle, such as fetching data, updating the UI, or cleaning up resources.

• Understa...read more
Answered by AI
Add your answer

Create a web app to perform cred operation

General aptitude questions

Abstract topic group discussion

Q1. Technical interview covering topics on oops , data structures , conditional statements.
Add your answer

Q1. General questions- introduction , how previous rounds went ,hobbies , what do you know about our company , situation based questions.
Add your answer