Samsung Interview Preparation
Samsung Interview Preparation
Software Engineer
Samsung R&D Institute Bangladesh
Linkedin | Facebook
1st Round:
- 3 hours
- 1 Problem
Practice Problems:
● https://www.hackerrank.com/contests/target-samsung-13-nov19/challenges
● https://github.com/twowaits/SDE-Interview-Questions/blob/master/Samsung
/README.md
● https://github.com/s-kachroo/SamsungPractice?fbclid=IwZXh0bgNhZW0C
MTAAAR1c_y99FTnuNAjo9PPVEbjSy8fidrD0uGnwZrcHbd_nDuRKuZY
AfRa0AE0_aem_-eEURv_GxVNDF_Pmmz8vBA
2nd Round:
Data Structures :
1) Linked List :
● Generate a linked list from given array
● Reverse a linked list
● Merge two sorted linked list without using auxiliary space
● Detecting a linked list if it is circular in O(n) time.
● Remove Duplicates from Sorted List
● Find Middle of the Linked List
● Array vs Linked List
2) Binary Tree :
● Reverse a binary tree
● Calculate the height/depth of a binary tree
● Calculate the diameter of a binary tree
● Post Traverse a Binary Tree.
● Pre Order traversal Binary Tree
● Inorder Traversal of a Binary Tree
4) Sorting :
● Bubble / Insertion / Quick / Merge — Best and Worst Case
● Complexity analysis ( Time and Space ) of Bubble / Insertion / Quick /
Merge sort
● Difference between Quick Sort and Merge Sort
● If we know the length of the array size than which sort algorithm should we
use between Quick sort and Merge sort
● Why should we choose the pivot in quicksort randomly?
Muhammad Samee Sevas
Software Engineer
Samsung R&D Institute Bangladesh
Linkedin | Facebook
5) Binary Search
6) Graph theory :
● Count Connected components
● Cycle finding or detecting
● Shortest path in unweighted graph
● Given a graph, check whether it is bi-colorable or not.
● Dijkstra Vs Bellman ford
7) Dynamic Programming :
● Basic Recursion and Dynamic Programming
● 0–1 Knapsack
● Coin Change
8) Trie
OS:
● OS Basic
● Thread