i
Tata 1mg
Filter interviews by
Majorily on SQL and Databases
Use CSS to align two images with same width and height on a page
Set both images to have the same width and height using CSS
Use flexbox or grid layout to align the images horizontally or vertically
Adjust margins or padding as needed for spacing
I applied via campus placement at National Institute of Technology (NIT), Hamirpur and was interviewed in Apr 2023. There were 2 interview rounds.
2 coding question one on maximum sum problem and other on tree traversal
I was interviewed in Dec 2021.
Round duration - 90 minutes
Round difficulty - Medium
There were a total of 3 coding questions to be solved, and the time limit was 90 minutes. The candidate was free to use language of their choice.
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
The task is to find the length of the longest palindromic subsequence in a given string.
A subsequence is a sequence generated from a string after deleting some or no characters of the string without changing the order of the remaining string characters.
A string is said to be palindrome if the reverse of the string is the same as the actual string.
Find the longest palindromic subsequence by considering all possible subs...
Round duration - 45 minutes
Round difficulty - Easy
The first round of interview lasted for around 45 minutes. I was asked two DSA questions, and was supposed to code them while my screen was shared. I wrote code for both the questions with little help from the interviewer. Finally, I was asked couple of questions based on my resume.
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.
...The task is to merge two sorted linked lists into a single sorted linked list.
Create a new linked list to store the merged list
Compare the values of the nodes from both lists and add the smaller value to the new list
Move the pointer of the list with the smaller value to the next node
Repeat the comparison and addition until one of the lists is empty
Add the remaining nodes from the non-empty list to the new list
Return th
Given two strings 'P' and 'Q' of equal length, determine if string 'P' can be transformed into string 'Q' by cyclically rotating it to the right any num...
The task is to check if one string can be converted into another string by cyclically rotating it to the right any number of times.
Iterate through each character of the first string and check if it matches the corresponding character in the second string after a certain number of cyclic rotations.
If all characters match for any number of cyclic rotations, then the first string can be converted into the second string.
Us...
Round duration - 30 minutes
Round difficulty - Medium
I was given one data structure question and was then asked about recursion.
You are provided with an array or list ARR
containing N
positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...
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
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, there is no greater element to the right
Store the ...
Round duration - 40 minutes
Round difficulty - Easy
This was the hiring manager round. No data structures question were asked in this round. There was discussion around the projects that I had done and my resume. As I am from EEE branch, I was asked why I want to get into software. The interview happened around 8 PM. I was asked to create a schema for one of my projects.
I want to get into software because of my passion for problem-solving and the opportunity to create innovative solutions.
Passion for problem-solving
Opportunity to create innovative solutions
Interest in technology and its impact on society
Career growth and job stability
Flexibility and remote work options
Tip 1 : Practice regularly, meaning once you have covered all the topics, revisit them every week, and solve 3-5 questions.
Tip 2 : Use the Feynman technique. Explain your approach towards solving the problem to someone, or better yet, note it down so that when you revisit that question, the explanation is handy.
Tip 3 : Do 1 project, preferably a full-stack one including a database. This would provide some material for discussion, and be through with each aspect of the project.
Tip 1 : Keep the resume to one page and put info that is directly related to the role applied.
Tip 2 : In the projects section, keep a maximum of 3 projects, but ensure that at least one of them is hosted/live that can be shown to the interviewer.
Tata 1mg interview questions for designations
I was interviewed in Dec 2021.
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.
Your task is to construct the largest number possible by concatenating each of the provided positive integers in the array exactly once.
Integer T denoting the nu...
Using the inbuilt library of Python, itertools library can be used to perform this task.
Given an integer array ARR
of length N
, determine the count of longest increasing subsequences present in the array.
The Longest I...
Querying the length of the longest is fairly easy. Note that we are dealing with end elements only. We need not maintain all the lists. We can store the end elements in an array. Discarding operation can be simulated with replacement, and extending a list is analogous to adding more elements to the array.
We will use an auxiliary array to keep end elements. The maximum length of this array is that of input. In the worst...
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.
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:
We can maintain a list of cache initialized with -1 which represents all the cells in the cache are empty. Declare a list that stores value at ith position, frequency of times it was used, and last operation it was used.
Declare a list ‘ANS’ that stores answer for all queries of type 2. We perform each operation as follows:-
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...
I explained to him the logic of my approach and he seems satisfied with it. It was sort of medium-level difficulty.
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...
I gave him a brute force approach with which he was not satisfied. Then he gave me time to think and asked for more optimized approach. Then after 5 min i gave him this Trie solution and then i explained him the structure of trie along with the code
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.
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.
I explained to him my approach (Kadane’s algorithm) and he seems satisfied with it and asked to code it down.
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 ...
I gave him a brute force solution but the interviewer was not satisfied. I was stuck for some time, then he helped me with data structure (doubly linked list). After 15-20 min of discussion, I was able to do that question and code it down.
Round duration - 40 Minutes
Round difficulty - Easy
The interviewer was very friendly. He asked me about myself and previous interviews.
Tip 1 : Do at least 2-3 Development Projects as it creates a great impression.
Tip 2 : Do it simply don't include complex terms to explain anything/concept.
Tip 3 : Practice as many questions as you can.
Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.
Get interview-ready with Top Tata 1mg Interview Questions
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Basic React JS clock/ stopwatch
posted on 9 Oct 2024
I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.
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.
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
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
Implement using a doubly linked list and a hashmap for efficient operations
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
Some of the top questions asked at the Tata 1mg Software Developer interview -
based on 4 interviews
1 Interview rounds
based on 12 reviews
Rating in categories
Team Lead
258
salaries
| ₹1.8 L/yr - ₹8 L/yr |
Senior Executive
253
salaries
| ₹2.2 L/yr - ₹6.4 L/yr |
Pharmacist
243
salaries
| ₹1.7 L/yr - ₹4.3 L/yr |
Assistant Manager
191
salaries
| ₹3 L/yr - ₹14 L/yr |
Executive
143
salaries
| ₹1.6 L/yr - ₹4.6 L/yr |
PharmEasy
Netmeds.com
Medlife
Practo