Basics

Problems

merge two sorted array: http://www.lintcode.com/en/problem/merge-two-sorted-arrays/

merge sorted array: http://www.lintcode.com/en/problem/merge-sorted-array/

• two pointers vs. heap
• similar:
  • merge 2 sorted array (from end to start)
  • merge k sorted array (heap; optimized head; min heap;)
  • merge 2 sorted list (dummy)
  • merge k sorted list (heap; two by two; merge sort)

intersection of two arrays: http://www.lintcode.com/en/problem/intersection-of-two-arrays/

median of sorted array: http://www.lintcode.com/en/problem/median-of-two-sorted-arrays/