Samsung Topics for Interview Preparation

    Easy Level

  1. Program to find sum of prime numbers between 1 to n
  2. Count number of bits to be flipped to convert A to B
  3. Heap Sort
  4. Queue | Set 2 (Linked List Implementation)
  5. Stack Data Structure (Introduction and Program)
  6. Swap two nibbles in a byte
  7. Find the middle of a given linked list in C and Java
  8. Write a program to print all permutations of a given string
  9. Write one line C function to find whether a no is power of two
  10. Find Excel column name from a given column number
  11. Find next greater number with same set of digits
  12. Find all the patterns of "1(0+)1" in a given string | SET 1(General Approach)
  13. Find the smallest positive number missing from an unsorted array | Set 1
  14. Find the smallest positive number missing from an unsorted array
  15. Given only a pointer/reference to a node to be deleted in a singly lin
  16. Implement two stacks in an array
  17. K'th Largest Element in BST when modification to BST is not allowed
  18. Merge two sorted linked lists
  19. Minimum Initial Points to Reach Destination
  20. Multiply two polynomials
  21. Next Greater Element
  22. Print Left View of a Binary Tree
  23. Recursively remove all adjacent duplicates
  24. Root to leaf path sum equal to a given number
  25. Write a program function to detect loop in a linked list

Medium Level

  1. Binary Heap
  2. Binary Search Tree | Set 2 (Delete)
  3. Delete all occurrences of a given key in a linked list
  4. Detect Cycle in a Directed Graph
  5. Dynamic Programming | Set 11 (Egg Dropping Puzzle)
  6. Dynamic Programming | Set 3 (Longest Increasing Subsequence)
  7. Find a triplet that sum to a given value
  8. Greedy Algorithms | Set 7 (Dijkstra's shortest path algorithm)
  9. Largest Sum Contiguous Subarray
  10. Shortest path in a Binary Maze
  11. Total number of possible Binary Search Trees with n keys

    Company Wise Coding Practice    Topic Wise Coding Practice