forked from igorwojda/kotlin-coding-challenges
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathchallenge.kt
165 lines (144 loc) · 4.17 KB
/
challenge.kt
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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
package com.igorwojda.queue.combine
import org.amshove.kluent.shouldBeEqualTo
import org.junit.jupiter.api.Test
private fun combine(q1: Queue<*>, q2: Queue<*>): Queue<*> {
TODO("not implemented")
}
private class Queue<E> {
private val list = mutableListOf<E>()
fun add(element: E) {
list.add(element)
}
fun remove() = if (list.isEmpty()) null else list.removeAt(0)
fun peek() = list.firstOrNull()
fun isEmpty() = list.isEmpty()
}
private class Test {
@Test
fun `can add elements to a queue`() {
Queue<Int>().apply { add(1) }
}
@Test
fun `can remove elements from empty queue`() {
Queue<Int>().apply { remove() shouldBeEqualTo null }
}
@Test
fun `can remove elements from a queue`() {
Queue<String>().apply {
add("ABC")
remove()
}
}
@Test
fun `order of elements is maintained`() {
Queue<Char>().apply {
add('A')
add('B')
add('C')
remove() shouldBeEqualTo 'A'
remove() shouldBeEqualTo 'B'
remove() shouldBeEqualTo 'C'
remove() shouldBeEqualTo null
}
}
@Test
fun `peek returns, but does not remove element`() {
Queue<Int>().apply {
add(1)
add(2)
peek() shouldBeEqualTo 1
peek() shouldBeEqualTo 1
remove() shouldBeEqualTo 1
peek() shouldBeEqualTo 2
remove() shouldBeEqualTo 2
peek() shouldBeEqualTo null
remove() shouldBeEqualTo null
}
}
@Test
fun `weave can combine two queues wit the same length`() {
val one = Queue<Int>().apply {
add(1)
add(2)
add(3)
add(4)
}
val two = Queue<String>().apply {
add("one")
add("two")
add("three")
add("four")
}
combine(one, two).also {
it.remove() shouldBeEqualTo 1
it.remove() shouldBeEqualTo "one"
it.remove() shouldBeEqualTo 2
it.remove() shouldBeEqualTo "two"
it.remove() shouldBeEqualTo 3
it.remove() shouldBeEqualTo "three"
it.remove() shouldBeEqualTo 4
it.remove() shouldBeEqualTo "four"
it.remove() shouldBeEqualTo null
}
}
@Test
fun `weave can combine two queues with different length - first queue is longer`() {
val one = Queue<Int>().apply {
add(1)
add(2)
add(3)
add(4)
add(5)
add(6)
}
val two = Queue<String>().apply {
add("one")
add("two")
add("three")
add("four")
}
combine(one, two).apply {
remove() shouldBeEqualTo 1
remove() shouldBeEqualTo "one"
remove() shouldBeEqualTo 2
remove() shouldBeEqualTo "two"
remove() shouldBeEqualTo 3
remove() shouldBeEqualTo "three"
remove() shouldBeEqualTo 4
remove() shouldBeEqualTo "four"
remove() shouldBeEqualTo 5
remove() shouldBeEqualTo 6
remove() shouldBeEqualTo null
}
}
@Test
fun `weave can combine two queues with different length - second queue is longer`() {
val one = Queue<Int>().apply {
add(1)
add(2)
add(3)
add(4)
}
val two = Queue<String>().apply {
add("one")
add("two")
add("three")
add("four")
add("five")
add("six")
}
combine(one, two).apply {
remove() shouldBeEqualTo 1
remove() shouldBeEqualTo "one"
remove() shouldBeEqualTo 2
remove() shouldBeEqualTo "two"
remove() shouldBeEqualTo 3
remove() shouldBeEqualTo "three"
remove() shouldBeEqualTo 4
remove() shouldBeEqualTo "four"
remove() shouldBeEqualTo "five"
remove() shouldBeEqualTo "six"
remove() shouldBeEqualTo null
}
}
}