New update is available. Click here to update.
SDE - Intern
Samsung
2 rounds | 4 Coding problems
204 views
Interview preparation journey
Preparation
Duration: 4 months
Topics: Data Structures, Algorithms, OOPs, DBMS, SQL, Web Development
Tip

Tip 1 : Do not rush into things. Learning takes time. Focus should be on the concepts and not just on leaving topics half-prepared. Devote 70% of both time and effort to DSA. I solved a total of around 500 questions on sites like GFG and Leetcode. Do not repeat similar questions just to increase the count of the number of questions

Tip 2 : Competitive Programming is a bonus and not a necessity, rather focus on core DSA based problems before trying CP. Do not pursue CP if you do not like it. Devote that extra time to core CS subjects and aptitude preparation.

Tip 3 : Projects play an important role too, do no ignore them. Try to get your hands dirty with a little bit of every field i.e., frontend, backend, and database.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds
01
Round
Easy
Video Call
Duration45 mins
Interview date26 Nov 2021
Problems2
Sort An Array According To The Count Of Set Bits

#### You are given an array consisting of N positive integers, and your task is to sort the array in decreasing order of count of set bits in the binary representation of the integers present in th...

view more
Problem approach

You are given an array consisting of N positive integers, and your task is to sort the array in decreasing order of count of set bits in the binary representation of the integers present in the array.
In other words, you have to modify the array such that an integer with more number of set bits should appear before the integer which has lesser number of set bits in its binary representation....

view more
Validate BST

#### You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.

view more
Problem approach

Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false otherwise.
A binary search tree (BST) is said to be a Partial BST if it follows the following properties.
• The left subtree of a node contains only nodes with data less than and equal to the node’s data.
• The right subtree of a node contai...

view more
02
Round
Easy
Video Call
Duration45 mins
Interview date26 Nov 2021
Problems2

#### Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

##### For example:
``The given linked list is 1 -> 2 ->...``
view more
Problem approach

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For Example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.

Find the kth number with prime factors 3, 5 and 7
view more
Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
2508 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
1709 views
Software Developer
2 rounds | 4 problems
Interviewed by Samsung
0 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
48 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16753 views