Samsung Topics for Interview Preparation
Table of Content
- Easy Level
- Medium Level
Easy Level
- Program to find sum of prime numbers between 1 to n
- Count number of bits to be flipped to convert A to B
- Heap Sort
- Queue | Set 2 (Linked List Implementation)
- Stack Data Structure (Introduction and Program)
- Swap two nibbles in a byte
- Find the middle of a given linked list in C and Java
- Write a program to print all permutations of a given string
- Write one line C function to find whether a no is power of two
- Find Excel column name from a given column number
- Find next greater number with same set of digits
- Find all the patterns of “1(0+)1” in a given string | SET 1(General Approach)
- Find the smallest positive number missing from an unsorted array | Set 1
- Find the smallest positive number missing from an unsorted array
- Given only a pointer/reference to a node to be deleted in a singly lin
- Implement two stacks in an array
- K’th Largest Element in BST when modification to BST is not allowed
- Merge two sorted linked lists
- Minimum Initial Points to Reach Destination
- Multiply two polynomials
- Next Greater Element
- Print Left View of a Binary Tree
- Recursively remove all adjacent duplicates
- Root to leaf path sum equal to a given number
- Write a program function to detect loop in a linked list
Medium Level
- Binary Heap
- Binary Search Tree | Set 2 (Delete)
- Delete all occurrences of a given key in a linked list
- Detect Cycle in a Directed Graph
- Dynamic Programming | Set 11 (Egg Dropping Puzzle)
- Dynamic Programming | Set 3 (Longest Increasing Subsequence)
- Find a triplet that sum to a given value
- Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm)
- Largest Sum Contiguous Subarray
- Shortest path in a Binary Maze
- Total number of possible Binary Search Trees with n keys