Premium Employer

i

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

Tesco Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Tesco Software Development Engineer 3 Interview Questions, Process, and Tips

Updated 10 Jun 2024

Top Tesco Software Development Engineer 3 Interview Questions and Answers

  • Q1. Find overlapping interval to calculate final payment for store worker
  • Q2. Design a mook-my-show type of system for companies. Companies can define schedule of event, number of seats available and prices if any. Only employee of company should b ...read more
  • Q3. Offline store management system

Tesco Software Development Engineer 3 Interview Experiences

3 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Jul 2023. There were 2 interview rounds.

Round 1 - Coding Test 

In 60 mins, you have to write a text wrap library. Code should be clean, and modular and should have ways to make it more usable.

Round 2 - Technical 

(1 Question)

  • Q1. Design a mook-my-show type of system for companies. Companies can define schedule of event, number of seats available and prices if any. Only employee of company should be able to book show.
  • Ans. 

    Design a system for companies to schedule events, manage seats, and allow only employees to book shows.

    • Create a database to store company information, event schedules, seat availability, and employee details

    • Implement an authentication system to verify employee credentials

    • Develop a user interface for companies to define event schedules, seat availability, and prices

    • Allow employees to search and book shows based on their...

  • Answered by AI

Skills evaluated in this interview

Rate your
company

🤫 100% anonymous

How was your last interview experience?

Share interview

I applied via Referral and was interviewed in Apr 2022. There were 4 interview rounds.

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 

Ds Algo question on Merge Interval with JUnit Coverage

Round 3 - Coding Test 

System Design discussion covering DR strategy, Rest API details, handling offline and online system processing.

Round 4 - Technical 

(5 Questions)

  • Q1. How you motivate Team
  • Ans. 

    Motivating a team involves setting clear goals, providing support and recognition, fostering a positive work environment, and promoting collaboration.

    • Set clear goals and communicate them effectively

    • Provide support and resources to help team members achieve their goals

    • Recognize and reward team members for their achievements

    • Create a positive work environment by promoting open communication and trust

    • Encourage collaboratio...

  • Answered by AI
  • Q2. Tell me about your weakness
  • Ans. 

    I tend to be overly critical of my own work.

    • I have high standards for myself and strive for perfection.

    • I often spend extra time reviewing and revising my work to ensure it meets my expectations.

    • I sometimes struggle with accepting compliments or recognizing my achievements.

    • I am actively working on finding a balance between self-improvement and self-acceptance.

  • Answered by AI
  • Q3. Offline store management system
  • Ans. 

    An offline store management system is a software that helps manage inventory, sales, and customer data in a physical store without an internet connection.

    • The system should have a database to store product information, sales data, and customer information.

    • It should have a user-friendly interface for employees to input and access data.

    • The system should be able to generate reports on sales, inventory levels, and customer ...

  • Answered by AI
  • Q4. Write code for Boggle game
  • Ans. 

    Code for Boggle game

    • Create a 2D grid of letters

    • Generate all possible words using the grid and a dictionary

    • Implement a search algorithm to find valid words

    • Track score based on word length and rarity

    • Allow for multiple players and rounds

  • Answered by AI
  • Q5. Find overlapping interval to calculate final payment for store worker
  • Ans. 

    Finding overlapping intervals for calculating final payment of store worker

    • Identify all the intervals for which the worker is eligible for payment

    • Check for overlapping intervals and merge them

    • Calculate the final payment based on the merged intervals

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Tesco Software Development Engineer 3 interview:
  • Merge Interval
  • Graphs
  • LinkedList
  • JUnit
  • System Design
Interview preparation tips for other job seekers - Stick to basics and practice lot of questions on Merge Interval, Graph DFS, BFS.
Understand the basics of System Design and the importance of Authentication, DR management.

Skills evaluated in this interview

Software Development Engineer 3 Interview Questions Asked at Other Companies

asked in Fiserv
Q1. What are triggers , where can they be used ? What is a mutating t ... read more
asked in Tesco
Q2. Find overlapping interval to calculate final payment for store wo ... read more
asked in Fiserv
Q3. How to define a parameterized cursor in PLSQL , how to open and c ... read more
asked in Fiserv
Q4. What is Rownum ? Is expression Rownum >4 correct ?
asked in Tesco
Q5. Design a mook-my-show type of system for companies. Companies can ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - Coding Test 

React Context Question

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Laravel based questions
Round 2 - HR 

(1 Question)

  • Q1. Basic questions

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Aug 2017.

Interview Questionnaire 

7 Questions

  • Q1. Implement Merge Sort.
  • Ans. 

    Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
  • Ans. 

    Find pairs of integers in a BST whose sum is equal to a given number.

    • Traverse the BST and store the values in a hash set.

    • For each node, check if (X - node.value) exists in the hash set.

    • If yes, add the pair (node.value, X - node.value) to the result.

    • Continue traversal until all nodes are processed.

  • Answered by AI
  • Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
  • Ans. 

    Merge overlapping time intervals into mutually exclusive intervals.

    • Sort the intervals based on their start time.

    • Iterate through the intervals and merge overlapping intervals.

    • Output the mutually exclusive intervals.

    • Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]

  • Answered by AI
  • Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
  • Ans. 

    Different types of hashing and alternative for Linear Chaining

    • Different types of hashing include division, multiplication, and universal hashing

    • Alternative for Linear Chaining is Open Addressing

    • Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing

  • Answered by AI
  • Q5. Implement AVL Tree.
  • Ans. 

    An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.

    • AVL tree is a binary search tree with additional balance factor for each node.

    • The balance factor is the difference between the heights of the left and right subtrees.

    • Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.

    • Rotations are performed ...

  • Answered by AI
  • Q6. Minimum number of squares whose sum equals to given number n.
  • Ans. 

    Find the minimum number of squares whose sum equals to a given number n.

    • Use dynamic programming to solve the problem efficiently.

    • Start with finding the square root of n and check if it is a perfect square.

    • If not, then try to find the minimum number of squares required for the remaining number.

    • Repeat the process until the remaining number becomes 0.

    • Return the minimum number of squares required for the given number n.

  • Answered by AI
  • Q7. Insertion sort for a singly linked list.
  • Ans. 

    Insertion sort for a singly linked list.

    • Traverse the list and compare each node with the previous nodes

    • If the current node is smaller, swap it with the previous node

    • Repeat until the end of the list is reached

    • Time complexity is O(n^2)

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22

Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.

Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.

College Name: The LNM Institute Of Information Technology, Jaipur

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

    • Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. DS Algo Questions on Trees. Leadership Principles

Interview Preparation Tips

Interview preparation tips for other job seekers - Read up on DS Algo and white paper coding and Leadership Principles
Contribute & help others!
anonymous
You can choose to be anonymous

Tesco Interview FAQs

How many rounds are there in Tesco Software Development Engineer 3 interview?
Tesco interview process usually has 2-3 rounds. The most common rounds in the Tesco interview process are Coding Test, Technical and Resume Shortlist.
What are the top questions asked in Tesco Software Development Engineer 3 interview?

Some of the top questions asked at the Tesco Software Development Engineer 3 interview -

  1. Find overlapping interval to calculate final payment for store wor...read more
  2. Design a mook-my-show type of system for companies. Companies can define schedu...read more
  3. Offline store management sys...read more

Recently Viewed

REVIEWS

Future Retail

No Reviews

INTERVIEWS

Tesco

No Interviews

INTERVIEWS

Tesco

No Interviews

REVIEWS

Spencer's Retail

No Reviews

INTERVIEWS

Tesco

No Interviews

REVIEWS

Future Group

No Reviews

SALARIES

Tesco

REVIEWS

Tesco

No Reviews

COMPANY BENEFITS

Spencer's Retail

No Benefits

COMPANY BENEFITS

Future Retail

No Benefits

Tell us how to improve this page.

Tesco Software Development Engineer 3 Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more

Anonymously discuss salaries, work culture, and many more

Get Ambitionbox App

Join Tesco Creating sustainable competitive advantage for Tesco

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5k Interviews
Reliance Retail Interview Questions
3.9
 • 1.5k Interviews
DMart Interview Questions
3.9
 • 403 Interviews
Walmart Interview Questions
3.8
 • 386 Interviews
BigBasket Interview Questions
3.9
 • 358 Interviews
Titan Company Interview Questions
4.3
 • 149 Interviews
Landmark Group Interview Questions
4.0
 • 147 Interviews
V-Mart Interview Questions
4.1
 • 146 Interviews
Lowe's Interview Questions
4.1
 • 127 Interviews
View all
Tesco Software Development Engineer 3 Salary
based on 57 salaries
₹39.9 L/yr - ₹102 L/yr
92% more than the average Software Development Engineer 3 Salary in India
View more details

Tesco Software Development Engineer 3 Reviews and Ratings

based on 8 reviews

2.3/5

Rating in categories

2.4

Skill development

2.2

Work-life balance

2.6

Salary

3.0

Job security

2.4

Company culture

1.8

Promotions

2.2

Work satisfaction

Explore 8 Reviews and Ratings
Senior Associate
478 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer II
210 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
203 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
180 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
155 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Tesco with

Walmart

3.8
Compare

Carrefour

3.6
Compare

Amazon

4.1
Compare

Reliance Retail

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