-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinterview02_blank.py
More file actions
178 lines (142 loc) · 6.69 KB
/
Copy pathinterview02_blank.py
File metadata and controls
178 lines (142 loc) · 6.69 KB
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
144
145
146
147
148
def closest_lt_or_eq(obj_list, val):
'''
Must return the closest value to obj_list that is less than or equal to the number val else None
>>> print(closest_lt_or_eq([1,2,4,7,12],1))
1
>>> print(closest_lt_or_eq([1,2,4,7,12],4))
4
>>> print(closest_lt_or_eq([1,2,4,7,12],6))
4
>>> print(closest_lt_or_eq([1,2,4,7,12],12))
12
>>> print(closest_lt_or_eq([1,2,4,7,12],23))
None
>>> print(closest_lt_or_eq([1,2,4,7,12],-1))
None
'''
def largest_one_lt(liste, val):
'''
>>> print(largest_one_lt([1,4,7,12], 1)) # nb pairs, val min
None
>>> print(largest_one_lt([1,4,7,12], 12)) # nb pairs, val max
7
>>> print(largest_one_lt([1,4,7,12], 7)) # nb pairs, val existante
4
>>> print(largest_one_lt([1,4,7,12], 6)) # nb pairs, val inexsitante
4
>>> print(largest_one_lt([1,4,7,12], 23)) # nb pairs, val supérieure
12
>>> print(largest_one_lt([1,4,7,12], 0)) # nb pairs, val inférieure
None
>>> print(largest_one_lt([1,4,5,7,12], 1)) # nb impairs, val min
None
>>> print(largest_one_lt([1,4,5,7,12], 12)) # nb impairs, val max
7
>>> print(largest_one_lt([1,4,5,7,12], 7)) # nb impairs, val existante
5
>>> print(largest_one_lt([1,4,5,7,12], 6)) # nb impairs, val inexistante
5
>>> print(largest_one_lt([1,4,5,7,12], 23)) # nb impairs, val supérieure
12
>>> print(largest_one_lt([1,4,5,7,12], 0)) # nb impairs, val inférieure
None
>>> print(largest_one_lt([4], 4))
None
>>> print(largest_one_lt([], 4))
None
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 1)) # nb impairs, val min
None
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 29)) # nb impairs, val max
27
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 24)) # nb impairs, val existante>12
22
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 21)) # nb impairs, val inexistante>12
20
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 5)) # nb impairs, val existante<12
4
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 2)) # nb impairs, val inexistante<12
1
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 0)) # nb impairs, val inférieure
None
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 30)) # nb impairs, val supérieure
29
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 1)) # nb pairs, val min
None
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 29)) # nb pairs, val max
27
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 24)) # nb pairs, val existante>12
23
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 21)) # nb pairs, val inexistante>12
20
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 5)) # nb pairs, val existante<12
4
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 2)) # nb pairs, val inexistante<12
1
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 0)) # nb pairs, val inférieure
None
>>> print(largest_one_lt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 30)) # nb impairs, val supérieure
29
'''
def smallest_one_gt(liste, val):
'''
>>> print(smallest_one_gt([1,4,7,12], 1)) # nb pairs, val min
4
>>> print(smallest_one_gt([1,4,7,12], 12)) # nb pairs, val max
None
>>> print(smallest_one_gt([1,4,7,12], 7)) # nb pairs, val existante
12
>>> print(smallest_one_gt([1,4,7,12], 6)) # nb pairs, val inexsitante
7
>>> print(smallest_one_gt([1,4,7,12], 23)) # nb pairs, val supérieure
None
>>> print(smallest_one_gt([1,4,7,12], 0)) # nb pairs, val inférieure
1
>>> print(smallest_one_gt([1,4,5,7,12], 1)) # nb impairs, val min
4
>>> print(smallest_one_gt([1,4,5,7,12], 12)) # nb impairs, val max
None
>>> print(smallest_one_gt([1,4,5,7,12], 7)) # nb impairs, val existante
12
>>> print(smallest_one_gt([1,4,5,7,12], 6)) # nb impairs, val inexistante
7
>>> print(smallest_one_gt([1,4,5,7,12], 23)) # nb impairs, val supérieure
None
>>> print(smallest_one_gt([1,4,5,7,12], 0)) # nb impairs, val inférieure
1
>>> print(smallest_one_gt([4], 4))
None
>>> print(smallest_one_gt([], 4))
None
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 1)) # nb impairs, val min
3
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 29)) # nb impairs, val max
None
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 24)) # nb impairs, val existante>12
26
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 21)) # nb impairs, val inexistante>12
22
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 5)) # nb impairs, val existante<12
7
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 2)) # nb impairs, val inexistante<12
3
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 0)) # nb impairs, val inférieure
1
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 30)) # nb impairs, val supérieure
None
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 1)) # nb pairs, val min
3
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 29)) # nb pairs, val max
None
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 24)) # nb pairs, val existante>12
26
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 21)) # nb pairs, val inexistante>12
22
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 5)) # nb pairs, val existante<12
7
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 2)) # nb pairs, val inexistante<12
3
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,23,24,26,27,29], 0)) # nb pairs, val inférieure
1
>>> print(smallest_one_gt([1,3,4,5,7,8,9,12,13,14,16,17,18,20,22,24,26,27,29], 30)) # nb impairs, val supérieure
None
'''