Skip to content

README.md

Latest commit

 

History

History
19 lines (13 loc) · 465 Bytes

README.md

File metadata and controls

19 lines (13 loc) · 465 Bytes

coding-interview-test

Problem 1

Solved using Quick Sort

Problem 2

Solved only for decimal numbers (radix = 10)

Problem 3:

Intuition as follows :

MoneyGathered[0th house to nth house] =

  Maximum of  MoneyGathered[0 to n-1 house]   OR  MoneyGathered[0 to n-2 house] + MoneyAt[n th house]

Problem 4:

2 implementations :

  1. Using Forward list from STL
  2. CStyle linked list