AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
i
Tata 1mg
Compare
Filter interviews by
Tata 1mg Software Development Engineer Interview Questions and Answers
Tata 1mg Software Development Engineer Interview Experiences
1 interview found
Anonymous
Selected
I was interviewed before Oct 2022.
(1 Question)
- Q1. Basic dsa question of 2 sum and other questions around HTML and css
(1 Question)
- Q1. Egineering manager round asked about my college projects
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
8 Questions
- Q1. Implement queue with the help of two stacks
- Ans.
Queue can be implemented using two stacks by maintaining the order of elements in the stacks.
Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the
- Q2. Iven a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number
- Q3. What is left join. Give example. And Full outer join?
- Ans.
Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.
Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...
- Q4. What is magic functions and autoloading in PHP?
- Ans.
Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.
Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle
- Q5. Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6, 7, 20, 80, 100} ar3[] = {3, 4, 15, 20, 30, 70, 80, 120} Ou...
- Ans.
Given three sorted arrays, find common elements.
Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array
- Q6. A puzzle. You will be given with a 3 Litre container & a 7 Litre Container. Measure exactly 5 Litres of water
- Q7. Asked about one of my projects I mentioned in my resume?
- Q8. Find if a number is a power of 2 or not?
- Ans.
Check if a number is a power of 2 or not.
A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
Interview Preparation Tips
College Name: na
Motivation: Overall it was a very good experience. They test you from every aspect. In the End I would like to say that Practo is one of the best companies to work for.
Skills evaluated in this interview
Interview Questionnaire
9 Questions
- Q1. What is event bubbling?
- Ans.
Event bubbling is the propagation of an event from the innermost child element to the outermost parent element.
Events triggered on a child element will also trigger on its parent elements
The event travels up the DOM tree until it reaches the document object
Can be stopped using event.stopPropagation()
Can be useful for event delegation
- Q2. Difference between .on(‘click’,function() and .click(function())
- Ans.
The .on('click',function() is a more flexible method than .click(function())
The .on() method can handle multiple events and selectors
The .click() method can only handle one event and one selector
The .on() method can also handle dynamically added elements
The .click() method cannot handle dynamically added elements
- Q3. Write a function to check if two strings are anagram or not
- Ans.
Function to check if two strings are anagram or not
Create two character arrays from the strings
Sort the arrays
Compare the sorted arrays
- Q4. Given an array of integers which can be in one of four order – i.Increasing 2.Decreasing 3.decreasing then increasing 4.increasing then decreasing .Write a function to find the type of array
- Ans.
Function to determine the order of integers in an array.
Check first and last element to determine if increasing or decreasing
Check for inflection point to determine if order changes
Return order type as string
- Q5. How can you improve the performance of a site.(Only frontend)
- Ans.
Optimize images, minify code, reduce HTTP requests, use caching, and lazy loading.
Optimize images using compression and appropriate file formats
Minify code to reduce file size and improve load times
Reduce HTTP requests by combining files and using sprites
Use caching to store frequently accessed data locally
Implement lazy loading to defer loading of non-critical resources
- Q6. Design database schema for a movie site.Where user can watch the movie,genre of movie,give ratings and recommended movies to user.Also Write an algorithm to show recommended movies to user
- Ans.
Design a database schema for a movie site with user ratings and recommendations.
Create tables for movies, users, ratings, and recommendations
Use foreign keys to link tables
Include columns for movie genre and user watch history
Algorithm for recommendations can use user watch history and ratings to suggest similar movies
- Q7. By tossing a coin we can get either head or tail, i have a function toss() which return head or tail with equal probability
- Q8. You have to write a function for dice which will return number from 1-6 with equal probability. constraints : you can not use random function, you can use only toss function
- Ans.
Function to simulate dice roll with equal probability without using random function
Use a toss function that returns either 0 or 1 with equal probability
Call the toss function 3 times and convert the result to a binary number
If the binary number is greater than 0 and less than or equal to 6, return it
If the binary number is greater than 6, repeat the process
- Q9. Write a query to fetch duplicate email from table?
- Ans.
Query to fetch duplicate email from table
Use GROUP BY and HAVING clause to filter out duplicates
SELECT email, COUNT(*) FROM table_name GROUP BY email HAVING COUNT(*) > 1;
This will return all the duplicate emails in the table
Interview Preparation Tips
College Name: na
Motivation: Practo is the market leader in digital healthcare management with millions of consumers using our products to find doctors, book appointments and manage their healthcare efficiently. Practo Ray is the platform of choice for the vast majority of doctors and clinics deploying cloud based clinic management solution.I recently got an offer from Practo, here is my interview experience:
Skills evaluated in this interview
I was interviewed before Apr 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
- Q1.
Balanced Parentheses Combinations
Given an integer
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- Ans.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - Ans.
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
- Q3.
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
- 0 - representing an empty cell
- 1 - representing a fre...
- Ans.
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
- Q1.
Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions t...
- Ans.
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
- Q2.
Merge Intervals Problem Statement
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
- Ans.
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
- Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
(4 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
- Q1.
Binary Tree Diameter Problem Statement
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
- Ans.
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
- Q2.
Power of 2 Problem Statement
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
Input:
The fir... - Ans.
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
- Q3. What are some advantages of using Object-Oriented Programming (OOP)?
- Ans.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
- Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
- Ans.
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
(1 Question)
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
- Q1. Why should we hire you?
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I was interviewed in Aug 2021.
(3 Questions)
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
- Q1.
Intersection of Two Unsorted Arrays Problem Statement
Given two integer arrays
ARR1andARR2of sizes 'N' and 'M' respectively, find the intersection of these arrays. The intersection is defined as the se... - Ans.
Find the intersection of two unsorted arrays while maintaining the order of elements from the first array.
Iterate through the elements of the first array and check if they exist in the second array.
Use a hash set to keep track of elements already seen in the second array for efficient lookup.
Maintain the order of elements from the first array while finding the intersection.
Handle duplicate elements in both arrays appro...
- Q2.
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
- Ans.
The task is to determine the total number of ways to make change for a specified value using given denominations.
Create a function that takes in the number of denominations, the denominations array, and the value to make change for as input
Use dynamic programming to iterate through all possible combinations of coins to make the specified value
Keep track of the number of ways to make change for each value from 0 to the ...
- Q3.
Longest Substring Without Repeating Characters Problem Statement
Given a string
Sof lengthL, determine the length of the longest substring that contains no repeating characters.Example:
Input:
"abac...
- Ans.
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is encountered.
Calculate the maximum length of the substring as you iterate through the string.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round started with 2 coding questions and then moved on to some more questions from OOPS.
- Q1.
Palindrome Linked List Problem Statement
You are provided with a singly linked list of integers. Your task is to determine whether the given singly linked list is a palindrome. Return
trueif it is a pali... - Ans.
Check if a given singly linked list is a palindrome or not.
Traverse the linked list to find the middle element using slow and fast pointers.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it's a palindrome.
- Q2.
Search Element in a Rotated Sorted Array
Given a sorted array that has been rotated, the task is to find the index of a specific element. The array is initially sorted in ascending order and then rotated ...
- Ans.
Search for an element in a rotated sorted array efficiently in O(logN) time complexity.
Implement binary search to find the pivot point where rotation occurs.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle cases where the element may be in the left or right subarray after rotation.
Return the index of the element if found, else return -1.
- Q3. What is a static variable in C?
- Ans.
A static variable in C is a variable that retains its value between function calls.
Declared using the 'static' keyword
Retains its value throughout the program's execution
Useful for maintaining state across function calls
- Q4. What is the difference between abstraction and inheritance?
- Ans.
Abstraction is hiding the implementation details while inheritance is a mechanism for creating new classes using existing classes.
Abstraction focuses on hiding the internal implementation details of a class, allowing the user to only interact with the necessary information.
Inheritance allows a class to inherit properties and behavior from another class, promoting code reusability and creating a hierarchy of classes.
Abs...
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round had questions mainly from HTML,CSS and JavaScript as I had mentioned some Frontend Projects in my resume so the interviewer wanted to check my skills on those. He also asked me some SQL queries and a simple coding question towards the end of the interview.
- Q1. What is event bubbling in JavaScript?
- Ans.
Event bubbling is the process where an event triggered on a child element is propagated up through its parent elements.
In event bubbling, when an event occurs on a child element, it first runs the event handlers on the child element, then on its parent, then all the way up to the top level of the DOM.
Event bubbling allows for delegation of event handling to a parent element, reducing the number of event listeners neede...
- Q2. How can you optimize the loading of website assets?
- Ans.
Optimizing website asset loading involves minimizing file sizes, reducing HTTP requests, utilizing caching, and prioritizing critical resources.
Minimize file sizes by compressing images, scripts, and stylesheets.
Reduce HTTP requests by combining files, using sprites, and lazy loading non-essential resources.
Utilize browser caching to store static assets locally for faster subsequent page loads.
Prioritize critical resou...
- Q3. In how many ways can you display HTML elements?
- Ans.
There are multiple ways to display HTML elements, including inline, block, inline-block, and flex.
HTML elements can be displayed as inline, which allows them to flow with surrounding content.
Block elements take up the full width available and start on a new line.
Inline-block elements are displayed as blocks, but flow like inline elements.
Flexbox allows for more advanced layout options, such as aligning items and distri
- Q4.
Check if Two Strings are Anagrams
Anagrams are words or names that can be formed by rearranging the letters of another word. For instance, 'spar' can be rearranged to form 'rasp', making them anagrams.
E...
- Ans.
Check if two strings are anagrams by rearranging their letters.
Create a frequency map of characters for both strings
Compare the frequency maps to check if they are equal
Return True if the frequency maps are equal, else False
(2 Questions)
Round duration - 30 minutes
Round difficulty - Easy
This is a cultural fitment testing round. HR was very frank and asked standard questions. Then we discussed about my role.
- Q1. What is something about you that is not included in your resume?
- Q2. Why should we hire you?
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
2 Questions
- Q1. About sdlc
- Q2. About web development
I applied via LinkedIn and was interviewed in Jul 2024. There was 1 interview round.
Coding test based on Binary trees, String Manipulation
HAckerrank based test
I was interviewed in Jan 2021.
(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.
- 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.
(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 elementXis 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...
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. 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
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
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
- Q1.
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
- Ans.
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
- Q2.
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...
- Ans.
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
- Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
- Ans.
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Interview Preparation Tips
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Skills evaluated in this interview
Tata 1mg Interview FAQs
Tell us how to improve this page.
Tata 1mg Interviews By Designations
- Tata 1mg Pharmacist Interview Questions
- Tata 1mg Phlebotomist Interview Questions
- Tata 1mg Software Developer Interview Questions
- Tata 1mg Senior Pharmacist Interview Questions
- Tata 1mg Scientific Officer Interview Questions
- Tata 1mg Business Analyst Interview Questions
- Tata 1mg Team Lead Operations Interview Questions
- Tata 1mg Medical Laboratory Technician Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Senior Software Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Softwaretest Engineer Interview Questions
- Software Engineer Trainee Interview Questions
- Software Developer Interview Questions
- Software Developer Intern Interview Questions
- Junior Software Developer Interview Questions
- Show more
Tata 1mg Software Development Engineer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Fast track your campus placements
Tata 1mg Software Development Engineer Reviews and Ratings
based on 4 reviews
Rating in categories
|
Team Lead
259
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Senior Executive
255
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Pharmacist
250
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
185
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Executive
144
salaries
| ₹0 L/yr - ₹0 L/yr |
PharmEasy
Netmeds.com
Medlife
Practo
- Home >
- Interviews >
- Tata 1mg Interview Questions >
- Tata 1mg Software Development Engineer Interview Questions
