i
Tesco
Filter interviews by
Clear (1)
Memory management in linked lists involves allocation and deallocation of nodes.
Dynamic memory allocation is used to create nodes in a linked list.
Memory leaks can occur if nodes are not properly deallocated.
Freed memory should be returned to the operating system using free() function.
Using a garbage collector can automate memory management in linked lists.
Arrays are fixed in size and contiguous in memory, while linked lists are dynamic and non-contiguous.
Arrays have constant time access to elements, while linked lists require traversal.
Arrays are better for random access, while linked lists are better for insertion and deletion.
Arrays use less memory overhead, while linked lists use more due to pointers.
Examples: array of integers vs linked list of nodes.
Examples: array
Explaining algorithms for various problem statements
For sorting: bubble sort, insertion sort, merge sort, quick sort
For searching: linear search, binary search
For graph traversal: breadth-first search, depth-first search
For dynamic programming: Fibonacci sequence, knapsack problem
For string manipulation: string reversal, palindrome check
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Top trending discussions
I applied via Campus Placement and was interviewed before Nov 2023. There were 3 interview rounds.
Exam of 30 to 40 questions
Basic rules of accounting include the meaning of accounting and the golden rules of accounting.
Accounting is the process of recording, summarizing, analyzing, and reporting financial transactions.
The basic rules of accounting include the principles of conservatism, consistency, materiality, and full disclosure.
The golden rules of accounting are: Debit the receiver, Credit the giver; Debit what comes in, Credit what goe...
I applied via Walk-in and was interviewed in Feb 2023. There were 3 interview rounds.
I am a highly motivated and detail-oriented individual with a strong background in data analysis and problem-solving.
Proficient in data manipulation and analysis using tools like Excel, SQL, and Python.
Experienced in conducting statistical analysis and creating data visualizations.
Strong problem-solving skills with the ability to identify patterns and trends in data.
Excellent communication skills, both written and verb...
I am a highly motivated and detail-oriented individual with a strong background in finance and accounting.
Bachelor's degree in Finance
3 years of experience in financial analysis
Proficient in financial modeling and forecasting
Strong analytical and problem-solving skills
Excellent communication and interpersonal skills
Knowledge and skills refer to the understanding and abilities that an individual possesses.
Knowledge is the theoretical understanding of a subject or topic.
Skills are the practical abilities to perform tasks or apply knowledge.
Knowledge can be acquired through education, training, or experience.
Skills are developed through practice and hands-on experience.
Examples of knowledge include understanding of programming langu...
Qualification refers to the education, skills, and experience required for a particular job or role.
Qualification includes academic degrees, certifications, and relevant work experience.
It demonstrates the candidate's knowledge, expertise, and ability to perform the job.
Examples of qualifications can be a Bachelor's degree in Computer Science, a certification in project management, or 5 years of experience in marketing...
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
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.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
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.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedI was interviewed before Sep 2020.
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.
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...
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.
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
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
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.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
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.
The first line ...
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
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.
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.
I was interviewed in Aug 2017.
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
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.
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)]
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
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 ...
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.
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)
I applied via Company Website and was interviewed in May 2019. There were 4 interview rounds.
Implemented a new customer feedback system that increased customer satisfaction by 20%
Implemented a new customer feedback system to gather insights and improve customer experience
Analyzed feedback data to identify common issues and areas for improvement
Implemented changes based on feedback to address customer concerns and enhance overall satisfaction
Trained team members on how to effectively use the new system and inte...
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
based on 1 review
Rating in categories
Senior Associate
478
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
210
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
203
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
180
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
155
salaries
| ₹0 L/yr - ₹0 L/yr |
Walmart
Carrefour
Amazon
Reliance Retail