Lalamove PHP Developer Interview Questions and Answers

Q1. Tell me about your self
Ans. My name is Kritika, I have 2 siblings, my mom is house wife and and I love dogs, my favourite thing traveling, i was passed m.com in 2019 from awadh university. I have 5 years experience work different different fields, like 1st job in publication and 2nd job in advertising company as a project manager and Last one cars24 Pvt Ltd corporate office as a associate
Answered by Kirtika
Add your answer

Convenience power, Patience

Round duration - 75 minutes
Round difficulty - Medium

Test Comprises of 3 coding questions and some MCQs

Round duration - 60 minutes
Round difficulty - Medium

2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer

Round duration - 60 minutes
Round difficulty - Easy

This Round was based on CS fundamentals and One coding question was there as a Code-pair.

Q1. 
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. 
Find the Next Greater Element for each element in a list of integers.
• Iterate through the list of integers from right to left.

• Use a stack to keep track of elements whose NGE is yet to be found.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Assign the NGE as the top element of the stack or -1 if the stack is empty.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Total of 8 questions:

4 MCQ(oops and expected output type questions) + other 2 were coding questions, out of which one is some class implementation question.

Q1. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of the running sum modulo K.

• Use a hashmap to store the frequency of remainders.

• For each prefix sum, check how many previous prefix sums have the same remainder.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This round was with the USA team, the panel consisted of 2 members. It took place at around 9 PM IST. The interviewer's focus was on approach.

Q1. 
Sort an Array in Wave Form
You are given an unsorted array ARR. Your task is to sort it so that it forms a wave-like array.
Input:
The first line contains an integer 'T', the number of test cases.
For ea...read more
Ans. 
Sort an array in a wave-like pattern where each element is greater than or equal to its adjacent elements.
• Iterate through the array and swap elements at even indices with their adjacent odd indices to form a wave pattern.

• There can be multiple valid wave arrays, so any valid wave array is acceptable.

• Ensure the first element is greater than or equal to the second element to start the wave pattern.
Answered by AI
Add your answer
Q2. 
Convert a Number to Words
Given an integer number num, your task is to convert 'num' into its corresponding word representation.
Input:
The first line of input contains an integer ‘T’ denoting the number o...read more
Ans. 
Convert a given integer number into its corresponding word representation.
• Implement a function that takes an integer as input and returns the word representation of that number.

• Break down the number into its individual digits and convert each digit into its word form.

• Handle special cases like numbers between 10 and 19, and multiples of 10.

• Combine the word forms of individual digits to form the final word representation
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was a managerial round. The position of the person taking the interview was of a technical architect. As was informed by the recruiter, previously he was a technical architect at Amazon.

Q1. How does Facebook store comments in its database?
Ans. 
Facebook stores comments in its database using a combination of relational and non-relational databases.
• Comments are typically stored in a relational database like MySQL for structured data storage.

• For scalability and performance, Facebook may also use a NoSQL database like Cassandra or HBase for storing comments in a denormalized format.

• Metadata related to comments such as likes, timestamps, and user information may b...read more
Answered by AI
Add your answer

Q1. Impliment counter using closure in js
Ans. 
Implement a counter using closure in JavaScript.
• Create a function that returns another function which increments a counter variable.

• The counter variable should be defined in the outer function's scope and only accessible to the inner function.

• Each time the inner function is called, increment the counter variable and return its value.
Answered by AI
Add your answer
Q2. Explain promises, promise.all(), impliment binary search
Ans. 
Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.
• Promises are used in JavaScript to handle asynchronous operations.

• promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...read more
Answered by AI
Add your answer

Q1. Questions on kafka, cache invalidation, diff b/w authentication and authorization
Add your answer

- simple basic ios questions

Q1. Asked DSA array questions
Add your answer

Kadance algorithm and find the middle of the linklist

More on java and Python based coding questions

Q1. Behavioural questions were asked
Add your answer
Q2. What are your expectations from this job
Add your answer
Q3. What are your plans ahead
Add your answer
Q4. Where do you see yourself in 5 years ahead
Add your answer

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It has 3 Coding Questions of medium-hard level and the time limit was 1 hour only. I don’t exactly remember the questions but I was able to do only two of them completely.

Q1. 
Biggest Number Formation Problem
Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.
Input:
Integer T denoting the nu...read more
Ans. 
Construct the largest number by concatenating positive integers in the array exactly once.
• Sort the array of integers in a way that the concatenation of the numbers forms the largest possible number.

• Use a custom comparator function to sort the numbers based on their concatenated values.

• Join the sorted array elements to form the final largest number.
Answered by AI
Add your answer
Q2. 
Number of Longest Increasing Subsequence Problem Statement
Given an integer array ARR of length N, determine the count of longest increasing subsequences present in the array.
Explanation:
The Longest I...read more
Ans. 
Count the number of longest increasing subsequences in an integer array.
• Identify the longest increasing subsequences in the array

• Count the number of such subsequences

• Consider the constraints while implementing the solution

• Examples: For input [50, 3, 90, 60, 80], the output is 2
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

First, the interviewer introduced himself and then asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 3 coding questions on their personal live code environment.

He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.

Q1. 
Cache Operations Problem
You are provided with a cache that can hold a maximum of 'N' elements. Initially, this cache is empty. There are two main operations you can perform on this cache:
Explanation:
...read more
Ans. 
Implement a cache with insert, update, and retrieve operations, returning results of retrieve operations in order.
• Create a cache data structure with specified size 'N'.

• Implement insert and update operations based on the given criteria.

• For retrieve operation, return the value associated with the 'U_ID' if present, else return -1.

• Handle cases where the cache is full and least frequently used items need to be removed.

• Retu...read more
Answered by AI
Add your answer
Q2. 
Possible Words from a Phone Number: Problem Statement
Given a string S composed of digits ranging from 2 to 9, determine all possible strings that can be created by mapping these digits to their correspon...read more
Ans. 
Given a phone number, generate all possible words by mapping digits to letters on a T9 keypad.
• Create a mapping of digits to letters on a T9 keypad

• Use recursion to generate all possible combinations of letters for the given phone number

• Sort the resulting strings in lexicographical order
Answered by AI
Add your answer
Q3. 
Shortest Unique Prefix Problem
You are given an array containing N words. Your task is to derive the shortest prefix for each word that uniquely identifies it amongst the other words. For instance, given t...read more
Ans. 
Given an array of words, find the shortest unique prefix for each word.
• Create a Trie data structure to efficiently store and search for prefixes.

• Traverse the Trie to find the shortest unique prefix for each word.

• Return the list of shortest unique prefixes for all words.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

In this round interviewer gave me 2 coding questions and asked me to code on any editor of my choice. I opened VS code to code those problems.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array arr of length N consisting of integers, find the sum of the subarray (including empty subarray) with the maximum sum among all subarrays.
Explanation...read more
Ans. 
Find the sum of the subarray with the maximum sum among all subarrays in a given array.
• Iterate through the array and keep track of the maximum sum subarray seen so far.

• Use Kadane's algorithm to efficiently find the maximum subarray sum.

• Handle cases where all elements are negative by returning the maximum element in the array.

• Consider the sum of an empty subarray as 0.
Answered by AI
Add your answer
Q2. 
LRU Cache Implementation
Design and implement a data structure for the Least Recently Used (LRU) cache, which supports the following operations:
1. get(key) - Return the value associated with the key if ...read more
Ans. 
Implement a Least Recently Used (LRU) cache data structure with get and put operations.
• Use a combination of a hashmap and a doubly linked list to efficiently implement the LRU cache.

• Keep track of the least recently used item and remove it when the cache reaches its capacity.

• Update the position of an item in the cache whenever it is accessed or updated.

• Ensure constant time complexity for both get and put operations by u...read more
Answered by AI
Add your answer

Round duration - 40 Minutes
Round difficulty - Easy

The interviewer was very friendly. He asked me about myself and previous interviews.