Livekeeping (An IndiaMART Company) interview experience Real time questions & tips from candidates to crack your interview

Associate Professional

Livekeeping (An IndiaMART Company)
upvote
share-icon
3 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 8 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Computer Networking, Object Oriented Programming, ML
Tip
Tip

Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume

Application process
Where: Referral
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration100 mins
Interview date3 May 2022
Coding problem2

The test was conducted on Amcat. There were 5 sections in the test (English, quant, logical, computer science, 2 coding questions)

1. 3Sum

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitSamsungGrofers

You are given an array/list ARR consisting of N integers. Your task is to find all the distinct triplets present in the array which adds up to a given number K.

An array is said to have a triplet {ARR[i], ARR[j], ARR[k]} with sum = 'K' if there exists three indices i, j and k such that i!=j, j!=k and i!=j and ARR[i] + ARR[j] + ARR[k] = 'K'.

Note:
1. You can return the list of values in any order. For example, if a valid triplet is {1, 2, -3}, then {2, -3, 1}, {-3, 2, 1} etc is also valid triplet. Also, the ordering of different triplets can be random i.e if there are more than one valid triplets, you can return them in any order.
2. The elements in the array need not be distinct.
3. If no such triplet is present in the array, then return an empty list, and the output printed for such a test case will be "-1".
Problem approach

In this approach, firstly, we will hash the indices of all elements in a hashMap. In case of repeated elements, the last occurence index would be stored in hashMap.

Here also we fix a number (num[i]), by traversing the loop. But the loop traversal here for fixing numbers would leave last two indices. These last two indices would be covered by the nested loop.
If number fixed is +ve, break there because we can't make it zero by searching after it.
Make a nested loop to fix a number after the first fixed number. (num[j])
To make sum 0, we would require the -ve sum of both fixed numbers. Let us say this required.
Now, we will find the this required number in hashMap. If it exists in hashmap and its last occurrence index > 2nd fixed index, we found our triplet. Push it in answer vector.
Update j to last occurence of 2nd fixed number to avoid duplicate triplets.
Update i to last occurence of 1st fixed number to avoid duplicate triplets.
Return answer vector.

Try solving now

2. Number of Islands

Easy
0/40
Asked in companies
PhonePeExpedia GroupRazorpay

You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.

An island is a group of 1s (representing land) connected horizontally, vertically or diagonally. You can assume that all four edges of the grid are surrounded by 0s (representing water).

Problem approach

Each time when we see a '1', I increment the counter and then erase all connected '1's using a queue.

Try solving now
02
Round
Easy
Video Call
Duration60 mins
Interview date10 May 2022
Coding problem4

This round was taken by an engineer with 10 years of experience. He covered almost all aspects starting from coding questions to computer fundamentals.

1. Remove Duplicates From String

Moderate
25m average time
0/80
Asked in companies
MicrosoftLivekeeping (An IndiaMART Company)Livekeeping (An IndiaMART Company)

You are given a string (STR) of length N, consisting of only the lower case English alphabet.

Your task is to remove all the duplicate occurrences of characters in the string.

For Example:
If the given string is:
abcadeecfb

Then after deleting all duplicate occurrences, the string looks like this:
abcdef
Problem approach

1) Sort the elements.
2) Now in a loop, remove duplicates by comparing the 
current character with previous character.
3) Remove extra characters at the end of the resultant string.

Try solving now

2. Puzzle

Egg Dropping Puzzle

Problem approach

Tip 1: Practice Previously Asked Questions.
Tip 2: Share your Thought process while solving

3. Palindrome Linked List

Easy
20m average time
90% success
0/40
Asked in companies
Livekeeping (An IndiaMART Company)AppleThought Works

You are given a singly Linked List of integers. Your task is to return true if the given singly linked list is a palindrome otherwise returns false.

For example:
The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.

It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward​.
Follow Up:
Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?
Problem approach

1: Reverse the first half while finding the middle
2: Compare the reversed first half with the second half.

Try solving now

4. OS Questions

what is Deadlock?
what is Virtual Memory?
what are Threads?
what are Promises?

Problem approach

Tip 1: understand most important concepts
Tip 2: Explain problems with examples.
Tip 3: Practice Previosuly asked Questions.

03
Round
Easy
HR Round
Duration20 mins
Interview date17 May 2022
Coding problem1

This was a simple round just asked some basic HR questions.

1. Basic HR Questions

A basic Intro
what do you know about the about, the company?
why want to work with us?
10th,12th, grad CGPA or percentage/
do you have your own laptop?

Problem approach

Tip 1: Just be confident 
Tip 2: Show your willingness to learn even if you are not able to answer any of their questions. They are ready to hire and train employees as per their requirements.
Tip 3: Practice Previously asked Questions.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Associate Engineer
3 rounds | 5 problems
Interviewed by Livekeeping (An IndiaMART Company)
0 views
3 comments
0 upvotes
Associate Software Engineer
2 rounds | 3 problems
Interviewed by Livekeeping (An IndiaMART Company)
1166 views
0 comments
0 upvotes
Associate Software Engineer
2 rounds | 4 problems
Interviewed by Livekeeping (An IndiaMART Company)
1037 views
0 comments
0 upvotes
Associate Professional
2 rounds | 4 problems
Interviewed by Livekeeping (An IndiaMART Company)
777 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Associate Professional
3 rounds | 3 problems
Interviewed by CIS - Cyber Infrastructure
514 views
0 comments
0 upvotes
company logo
Associate Professional
4 rounds | 6 problems
Interviewed by CIS - Cyber Infrastructure
0 views
0 comments
0 upvotes
company logo
Associate Professional
3 rounds | 9 problems
Interviewed by CIS - Cyber Infrastructure
490 views
0 comments
0 upvotes