Filter interviews by
Convert a linked list to a number by interpreting each node's value as a digit, handling edge cases like empty lists.
Node Representation: Each node in the linked list contains a digit (0-9) and a reference to the next node.
Constructing the Number: Traverse the linked list, multiplying the current number by 10 and adding the node's value.
Example: For a linked list 2 -> 4 -> 3, the number is 243 (2*100 + 4*10 ...
Mutex and Semaphore are synchronization primitives used in multi-threaded environments.
Mutex is used to provide mutual exclusion to a shared resource, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it at a time.
Mutex is binary, meaning it has only two states - locked and unlocked, while Semaphore can have multiple states...
Deadlock is a situation where two or more processes are unable to proceed because they are waiting for each other to release resources.
Prevent deadlock by using a proper resource allocation strategy
Avoid holding onto resources for too long
Use timeouts to release resources if they are not being used
Implement a deadlock detection and recovery mechanism
Avoid circular wait by imposing a total ordering of all resource ...
Time complexity of building a heap using linked list and arrays
Building a heap using linked list takes O(nlogn) time complexity
Building a heap using arrays takes O(n) time complexity
Linked list implementation is slower than array implementation
Given a string S
which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequency...
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
Sort the digits in non-increasing order to find the next greater number.
Swap the last two digits to get the smallest greater number.
If no greater number exists, return -1.
Given two arbitrary binary trees consisting of 'N' and 'M' number of nodes respectively, your task is to check whether the two trees are mirror images of each other or not.
Check if two binary trees are mirror images of each other.
Compare the left subtree of the first tree with the right subtree of the second tree.
Compare the right subtree of the first tree with the left subtree of the second tree.
Check if the roots of both trees are the same.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine the...
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 above each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water above each bar to get the total trapped water for the entire array.
You are provided with an array nums
which contains the first N positive integers. In this array, one integer appears twice, and one integer is missin...
Given an array of first N positive integers with one number repeating and one missing, find the repeating and missing numbers.
Iterate through the array and keep track of the sum of elements and sum of squares to find the missing and repeating numbers.
Use a set to identify the repeating number and calculate the missing number based on the sum of elements.
Example: For nums = [1, 2, 3, 4, 4, 5], the repeating number ...
Structure and union are both used to group different data types, but structure allocates memory for each member separately while union shares the same memory space for all members.
Structure allocates memory for each member separately, while union shares the same memory space for all members.
Structures are used when each member needs its own memory space and unions are used when only one member is accessed at a tim...
Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.
Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly.
Multithreading enables a single process to execute multiple threads concurrently, sharing resources like memory and CPU.
Multita...
I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.
Calculate the sum of elements in an array that are closest to a given target value.
Iterate through the array and calculate the absolute difference between each element and the target value.
Keep track of the element with the smallest difference and update the sum accordingly.
Return the sum of elements closest to the target value.
I appeared for an interview in May 2025, where I was asked the following questions.
This question involves processing an array containing only 1's and 2's, focusing on their arrangement or counting.
Count the number of 1's and 2's in the array. Example: [1, 2, 1] -> 2 ones, 1 two.
Sort the array to group all 1's followed by 2's. Example: [2, 1, 1] -> [1, 1, 2].
Find the maximum or minimum value in the array. Example: In [1, 2, 1], max is 2, min is 1.
Check if the array is balanced (equal number of 1...
Find the maximum sum of a contiguous subarray in an integer array using Kadane's algorithm.
Use Kadane's algorithm for an efficient O(n) solution.
Initialize two variables: maxSum and currentSum.
Iterate through the array, updating currentSum and maxSum.
Example: For nums = [-2,1,-3,4,-1,2,1,-5,4], maxSum = 6 (subarray [4,-1,2,1]).
If currentSum drops below 0, reset it to 0.
Basic DSA Question on Recursion , DFS, BFS
Insert a node in a N-array tree
Traverse the tree to find the parent node where the new node will be inserted
Add the new node as a child of the parent node
Update the parent node's child array to include the new node
I applied via Referral and was interviewed in May 2024. There was 1 interview round.
The coding from DSA topics
I applied via Campus Placement
1. Online test in campus (1 question, 3hrs - 2018)/
2. Group discussion
3. In person campus interview
I applied via Campus Placement and was interviewed in Nov 2023. There were 3 interview rounds.
3 hr test 1 question
I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.
Two leetcode problems
I am a passionate software developer with experience in Java, Python, and web development.
Graduated with a degree in Computer Science
Worked on multiple projects using Java and Python
Familiar with web development technologies like HTML, CSS, and JavaScript
Strong problem-solving skills and ability to work in a team
In 5 years, I see myself as a senior software developer leading a team on innovative projects.
Continuing to enhance my technical skills and knowledge through ongoing learning and certifications
Taking on more leadership responsibilities and mentoring junior developers
Contributing to the success and growth of the company through my expertise and dedication
I applied via Referral and was interviewed in Mar 2023. There were 3 interview rounds.
The aptitude test is about your basic knowledge in software developing.
JAVA is a versatile programming language used for developing various software applications.
JAVA is platform-independent and can run on any operating system
It is object-oriented and supports multithreading
JAVA is widely used for developing web applications, mobile applications, and enterprise software
It provides a vast library of pre-built classes and APIs for developers to use
JAVA is also used for developing games, sci...
I appeared for an interview before Apr 2024, where I was asked the following questions.
Design a ticket booking system for events, movies, and shows with user-friendly features and efficient backend management.
User Registration: Allow users to create accounts for personalized experiences.
Event Listings: Display available events with details like date, time, and venue.
Seat Selection: Provide an interactive seating chart for users to choose their seats.
Payment Gateway: Integrate secure payment options for t...
Convert a linked list to a number by interpreting each node's value as a digit, handling edge cases like empty lists.
Node Representation: Each node in the linked list contains a digit (0-9) and a reference to the next node.
Constructing the Number: Traverse the linked list, multiplying the current number by 10 and adding the node's value.
Example: For a linked list 2 -> 4 -> 3, the number is 243 (2*100 + 4*10 + 3).
...
I appeared for an interview in Apr 2022.
Round duration - 90 Minutes
Round difficulty - Easy
It was conducted on the cubes platform. We were given 2 coding questions to solve in 90 minutes.
I solved both the problems within 25 min and checked for different test cases manually for more than 15 mins. There were only two test cases were visible and the rest are hidden. Even After submission, they didn’t show us whether all test cases pass not. So, before submission doesn’t forget to check for corner cases manually. One needs to pass all test cases as low as time possible.
Given a string S
which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
Sort the digits in non-increasing order to find the next greater number.
Swap the last two digits to get the smallest greater number.
If no greater number exists, return -1.
Given two arbitrary binary trees consisting of 'N' and 'M' number of nodes respectively, your task is to check whether the two trees are mirror images of each other or not.
Check if two binary trees are mirror images of each other.
Compare the left subtree of the first tree with the right subtree of the second tree.
Compare the right subtree of the first tree with the left subtree of the second tree.
Check if the roots of both trees are the same.
Tip 1 : Practice questions on leetcode
Tip 2 : Understand the best solutions in depth and algorithm used
Tip 3 : Ask clarifying questions to the interviewer and break the problem to smaller sub parts
Tip 1 : Highlight your most impactful work on the resume
Tip 2 : Keep it easy to understand
Top trending discussions
Some of the top questions asked at the Samsung Software Developer interview -
The duration of Samsung Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 12 interview experiences
Difficulty level
Duration
based on 34 reviews
Rating in categories
Sales Executive
1.1k
salaries
| ₹1 L/yr - ₹7 L/yr |
Assistant Manager
1k
salaries
| ₹5.5 L/yr - ₹20 L/yr |
Software Engineer
957
salaries
| ₹6.7 L/yr - ₹24 L/yr |
Manager
525
salaries
| ₹10 L/yr - ₹33.6 L/yr |
Area Sales Manager
513
salaries
| ₹7 L/yr - ₹27 L/yr |
Apple
vivo
OPPO
Dell