i
Licious
Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2024. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2023. There were 2 interview rounds.
The sterilization process for retort products typically involves high pressure and high temperature to ensure food safety.
Retort products are typically sterilized using a retort machine, which uses steam under high pressure to heat the product to a specific temperature for a set amount of time.
The high temperature and pressure in the retort machine help to kill any bacteria or microorganisms present in the product, ens...
Skilled and experienced manpower should be assigned in the highest production plan to ensure efficiency and quality.
Assigning skilled workers with relevant experience in the specific production process
Ensuring proper training and supervision for the manpower assigned
Regularly monitoring and evaluating the performance of the assigned manpower
Providing necessary resources and support for the manpower to meet production t
I applied via Approached by Company and was interviewed in Feb 2023. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Sep 2021. There were 2 interview rounds.
Licious interview questions for designations
I applied via LinkedIn and was interviewed before May 2020. There was 1 interview round.
I appeared for an interview in Nov 2020.
I applied via LinkedIn and was interviewed in Mar 2022. There were 5 interview rounds.
The test was based on SQL and the questions were similar to medium difficulty level questions in leetcode.
Different types of joins are used in database queries to combine data from multiple tables.
Inner join: Returns only the matching records from both tables.
Left join: Returns all records from the left table and the matching records from the right table.
Right join: Returns all records from the right table and the matching records from the left table.
Full outer join: Returns all records when there is a match in either the ...
I have 3 years of experience as a Business Analyst in the IT industry.
Worked on gathering and analyzing business requirements
Created functional specifications and user stories
Conducted stakeholder interviews and facilitated meetings
Performed data analysis and created reports
Collaborated with cross-functional teams to implement solutions
Utilized tools like JIRA and Confluence for project management
Improved business proc
The interviewer asked about my previous experience along with a few situation based questions and then gave me a case study to find out possible reasons for a decrease in the cancellations between order dispatch and order delivery.
A case study, few HR questions.
I appeared for an interview before May 2021.
Round duration - 150 Minutes
Round difficulty - Medium
3 coding questions and 20 mcq's
Given an integer array ARR
and a positive integer K
, your task is to determine two non-overlapping subarrays of length K
that yield the maximum combined sum.
The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.
Iterate through the array and calculate the sum of each subarray of length K
Store the maximum sum obtained from the first subarray
Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray
Store the maximum sum obtained from the second subarray
Return the sum of the two maximum
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
The task is to find the count of distinct subsequences in a given string.
Use dynamic programming to solve the problem.
Create a 2D array to store the count of distinct subsequences for each prefix of the string.
Initialize the first row of the array with 1, as there is only one subsequence of an empty string.
For each character in the string, calculate the count of distinct subsequences by considering two cases: including...
Given two integer arrays/ lists ARR1
and ARR2
of sizes N
and M
respectively, you are required to determine their intersection. An intersection is defined as the set of...
The task is to find the intersection of two integer arrays/lists.
Read the number of test cases
For each test case, read the size and elements of the first array/list
Read the size and elements of the second array/list
Find the intersection of the two arrays/lists
Print the intersection elements in the order they appear in the first array/list
Round duration - 120 Minutes
Round difficulty - Medium
Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.
You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.
An island is defined as a group of 1s (re...
The task is to find the number of islands in a grid consisting of 0s and 1s.
An island is a group of 1s connected horizontally, vertically, or diagonally
The grid is surrounded by 0s on all four edges
Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands
Initialize a visited array to keep track of visited cells
For each unvisited cell with a value of 1, p...
Determine the number of permutations of list A
= [1, 2, ..., N] such that for every index i
, either A[i]
is divisible by i
or i
is divisible by A[i]
.
The input start...
The goal is to find the number of permutations of a list satisfying certain conditions.
Iterate through all permutations of the list
Check if each permutation satisfies the given conditions
Count the number of permutations that satisfy the conditions
Return the count for each test case
Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:
M * M = M
The first line cont...
An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.
Check if the given matrix satisfies the property M*M = M
Iterate through each element of the matrix and perform the matrix multiplication
Compare the result with the original matrix
If they are equal, return true; otherwise, return false
Round duration - 120 Minutes
Round difficulty - Easy
This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.
Design attendance management system
Create a database to store employee information
Implement a user interface for employees to mark their attendance
Develop a system to track and record attendance data
Generate reports and analytics based on attendance data
Round duration - 20 Minutes
Round difficulty - Easy
This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.
Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.
Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.
based on 3 interviews
1 Interview rounds
based on 4 reviews
Rating in categories
HUB Manager
110
salaries
| ₹2.9 L/yr - ₹5.3 L/yr |
Assistant Manager
101
salaries
| ₹1.8 L/yr - ₹10 L/yr |
QA Executive
36
salaries
| ₹3 L/yr - ₹4.6 L/yr |
Executive Production
36
salaries
| ₹2.8 L/yr - ₹7.5 L/yr |
Territory Sales Manager
32
salaries
| ₹6 L/yr - ₹14 L/yr |
BigBasket
Swiggy
CARS24
Udaan