CrackingTheCodingInterview/00_00_Template.cpp at master · Teabeans/CrackingTheCodingInterview · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
//-----------------------------------------------------------------------------|
// AUTHORSHIP
//-----------------------------------------------------------------------------|
//
// Tim Lum
// twhlum@gmail.com
// Created:  2018.07.23
// Modified: 2018.08.30
//

/*
#.# - functionName() - P.####
<Problem Text>


//-----------------------------------------------------------------------------|
// PROBLEM SETUP AND ASSUMPTIONS
//-----------------------------------------------------------------------------|

- Setup descriptor 1
- Setup descriptor 2
- ...


//-----------------------------------------------------------------------------|
// OBSERVATIONS AND INFERENCES
//-----------------------------------------------------------------------------|

Ipsum lorem

//-----------------------------------------------------------------------------|
// NAIVE, BRUTE FORCE, TERRIBAD APPROACH
//-----------------------------------------------------------------------------|

Step1
   Substep1
   Substep2
   ...
Step2
   Substep1
   Substep2
   ...
...


//-----------------------------------------------------------------------------|
// OPTIMIZATIONS
//-----------------------------------------------------------------------------|

1) Optimization 1
   - Detail 1
   - Detail 2
   - ...
2) Optimization 2
   - Detail 1
   - Detail 2
   - ...
3) ...


//-----------------------------------------------------------------------------|
// TIME COMPLEXITY
//-----------------------------------------------------------------------------|

<Discussion of time complexity>


//-----------------------------------------------------------------------------|
// PSEUDOLOGIC
//-----------------------------------------------------------------------------|

Step1
   Substep1
   Substep2
   ...
Step2
   Substep1
   Substep2
   ...


//-----------------------------------------------------------------------------|
// CODE (C++)
//-----------------------------------------------------------------------------|
*/

#include <02_00_LinkedList.cpp>
#include <iostream>
#include <string>
#include <stringstream>
#include <iomanip>
#include <random>

// (+) --------------------------------|
// #functionName(arg1)
// ------------------------------------|
// Desc:    <Function Description>
// Params:  <T> arg1 - <Argument Description>
// PreCons: NULL
// PosCons: NULL
// RetVal:  <Retval Description>
<RET> <functionName>(<T> arg1) {

} // Closing <functionName>()


//-----------------------------------------------------------------------------|
// DRIVER
//-----------------------------------------------------------------------------|

// (+) --------------------------------|
// #main( int, char* )
// ------------------------------------|
// Desc:    Code driver
// Params:  int arg1 - The number of command line arguments passed in
//          char* arg2 - The content of the command line arguments
// PreCons: None
// PosCons: None
// RetVal:  int - The exit code (0 for normal, -1 for error)
int main( int argc, char* argv[ ] ) {
   std::cout << "Hello, World!" << std::endl;
   return( 0 );
} // Closing main( int, char* )

// End of file <filename>.cpp