-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathresume.html
143 lines (129 loc) · 3.61 KB
/
resume.html
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
133
134
135
136
137
138
139
140
141
142
143
<!DOCTYPE html>
<html>
<head>
<title></title>
</head>
<body>
<ol type="1">
<li><h2>Gates</h2></li>
<ol type="a">
<li>BinaryAndGate</li>
<li>BinaryOrGate</li>
<li>BinaryNanGate</li>
<li>BinaryNorGate</li>
<li>Connector</li>
</ol>
<li><h2>Anagrams</h2></li>
<ol type="a">
<li>Sorted Case</li>
<li>Bad Case</li>
<li>Queue Case</li>
<li>List Case</li>
</ol>
<li><h2>Basic Structures</h2></li>
<ol type="a">
<li>queue</li>
<li>stack</li>
<ol type="disc">
<li>reverse string</li>
<li>polindrome</li>
<li>infix / postfix *</li>
</ol>
<li>deque</li>
<li>linked list</li>
<ol type="disc">
<li>Unordered List</li>
<li>Ordered List</li>
</ol>
</ol>
<li><h2>Binary</h2></li>
<li><h2>Recursion</h2></li>
<ol type="a">
<li>Rules</li>
<ol type="disc">
<li>Return</li>
<li>Previus loop</li>
<li>Substitute</li>
<li>Limit</li>
<li>Valid loop, Invalid loop</li>
<li>Semantics</li>
<li>Variable value</li>
<li>Avoid loop</li>
</ol>
<li>Algoritms</li>
<ol type="disc">
<li>Fibonnaci</li>
<li>Memoization Fibonnaci</li>
<li>Sum Nested List</li>
<li>Append String</li>
</ol>
</ol>
<li><h2>Search</h2></li>
<ol type="a">
<li>Sequencial Search</li>
<li>Ordered Sequencial Search</li>
<li>Binary Search</li>
<ol type="disc">
<li>Working List</li>
<li>Working Midpoint</li>
</ol>
<li>Hashing *</li>
</ol>
<li><h2>Sort</h2></li>
<ol type="a">
<li>BubbleSort</li>
<ol type="disc">
<li>While</li>
<li>For with range</li>
<li>Bad case</li>
</ol>
<li>SelectionSort</li>
<ol type="disc">
<li>While</li>
<li>For with range</li>
<li>Bad case</li>
</ol>
<li>InsertionSort</li>
</ol>
<li><h2>Tree</h2></li>
<ol type="a">
<li>Binary Tree</li>
<ol type="disc">
<li>function</li>
<li>class</li>
</ol>
<li>Binary Parse Tree</li>
<li>Binary Tree Heap</li>
</ol>
</ol>
<li><h2>Algoritmos</h2></li>
<ol type="a">
<li>String</li>
<ol>
<li>Unique String</li>
<ol type="disc">
<li>Dict ou List</li>
</ol>
<li>Count String(Anagrams)</li>
<ol type="disc">
<li>Dict or List with ord</li>
</ol>
<li>Matrix Zero</li>
<li>Is Rotation</li>
</ol>
<li>Linked List</li>
<ol>
<li>Remove duplicates</li>
<li>Remove some node</li>
<li>Search some node</li>
<li>Circular linked list</li>
</ol>
<li>Recursion</li>
<ol>
<li>Write a method to compute all permutations of a string 8.4 (Cracking)</li>
<li>Implement an algorithm to print all valid (e.g., properly opened and closed) combi-
nations of n-pairs of parentheses 8.5 (Cracking)</li>
</ol>
</ol>
</body>
</html>