Lekha Wireless Solutions Software Developer Interview Questions and Answers

It is consisting of 5 questions,and each question carry 20 marks.difficulaty level of the question is easy to moderate.

Q1. They were asking mainy DSA, project,and internship
Add your answer

2 coding questions - easy

Q1. Merge two sorted linked list Find max sum subarray
Ans. 
Merge two sorted linked lists and find max sum subarray
• To merge two sorted linked lists, compare the nodes and link them accordingly

• For max sum subarray, use Kadane's algorithm to find the maximum sum subarray in a given array
Answered by AI
Add your answer

Q1. Bascic html and django questions
Add your answer

Waste of time and energy sql queries

Q1. Salary negotation and location details
Add your answer

2 data struture question advancevds i cpp

Q1. 5 dsa array string
Ans. 
Implement a data structure for storing and manipulating an array of strings.
• Use a dynamic array to store the strings.

• Implement functions for adding, removing, and accessing strings in the array.

• Consider memory management and resizing the array as needed.
Answered by AI
Add your answer
Q2. Data sturucture
Add your answer

Q1. Resume based question
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was nice.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. Optimal Solution
• Traverse the string and swap the first character with the last character, the second character with the second last character and so on.
• Basically, you need to swap the i-th character with the (N-i-1)-th character where N is the length of the string and 0-based indexing is considered.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only constant extra space is required.
Time Complexity: O(...read more
Answered Anonymously
Add your answer
Q2. 
Move Zeros to Left Problem Statement
Your task is to rearrange a given array ARR such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...read more
Ans. Solution Using Extra space
The idea is to use an extra vector to store all the non-zero elements while maintaining their relative order. So we will first add all the non-zero elements to a vector and then iterate that vector backwards and start updating the array values from end. In the end we will set all the array values whose values were not updated to 0. 
Steps:
1. Let storeNonZero be the vector that stores non-zero...read more
Answered Anonymously
Add your answer
Q3. Write an SQL query to find the second highest salary from a table.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Online test

Q1. MCQ Questions
Based on c++,c and java basics
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

Technical interview

Q1. 
Distinct Elements in K-Sized Windows
The task is to determine the number of distinct elements in every sliding window of size 'K' across an array 'ARR' of size 'N'. A 'K' sized window is a contiguous sequ...read more
Ans. Brute Force
The basic idea of this approach is to check every window of size K and count the number of distinct elements in each window.
Our approach will be to maintain an array answer, which will store the count of the distinct elements in every window. We will traverse through each window and find the number of distinct elements in the current window. 
1. For each element in the window, we will traverse through the w...read more
Answered Anonymously
Add your answer
Q2. 
MergeSort Linked List Problem Statement
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
Input:
The input consists of a single line contain...read more
Ans. Merge Sort Linked List
1. The idea is to take a recursive approach by calling the sort function on the left half and right half of the list.
2. In order to do so, get the middle node and split the list into two halves. We can use a two-pointer technique to get the middle node by running a slow and a fast pointer.
   1. The idea here is to move both the slow and fast pointer simultaneously until fast reaches the end of the list.
   2. Here, ...read more
Answered Anonymously
Add your answer

Round duration - 20 minutes
Round difficulty - Hard

Hr interview