Premium Employer

i

This company page is being actively managed by Tata 1mg Team. If you also belong to the team, you can get access from here

Tata 1mg Verified Tick Work with us arrow

Compare button icon Compare button icon Compare

Filter interviews by

Tata 1mg Software Engineer Interview Questions and Answers

Updated 28 Oct 2024

Tata 1mg Software Engineer Interview Experiences

1 interview found

Software Engineer Interview Questions & Answers

user image Kanishk Rawat

posted on 28 Oct 2024

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Create pagination component using an api show the data for the pages

Skills evaluated in this interview

What people are saying about Tata 1mg

View All
fasterdonut
Verified Icon
2d
works at
Tata 1mg
Anyone please give reference for clinical data base management associate role and clinical research associate role.
I have been applying for this role since 2-3 months yet haven't received any response from hrs , I'm a b pharm fresher currently working at 1mg, looking for opportunities in these roles. It would be great help if someone gives reference, at present I'm getting 3.5 l ctc, and I'm ready to work even at 2 ctc if I get an opportunity to pursue my career as cdbm associate or regulatory affairs associate or clinical research associate. Thanks.
Got a question about Tata 1mg?
Ask anonymously on communities.

Interview questions from similar companies

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me...

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d...

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p...

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Four people need to cross a bridge at night with only one torch t ... read more
asked in Capgemini
Q2. In a dark room, there is a box of 18 white and 5 black gloves. Yo ... read more
Q3. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q4. Puzzle : 100 people are standing in a circle .each one is allowed ... read more
asked in TCS
Q5. Find the Duplicate Number Problem Statement Given an integer arra ... read more

I appeared for an interview in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

  • Q1. 

    Lowest Common Ancestor of a Binary Tree III

    The structure of a binary tree has been modified so that each node includes a reference to its parent node.

    Problem Statement

    You are provided with two nodes,...

  • Ans. 

    This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.

    • Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

    • Compare the two lists and find the last common node.

    • Return the last common node as the lowest common ancestor.

  • Answered by AI
  • Q2. 

    Maximum Subarray Problem Statement

    Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.

    A subarray 'A' is considered greater than a...

  • Ans. 

    The problem is to find a subarray with the maximum sum in a given array.

    • Iterate through the array and keep track of the maximum sum and the current sum.

    • If the current sum becomes negative, reset it to 0.

    • Update the maximum sum if the current sum is greater.

    • Also keep track of the start and end indices of the subarray with the maximum sum.

    • Return the subarray using the start and end indices.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

  • 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...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that have a greater element to their right.

    • 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 empty, the...

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right side of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

    • Sum up the amount of water trapped at each bar to get the total amo...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

In test I had to solve 3 dsa questions in 1 hour

Round 2 - Technical 

(1 Question)

  • Q1. I have asked 2 DSA questions in my interview
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2024. There were 4 interview rounds.

Round 1 - Coding Test 

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Round 2 - Technical 

(2 Questions)

  • Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...
  • Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Round 3 - One-on-one 

(1 Question)

  • Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...
  • Ans. 

    Design a society security system using appropriate design patterns and provide pseudocode for implementation.

    • Use the Singleton pattern for a central security manager to ensure only one instance handles security.

    • Implement Observer pattern for notifying residents about security alerts.

    • Use Factory pattern to create different types of security devices (cameras, alarms).

    • Consider using Strategy pattern for different security...

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.

Round 1 - Aptitude Test 

Easy level to Medium level

Round 2 - Coding Test 

2 Easy questions of DSA

Round 3 - One-on-one 

(2 Questions)

  • Q1. One DSA question
  • Q2. Normal discussion about tech stack
Round 4 - HR 

(2 Questions)

  • Q1. Tell about yourself
  • Q2. Why do you want to join digit?

Interview Preparation Tips

Interview preparation tips for other job seekers - Go easy.. Nothing is hard in digit hiring
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

Duration 1Hr
2 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Don't remember the questions
  • Q2. Don't remember the questions.

Interview Preparation Tips

Interview preparation tips for other job seekers - easy interview. anyone can crack easily if you are clear with basic concepts.
Are these interview questions helpful?

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

  • Q1. 

    Implement indexOf Function

    You are provided with two strings A and B. Your task is to find the index of the first occurrence of A within B. If A is not found in B, return -1.

    Example:

    Input:
    A = "bc", ...
  • Ans. 

    Implement a function to find the index of the first occurrence of one string within another string.

    • Iterate through the second string and check if a substring of the same length as the first string matches the first string.

    • Return the index of the first occurrence of the first string within the second string, or -1 if not found.

    • Handle edge cases like empty strings or when the first string is longer than the second string...

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Implement binary search to find the target integer in the rotated array.

    • Handle the rotation by checking which side of the array is sorted before performing binary search.

    • Return the index of the target integer if found, else return -1.

    • Time complexity of O(logN) is required for each query.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

  • Q1. 

    Distinct Subsequences Problem Statement

    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.

    Exampl...

  • Ans. 

    Calculate the number of distinct subsequences in a string with possible duplicates.

    • Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

    • Consider the cases where the current character is included or excluded in the subsequence.

    • Handle duplicates by considering the previous occurrence of the character.

    • Return the count of distinct subsequences modulo 10^9 + 7.

  • Answered by AI
Round 3 - HR 

Round duration - 60 minutes
Round difficulty - Easy

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAUrban Clap interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Operating System, DBMS, Greedy Algorithms, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects

Application resume tips for other job seekers

Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Sorting of an array and aptitude

Round 2 - Technical 

(1 Question)

  • Q1. BFS graph traversal
Round 3 - Technical 

(1 Question)

  • Q1. Binary tree question
Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I appeared for an interview in Feb 2025.

Round 1 - Aptitude Test 

Data Structures, Coding MCQs

Round 2 - Technical 

(2 Questions)

  • Q1. What is Data Structure
  • Q2. Write DFS Algorithm
  • Ans. 

    Depth-First Search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.

    • DFS uses a stack data structure, either explicitly or via recursion.

    • It starts from a selected node and explores each branch before backtracking.

    • Example: In a binary tree, DFS can be implemented using pre-order, in-order, or post-order traversal.

    • DFS can be used to find connected components in a ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Familiar in Data Structures and Algorithms

Tata 1mg Interview FAQs

How many rounds are there in Tata 1mg Software Engineer interview?
Tata 1mg interview process usually has 1 rounds. The most common rounds in the Tata 1mg interview process are Technical.

Tell us how to improve this page.

Overall Interview Experience Rating

2/5

based on 1 interview experience

Difficulty level

Moderate 100%

Duration

Less than 2 weeks 100%
View more
Join Tata 1mg We bring you closer to better health
Tata 1mg Software Engineer Salary
based on 75 salaries
₹11.1 L/yr - ₹18.9 L/yr
56% more than the average Software Engineer Salary in India
View more details

Tata 1mg Software Engineer Reviews and Ratings

based on 3 reviews

3.3/5

Rating in categories

4.1

Skill development

3.5

Work-life balance

3.4

Salary

3.7

Job security

3.0

Company culture

3.0

Promotions

3.6

Work satisfaction

Explore 3 Reviews and Ratings
Team Lead
289 salaries
unlock blur

₹2.2 L/yr - ₹7 L/yr

Pharmacist
285 salaries
unlock blur

₹1.8 L/yr - ₹4.5 L/yr

Senior Executive
268 salaries
unlock blur

₹2.2 L/yr - ₹6.5 L/yr

Assistant Manager
211 salaries
unlock blur

₹5.4 L/yr - ₹12 L/yr

Executive
161 salaries
unlock blur

₹1.9 L/yr - ₹5 L/yr

Explore more salaries
Compare Tata 1mg with

PharmEasy

3.7
Compare

Udaan

3.9
Compare

Swiggy

3.7
Compare

CARS24

3.5
Compare
write
Share an Interview