Samsung
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Coding test which was difficult (Hard Leetcode)
I applied via Job Portal
2 Coding quesiton were asked based on dsa
I applied via Naukri.com and was interviewed before Oct 2022. There were 2 interview rounds.
It was of 3 hours and they have their own software for this.
I applied via Walk-in and was interviewed in May 2022. There were 3 interview rounds.
Basic coding round with 3 CP based questions
Namespace in C++ is used to avoid naming conflicts and organize code.
Namespace allows grouping of related functions, classes, and variables.
It helps in avoiding naming conflicts by providing a unique identifier to each entity.
Namespace can be nested within another namespace.
Using namespace keyword, we can access the entities within a namespace.
Example: namespace std { class string {}; }
Example: using namespace std; str
The expression would increment the value of i twice before using it in the operation.
The value of i would be incremented by 2 before being used in the operation.
This is equivalent to writing i = i + 2; followed by the operation using the new value of i.
For example, if i was initially 3, the expression would evaluate to 6.
Samsung interview questions for designations
Top trending discussions
I applied via Internshala
Nlp discussion around the nlp q and ans
I applied via campus placement at Indian Institute of Information Technology (IIIT), Guwahati and was interviewed in Jul 2022. There were 2 interview rounds.
Cs subjects regarding OS, C, DBMS
Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time.
Start with the second element and compare it with the first element, swap if necessary
Move to the third element and compare it with the second and first element, swap if necessary
Continue this process until the entire array is sorted
Time complexity: O(n^2)
Example: ['banana', 'apple', 'orange', 'grape'] -> ['apple', 'banan
Implementing a tree data structure using code
Define a Node class with left and right child pointers
Implement insert, search, and delete functions
Traversal methods: inorder, preorder, postorder
Examples: binary search tree, AVL tree, red-black tree
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
I was interviewed before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Round duration - 40 minutes
Round difficulty - Hard
Questions related to Web development and machine learning
Round duration - 20 minutes
Round difficulty - Medium
Tip 1 : Have clear understanding of fundamental concepts.
Tip 2 : Have a skill of explaining your thoughts as clearly as possible.
Tip 3 : Practice RDBMS and OS concepts.
Tip 1 : Mention about the projects you've done with detail
Tip 2 : Have deep knowledge about everything mentioned on your resume.
2 Interview rounds
Assistant Manager
957
salaries
| ₹5.5 L/yr - ₹19 L/yr |
Sales Executive
889
salaries
| ₹1 L/yr - ₹6.9 L/yr |
Software Engineer
884
salaries
| ₹6.6 L/yr - ₹25 L/yr |
Manager
538
salaries
| ₹10 L/yr - ₹33 L/yr |
Senior Engineer
503
salaries
| ₹4 L/yr - ₹13.9 L/yr |
Apple
LG Electronics
Sony
Xiaomi