Lokal App Software Developer Interview Questions and Answers

Round duration - 60 Minutes
Round difficulty - Easy

This round consisted of DSA questions and they were looking for good coding practices.

Q1. 
Aggressive Cows Problem Statement
Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...read more
Ans. 
The problem is to assign aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
• Sort the array of stall positions in ascending order.

• Use binary search to find the largest minimum distance between cows.

• Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

• If it is possible, update the maximum distance and continue binary search for a ...read more
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in the given array.
• Iterate through the array from right to left.

• Use a stack to keep track of the elements that are greater than the current element.

• For each element, pop elements from the stack until a greater element is found or the stack is empty.

• If a greater element is found, it is the next greater element for the current element.

• If the stack becomes empt...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This round consisted of React related questions, javascript questions.

3 question only simple

Q1. Reverse linked list
Add your answer
Q2. Detect loop in linked list
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect loop in linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the linked list.
Answered by AI
Add your answer

3 Coding question medium level

Q1. Asked 3 coding queston and some basis CS questions
Add your answer

Aptitude test was simple.

Q1. Asked 2 questions from recursion.
Add your answer

Q1. Simple HR round.
Add your answer

Q1. Basic resume based questions
Add your answer
Q2. Explain your internship experience
Add your answer

Q1. Basic resume based questions
Add your answer

NEED TO QUALIFY IN THIS TEST

NEED TO QUALIFY THIS TEST ALSO

Q1. SOME DSA AND ROLE BASED QUATIONS.
Add your answer

50 questions in 12 minutes mostly test your arthimetic, logical knowledge.

3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.

Q1. Difference between sorting algorithms
Ans. 
Sorting algorithms are methods used to arrange elements in a specific order.
• Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.

• Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.

• For example, quick sort is generally faster than bubble sort for large data sets.
Answered by AI
View 1 more answer
Q2. BFS and DFS in trees and imlementing them
Ans. 
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
• BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.

• DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
Answered by AI
Add your answer
Q3. Sql questions and database questions
Add your answer

Q1. Tell me about yourself
Add your answer
Q2. Explain the college life
Add your answer

Question from Array,DP

Q1. Resume based only
Add your answer
Q2. Data structure and algorithms
Add your answer
Q3. Object oriented programmings
Add your answer

Q1. Behavioural questions
Add your answer