i
Samsung SDS
Filter interviews by
Online HackerRank 2 coding and 30 MCQ based test
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
Aptitude + Coding Round (Easy)
OOPS stands for Object-Oriented Programming System. Ranking in DBMS refers to the ordering of data in a database table.
OOPS is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
Ranking in DBMS refers to the process of arranging data in a specific order based on certain criteria, such as numerical values or alphabetical order.
Examples ...
I applied via Campus Placement and was interviewed before May 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jan 2022. There was 1 interview round.
Samsung SDS interview questions for designations
Top trending discussions
I applied via Campus Placement and was interviewed in Oct 2022. There were 3 interview rounds.
There was apti round with good apti questions and also code debugging
Angle between hands of clock at 10:25 is 147.5 degrees. Trains will collide at midpoint of their initial positions.
To calculate angle between hands of clock, use formula: |(30*H)-(11/2)*M|
For 10:25, H=10 and M=25, so angle = |(30*10)-(11/2)*25| = 147.5 degrees
When two trains are traveling towards each other, their relative speed is added to get the collision speed.
The collision point is the midpoint of their initial po...
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
Technical MCQ questions on core computer science subjects were asked.
posted on 16 Sep 2021
I appeared for an interview in Feb 2021.
Round duration - 60 Minutes
Round difficulty - Medium
It was a Coding round with 2 programming questions which need to solved in 60 minutes in any of the languages (C/C++/Java/Python)
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...
The problem involves determining if a ninja can reach the destination in a maze by moving in four directions until hitting a wall.
Create a function that takes in the maze, starting point, and destination coordinates as input.
Implement a recursive algorithm to explore all possible paths in the maze.
Check if the destination can be reached from the starting point by moving in four directions.
Return 'True' if a path exists
Given an array containing N
distinct positive integers and a number K
, determine the Kth largest element in the array.
N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order and return the Kth element.
Use a priority queue or quick select algorithm for efficient solution.
Ensure the array contains distinct positive integers for accurate result.
Round duration - 60 minutes
Round difficulty - Easy
It was in the morning at around 10 a.m conducted on Skype.
Given two sorted arrays A
and B
of sizes N
and M
, find the median of the merged array formed by combining arrays A
and B
. If the total number of elements, N + M
, is even, the m...
Find the median of two sorted arrays by merging them and calculating the median of the combined array.
Merge the two sorted arrays into one sorted array.
Calculate the median of the merged array based on the total number of elements.
If the total number of elements is even, take the mean of the two middle elements as the median.
Given a binary tree and the values of two distinct nodes, determine the distance between these two nodes in the tree. The distance is defined as the minimum num...
Calculate the distance between two nodes in a binary tree.
Traverse the tree to find the paths from the root to each node
Find the lowest common ancestor of the two nodes
Calculate the distance by summing the distances from each node to the common ancestor
Round duration - 20 minutes
Round difficulty - Easy
A HR Round in which the interviewer discussed about me and some things about my resume (Achievements, Projects etc.)
Tip 1 : Practice atleast 20-30 Questions for each topic in DSA
Tip 2 : Try to make some projects which solve real world problems.
Tip 3 : Try to host your project, so that interviewer can try the project hands on.
Tip 1 : Never put anything which you don't know on your resume
Tip 2 : Keep your resume up to the point. Don't overfill it with things like your full address OR your interests. It is not required.
posted on 1 Oct 2023
I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.
posted on 15 Sep 2021
I appeared for an interview in Nov 2020.
Round duration - 90 Minutes
Round difficulty - Easy
This round contains only 1 coding question which you have to solve in the language selected by you at the time of registration.
(Note: One can have to attempt the question in C language is he/she had selected C++ language at the time of registration).
Given a Directed Acyclic Graph (DAG) consisting of V
vertices and E
edges, your task is to find any topological sorting of this DAG. You need to return an array of size ...
Topological sort of a Directed Acyclic Graph (DAG) is found by ordering the vertices in such a way that for every directed edge u -> v, u comes before v in the ordering.
Use Depth First Search (DFS) to find the topological ordering of the vertices.
Start by visiting a vertex and recursively visit its neighbors before adding it to the result array.
Maintain a visited array to keep track of visited vertices and a stack t...
Round duration - 60 Minutes
Round difficulty - Easy
This is a technical interview which was held on google meet. The interviewer helps me to be comfortable. He first asked me some basic questions on OOPS concepts like function overloading and overriding. Then he asked me to explain any of my project and also put some question around it. After that he asked me one DSA question and share a google docs on which I have to code it. Then we dry run the code and he was satisfied with the solution.
You are given two strings 'A' and 'B' of lengths 'N' and 'M' respectively. Your task is to determine how many distinct ways string 'B' occurs as a subsequence in str...
Count the number of distinct occurrences of one string as a subsequence in another string.
Iterate through string A and string B to find all occurrences of B as a subsequence in A.
Use dynamic programming to keep track of the number of distinct occurrences.
Handle edge cases such as empty strings or strings of different lengths.
Example: For strings A='aabbcc' and B='abc', there are 3 distinct occurrences of B in A.
Round duration - 60 Minutes
Round difficulty - Easy
This round is also a Technical Interview round. The main focus of interviewer was on OOPS concepts. Around 30mins he came up with OOPS questions only like abstract class, inheritance, interfaces, exception handling and alot of other topics. Then he asked some DBMS concepts like normalization and some SQL queries for which I gave him satisfactory answer. He also asked questions around Data structures like what are queues, stack, hashmap etc. In the end he asked one DSA question around Linked List.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list ahead by the difference
Traverse both lists simultaneously until they meet at the merging point
Tip 1 : Practice previous year interview questions.
Tip 2 : They focus on OOPS concept so be clear in those.
Tip 3 : Should stand on your resume, whatever written there should be completely clear to you.
Tip 1 : Resume should be of one page with experience, projects, skills, education, certifications(not mandatory) columns in it.
Tip 2 : It is ok to have few things on resume but do not provide false information or points on which you cannot stand on if asked.
Some of the top questions asked at the Samsung SDS Software Developer Intern interview -
based on 3 interviews
Interview experience
based on 4 reviews
Rating in categories
Assistant Manager
280
salaries
| ₹6.5 L/yr - ₹26.5 L/yr |
Senior Executive
205
salaries
| ₹4.5 L/yr - ₹16 L/yr |
Manager
113
salaries
| ₹9.6 L/yr - ₹36 L/yr |
Senior Manager
82
salaries
| ₹15.9 L/yr - ₹45 L/yr |
Software Engineer
60
salaries
| ₹11 L/yr - ₹17 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software