i
Samsung SDS
Filter interviews by
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 ...
Online HackerRank 2 coding and 30 MCQ based test
I applied via campus placement at Harcourt Butler Technology Institute, Kanpur 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 Jun 2024. There were 2 interview rounds.
Technical MCQ questions on core computer science subjects were asked.
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...
posted on 1 Oct 2023
I applied via Google updates and was interviewed before Oct 2022. There were 3 interview rounds.
posted on 16 Sep 2021
I was interviewed in Apr 2021.
Round duration - 30 Minutes
Round difficulty - Easy
Timing of test start from 11 AM and everything goes well here .
What is segmentation
How many level of Normalization are there ?
Round duration - 60 Minutes
Round difficulty - Easy
It happen nicely and no problem occur.
The idea here is to travel over every elevation on the map and calculate the units of water the elevation can store.
Here is the algorithm :
Try to solve the problem in 'Single Sca...
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Round duration - 90 mintues
Round difficulty - Hard
Environment is very bad the intervier video call is lagging.
. List The Sub Parts Or Phases Of Analysis Part
The idea is to create a function which would rotate the array one element at a time. This can be done by shifting the array towards left by one element and copying the first element to the end of the array. For every query repeatedly call the above function, until the desired rotation is obtained.
If the number of rotations required, say ‘K’, is greater than the number of elements, ‘N’,...
Tip 1 : Prepare Data structure and algorithm
Tip 2 : Focus on operating system
Tip 3 : RDBMS and CAO are also important
Tip 1 : Have some projects on resume.
Tip 2 : Always write things which you can explain there.
posted on 16 Sep 2021
I was interviewed 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)
We will store all the four directions { (0,1) (0,-1) ( 1,0) ( -1,0 ) )} in 2-d array.
Round duration - 60 minutes
Round difficulty - Easy
It was in the morning at around 10 a.m conducted on Skype.
The first approach is by joining the array and again sorting is to get median.
The algorithm is as follows:
O(N + M) per test case, where ‘N’ and ‘M’ are the sizes of the arrays.
In the worst case, we will be creating a single array...
In any rooted tree, the distance between two nodes 'U' and 'V' can be found by finding the lowest common ancestor (LCA), ‘x’ of two nodes. The lowest common ancestor (LCA) between nodes 'U' and 'V' is defined as the lowest node in the tree that has both 'U' and 'V' as descendants, where we define each node to be a descendant of itself (so if 'U' has a direct connection from 'V', 'V' is the lowest common a...
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.
based on 4 reviews
Rating in categories
Assistant Manager
242
salaries
| ₹6.8 L/yr - ₹25 L/yr |
Senior Executive
195
salaries
| ₹4.4 L/yr - ₹15.8 L/yr |
Manager
110
salaries
| ₹8.7 L/yr - ₹31 L/yr |
Senior Manager
81
salaries
| ₹15.9 L/yr - ₹42 L/yr |
Software Engineer
57
salaries
| ₹11 L/yr - ₹17 L/yr |
TCS
Infosys
Wipro
HCLTech