coding-interview-test

Problem 1

Solved using Quick Sort

Solved only for decimal numbers (radix = 10)

Intuition as follows :

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

2 implementations :

Name		Name	Last commit message	Last commit date
Latest commit History 17 Commits
.vscode/ipch		.vscode/ipch
IProblem.h		IProblem.h
Output.txt		Output.txt
Problem1.cpp		Problem1.cpp
Problem1.h		Problem1.h
Problem2.cpp		Problem2.cpp
Problem2.h		Problem2.h
Problem3.cpp		Problem3.cpp
Problem3.h		Problem3.h
Problem4.cpp		Problem4.cpp
Problem4.h		Problem4.h
README.md		README.md
main.cpp		main.cpp