Filter interviews by
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...
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 ...
The second largest salary in a database management system (DBMS) can be found by using the ORDER BY and LIMIT clauses in a SQL query.
Use the ORDER BY clause to sort the salaries in descending order
Use the LIMIT clause to retrieve the second row in the sorted result set
Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT 1,1
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.
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
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...
The Hungarian algorithm finds the optimal assignment in a weighted bipartite graph, minimizing total cost.
1. The algorithm works on a cost matrix representing the cost of assigning tasks to agents.
2. It uses a series of steps: subtracting row and column minima, covering zeros, and adjusting the matrix.
3. Example: For a 3x3 cost matrix, it finds the minimum cost assignment by iteratively refining the matrix.
4. The ...
DFS and BFS are two popular graph traversal algorithms used in computer science.
DFS stands for Depth First Search and explores as far as possible along each branch before backtracking.
BFS stands for Breadth First Search and explores all the vertices at the present depth before moving on to the next level.
DFS uses a stack data structure to keep track of visited nodes while BFS uses a queue.
DFS is useful for finding...
Double pointers are used to store the address of a pointer variable.
Double pointers are useful in dynamic memory allocation.
They are used to modify the value of a pointer passed to a function.
They can be used to create linked lists and trees.
Example: int **ptr; //declares a double pointer to an integer
Permutations of an array
Permutations are all possible arrangements of elements in an array
Number of permutations for an array of length n is n!
Use recursion to generate all permutations
Swap elements to generate different permutations
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
Assistant Manager
1k
salaries
| ₹9.3 L/yr - ₹15.1 L/yr |
Software Engineer
949
salaries
| ₹11.6 L/yr - ₹20 L/yr |
Sales Executive
893
salaries
| ₹1.8 L/yr - ₹5.5 L/yr |
Manager
520
salaries
| ₹15.5 L/yr - ₹28.3 L/yr |
Senior Engineer
470
salaries
| ₹7.9 L/yr - ₹14.7 L/yr |
Apple
vivo
OPPO
Dell