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

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Tata 1mg Sdet Engineer Interview Questions and Answers

Updated 27 Aug 2024

Tata 1mg Sdet Engineer Interview Experiences

1 interview found

Sdet Engineer Interview Questions & Answers

user image Anonymous

posted on 27 Aug 2024

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

2 question of DSA (easy, medium) in 60 minutes

Round 2 - One-on-one 

(2 Questions)

  • Q1. Playlist Shuffle
  • Q2. Deletion in min heap
  • Ans. 

    Deletion in min heap involves removing the root node and rearranging the heap to maintain the min heap property.

    • To delete the root node in a min heap, swap it with the last node in the heap.

    • Remove the last node and then heapify the heap starting from the root to maintain the min heap property.

    • Example: If the min heap is [10, 20, 30, 25, 40], after deletion the heap becomes [20, 25, 30, 40].

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Fair and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(5 Questions)

  • Q1. Difference between Severity, Priority and criticality?
  • Ans. 

    Severity, Priority, and Criticality are different aspects of issue management in software testing.

    • Severity refers to the impact of a defect on the system's functionality.

    • Priority indicates the order in which defects should be fixed based on business needs.

    • Criticality combines severity and priority to determine the overall importance of a defect.

    • For example, a defect causing a system crash would have high severity, high...

  • Answered by AI
  • Q2. What id Equivalence partitioning?
  • Ans. 

    Equivalence partitioning is a software testing technique where input data is divided into partitions and only one value from each partition is tested.

    • Input data is divided into groups or partitions based on similar characteristics

    • One value from each partition is selected as a representative for testing

    • Helps in reducing the number of test cases while ensuring maximum coverage

    • Example: Testing a login form with valid, inv

  • Answered by AI
  • Q3. What id BackWord Compatibility?
  • Ans. 

    Backward compatibility refers to the ability of a system to accept input intended for an older version of the system.

    • Allows newer versions of software to work with data or systems from older versions

    • Ensures that changes in the software do not break compatibility with existing data or systems

    • Helps in smooth transition and adoption of new versions without disrupting existing processes

  • Answered by AI
  • Q4. What is Paradox in testing ?
  • Ans. 

    A paradox in testing refers to a situation where a test case both passes and fails at the same time.

    • Paradox in testing can occur when a test case has conflicting requirements or conditions.

    • It can also happen when there are errors in the test setup or execution that lead to unexpected results.

    • For example, a test case may pass when run individually but fail when run as part of a test suite due to dependencies.

    • Identifying...

  • Answered by AI
  • Q5. What id post put and patch?
  • Ans. 

    PUT and PATCH are HTTP methods used for updating resources in RESTful APIs.

    • PUT is used to update or replace an existing resource entirely

    • PATCH is used to partially update an existing resource

    • PUT is idempotent, meaning multiple identical requests will have the same effect as a single request

    • PATCH is not idempotent, meaning multiple identical requests may have different effects

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Things about yourself
  • Q2. I spoke about experience and what i am interested in.
Round 2 - Coding Test 

Take away home - coding task

QA Engineer Interview Questions & Answers

Swiggy user image Kumar Mayank

posted on 25 Jul 2023

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Binary Search questions were asked

Round 3 - Coding Test 

Peak in a mountain array question were asked

Round 4 - HR 

(2 Questions)

  • Q1. Salary Questions were asked
  • Q2. Salaryyy questions were asked

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and dont loose hope at last you will get success

Software Engineer Interview Questions & Answers

Medlife user image nerella saikrishna

posted on 9 Jan 2016

Interview Questionnaire 

12 Questions

  • Q1. Insert a node in a Linked List, if a pointer to a node(it's not a head pointer) of Linked List is given.
  • Q2. What is the Time Complexity of Binary Search and it's derivation
  • Ans. 

    Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.

    • Binary Search is a search algorithm that works on sorted arrays.

    • It starts by comparing the target value to the middle element of the array.

    • If the target value is smaller, the search continues on the lower half of the array.

    • If the target value is larger, the search continues on the upper half of the array.

    • T...

  • Answered by AI
  • Q3. Write code for QuickSort
  • Ans. 

    QuickSort is a sorting algorithm that uses divide and conquer approach.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot

    • Recursively apply the above steps to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q4. Write code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
  • Ans. 

    Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming

    • Recursion: Define a function that calls itself with the previous two numbers in the series as arguments

    • Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration

    • Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series

  • Answered by AI
  • Q5. How to implement an operation with Stacks which will be similar to Queue
  • Ans. 

    Implementing a Queue using Stacks

    • Use two stacks to implement a queue

    • Push elements onto the first stack

    • When dequeuing, pop all elements from the first stack and push onto the second stack

    • Pop the top element from the second stack to dequeue

    • If the second stack is empty, pop all elements from the first stack and push onto the second stack

  • Answered by AI
  • Q6. Write code for MergeSort
  • Ans. 

    MergeSort is a divide and conquer algorithm that sorts an array of strings.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q7. 2 types of detective ball puzzles
  • Q8. 25 Horses, 5 Tracks, 3 Fastest Puzzle
  • Q9. How the letters of a text are determined(Basically about OCR)
  • Q10. Write code for Insertion Sort and Selection Sort and find their time complexities and also the cases where their usage is efficient
  • Q11. Explain about Counting Sort
  • Ans. 

    Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.

    • Count the occurrences of each element in the array

    • Calculate the cumulative sum of the counts

    • Place each element in the sorted array based on its count and cumulative sum

    • Time complexity is O(n+k) where n is the number of elements and k is the range of input

    • Example: Sort an array of strings based on their

  • Answered by AI
  • Q12. When we type a part of a word in chrome, how is it able to show all the types of words, which are consisted of that part
  • Ans. 

    Chrome uses an algorithm to predict and suggest words based on user input.

    • Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.

    • The algorithm also takes into account the frequency and recency of the user's input.

    • Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.

    • The suggestions are di...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: First Question, at the start I was not able to answer and he gave me an hint(He asked me the insertion in an array). So, I got the idea for the insertion in Linked List and was able to answer it.
Remaining questions, I was able to answer confidently.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I was able to answer all the questions confidently, since I know the answers for them, But the last question was out of my scope and I explained based on my intuition and knowledge.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I have given the answers for 1&2 questions with clear explanation. And the third question is again out of my scope and I explained this also based intuition.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

General Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skill Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skills: Logical Puzzles, Algorithms And DataStructures
College Name: IIT Madras
Motivation: 1. Primary Reason: Passionate about Programming and Problem solving.
2. The profile is software Engineer.
3. You can see your idea, having an impact on the society which is possible with this type of company.
4. And a good package.
Funny Moments: Nothing Really...

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Practo user image BEKKAM VENKATA ADITYA

posted on 27 Sep 2015

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. General questions. Where are you from, tell about yourself etc..,
  • Q2. Asked me about the projects which i have mentioned in my resume
  • Q3. Some algorithmic questions including data structures. Time complexity, space complexity etc.,
  • Q4. How would you design a snake game present in basic nokia mobiles. Just the data structure part and some functions which are used as the game goes on

Interview Preparation Tips

Round: Test
Experience: A bit difficult but sensible way to get started with the selection procedure. Questions purely attack the algorithmic and stastitic aspects.
Tips: Get yourself ready with conceptual clartity regarding algorithms and stastics . Don't be ambitious to attempt all the questions, completely solving one problem would be more than enough for getting through this level.
Duration: 120 minutes
Total Questions: 3

Round: Technical Interview
Experience: Believe me. You never feel inferior, it's really interactive and very friendly. Interviewer gave me a few chances and hints whenever i've gone wrong. Overall interview experience was awesome.
Tips: If you're up to this round, they believe you have the potential. So don't panic if you are unable to answer their questions. Just tell them which aspects which you are comfortable with and they will proceed correspondingly, Just be honest whatsoever.

Skill Tips: Prefer having some revision about the above skills before undergoing the selection process.
Skills: Math Puzzles, Algorithmic Approach To Problem Solving, Data Structures
Duration: 2months
College Name: IIT Madras
Funny Moments: Receiving the offer letter from HR official who visited our campus :)

Interview Preparation Tips

Round: Test
Experience: There was Pool Campus Placement of  4 Colleges together(NIT Jalandhar,NIT Hamirpur ,Candigarh University and CGC Landran ) at Chandigarh University.Written test was taken on Hacker Rank. There were 5 Coding Questions of Linklist , Dynamic Programming,Priority Queues etc . 
You didn't have to do All the questions (3 can get you to the next round).

One thing that need to be beware of is that on Hacker Rank Your Draft is Saved every second(or so). So don't copy from the internet and just paste there(they will get to know).
Tips: Make sure you practice lot of Algorithms.
Duration: 120 minutes
Total Questions: 5

Round: Problem Statement
Experience: Only 8 Students were selected for this round
20 mins were given for it
and afterwards each student had personal discussion(10 mins) with them to explain their schema .
3-4 Questions were also asked related to your schema and how to perform a particular query
Tips: You should Be Through with DBMS
Make sure there is no redundant table and Primary keys are marked

Round: Technical Interview
Experience: 2 were selected for the Interview
Firstly they make you very Comfortable and ask how were the previous Rounds.
Then they asked about the two questions of First Round and my approach 
Then couple of questions on The design that was made Earlier.
Then there were questions on How Internet Works ,gcc,Linux,git,sql.

Then the Interviewer asked if I have any question
I asked about (as the work on doctor's app) how they know the credibility of a doctor which is enlisted in their app.
Interviewer was really Impressed by the question and told me all about it with all details.


Both were selected
Tips: Be cool in the Interview
Think Loudly and Interact with them well.
If they want you to ask any question ,it should not be related to technical stuff ,it should be related to the company

College Name: NIT JALANDHAR

I applied via Referral

Interview Questionnaire 

5 Questions

  • Q1. I was asked to optimize the last program mentioned above
  • Q2. I was asked in detail about my internship experience and projects
  • Q3. I was asked why I did not contribute to any open source projects
  • Q4. I was asked to explain the code of my android app from my dropbox account
  • Q5. The usual HR questions followed after that

Interview Preparation Tips

Skills:
College Name: NA
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Selected Selected

I applied via Campus Placement

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

1 Hour 2 Medium Coding Question and few DB OOPS OS Questions on Hackerearth

Round 3 - One-on-one 

(2 Questions)

  • Q1. Coding 1 : 1 Round
  • Q2. 2 Sum, 3 Sum, Maximum Sum Subarray
Round 4 - Behavioral 

(2 Questions)

  • Q1. Questions based on Resume, OOPS, Databases, OS
  • Q2. ACID Properties, Keys questions, Semaphore mutex
Interview experience
4
Good
Difficulty level
-
Process Duration
Less than 2 weeks
Result
Not Selected

I was interviewed in Nov 2023.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Coding Test 

Questions were based on Computer Science Fundamentals, Coding and SQL

Round 3 - Technical 

(1 Question)

  • Q1. 3 coding questions, 1 MCQ of data structures and 1 SQL
Round 4 - Behavioral 

(1 Question)

  • Q1. 1 coding question, other questions were based on my projects and hr based questions
Contribute & help others!
anonymous
You can choose to be anonymous

Tata 1mg Interview FAQs

How many rounds are there in Tata 1mg Sdet Engineer interview?
Tata 1mg interview process usually has 2 rounds. The most common rounds in the Tata 1mg interview process are Coding Test and One-on-one Round.
What are the top questions asked in Tata 1mg Sdet Engineer interview?

Some of the top questions asked at the Tata 1mg Sdet Engineer interview -

  1. Deletion in min h...read more
  2. Playlist Shuf...read more

Recently Viewed

JOBS

Browse jobs

Discover jobs you love

COMPANY BENEFITS

KNR Constructions

20 benefits

COMPANY BENEFITS

IRB Infrastructure

60 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

COMPANY BENEFITS

Dilip Buildcon

304 benefits

SALARIES

Fourkites

INTERVIEWS

Mobikwik

No Interviews

JOBS

Mobikwik

No Jobs

SALARIES

Fourkites

SALARIES

Ford Motor

Tell us how to improve this page.

Tata 1mg Sdet Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
Join Tata 1mg We bring you closer to better health

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 425 Interviews
Udaan Interview Questions
4.0
 • 333 Interviews
CARS24 Interview Questions
3.6
 • 329 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Blinkit Interview Questions
3.7
 • 180 Interviews
BlackBuck Interview Questions
3.8
 • 175 Interviews
Digit Insurance Interview Questions
4.0
 • 142 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
Urban Company Interview Questions
3.4
 • 134 Interviews
Ninjacart Interview Questions
4.0
 • 94 Interviews
View all
Tata 1mg Sdet Engineer Salary
based on 4 salaries
₹10 L/yr - ₹15.5 L/yr
8% less than the average Sdet Engineer Salary in India
View more details
Team Lead
259 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Executive
255 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Pharmacist
250 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
185 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Executive
144 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Tata 1mg with

PharmEasy

3.7
Compare

Netmeds.com

3.6
Compare

Medlife

3.7
Compare

Practo

3.2
Compare
Did you find this page helpful?
Yes No
write
Share an Interview