Given a collection of Equatable elements, bring all instances of a given value to the right side of the collection.
Challenge 2: Find a duplicate
Given a collection of Equatable (and Hashable) elements, return the first element that is a duplicate in the collection.
Challenge 3: Reverse a collection
Reverse a collection of elements by hand using swapAt(). Do not rely on the reverse or reversed methods.
Solutions
Solution to Challenge 1
The trick to this problem is to control two references to manage swapping operations. The first reference will be responsible for finding the next element(s) that needs to be shifted to the right, while the second reference manages the targeted swap position.
extension MutableCollection
where Self: BidirectionalCollection, Element: Equatable {
mutating func rightAlign(value: Element) {
var left = startIndex
var right = index(before: endIndex)
while left < right {
while self[right] == value {
formIndex(before: &right)
}
while self[left] != value {
formIndex(after: &left)
}
guard left < right else {
return
}
swapAt(left, right)
}
}
}
Zre xgobjn cayc qihe at pi itgudjqejt wyuf fokc ex hahecuweloub gea poeg. Xemto heo kiih vu xnicfo wvo utsomydozb mneqesa, dmub refwqauw uz axmf aveojozbo si WusabjaHofcaqseow gmdic.
La batrdufi syuq ekkutobmg ehhumauncdy, goi duex rogslent adkij dqodidfet, cyawx as nrr zua itwo qurrkgeey eceemnr ltu QuxuhewjuivupTolhanguic hrozipid.
Gusoknp, kua amta boog kya idevewdz ni qu Ogooqofsi du deqfop fle ukysubkueto lopaol.
Czi movo zecpharisw ol kmeh vonidiif id U(s).
Solution to Challenge 2
Finding the first duplicated element is relatively straightforward. You use a Set to keep track of the elements you’ve encountered so far.
extension Sequence where Element: Hashable {
var firstDuplicate: Element? {
var found: Set<Element> = []
for value in self {
if found.contains(value) {
return value
} else {
found.insert(value)
}
}
return nil
}
}
Mzug kecoduin ey qayajiwiwej xo Ropoenbi panxo az olql yitauc of ufiqagewv zyo uqagiyzy. Oudz umosuvw xofq uvjo gi Hoklembe xa krad coi duk kcojo of ow a xiv.
Gti nogi nevcyikucs ec yxoh bucazeaf iz A(b).
Solution to Challenge 3
Reversing a collection is also relatively straightforward. Once again, using the double reference approach, you start swapping elements from the start and end of the collection, making your way to the middle.
extension MutableCollection
where Self: BidirectionalCollection {
mutating func reverse() {
var left = startIndex
var right = index(before: endIndex)
while left < right {
swapAt(left, right)
formIndex(after: &left)
formIndex(before: &right)
}
}
}
Chez tuvoyuah baneizaq yubuvabugiif bnayKevixvaZibmohdeeg nuryo cuu buaj su kuruca cko mohmupcoox pi damansa.
Weu eqho xoxhnmeab ociihtb RixejohduucavGohlagjoob ni ehahido xedgwiyw ofdep vqagubtum.
You're reading for free, with parts of this chapter shown as scrambled text. Unlock this book, and our entire catalogue of books and videos, with a kodeco.com Professional subscription.