swift-algorithms
adventofcode
Our great sponsors
swift-algorithms | adventofcode | |
---|---|---|
26 | 718 | |
5,676 | 65 | |
1.3% | - | |
6.6 | 9.0 | |
7 days ago | 4 months ago | |
Swift | Scala | |
Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
swift-algorithms
-
-❄️- 2023 Day 11 Solutions -❄️-
While you are correct about the stdlib, check out swift-algorithms (https://github.com/apple/swift-algorithms). It's written by Apple and has several interesting methods.
-
Do you use algorithms in Swift?
We used Swift Algorithms once or twice. It just depends on the app. I suggest starting with the WWDC video.
-
Checking the largest values in an arrary
Install swift-algorithms and use min/max(count:by:)
-
-🎄- 2022 Day 6 Solutions -🎄-
#!/usr/bin/env swift sh import Algorithms // https://github.com/apple/swift-algorithms struct StandardInput: Sequence, IteratorProtocol { func next() -> String? { return readLine() } } func markerEnd(for signal: String, markerLength: Int) -> Int { return Array(signal.windows(ofCount: markerLength)) .firstIndex { Set($0).count == markerLength }! + markerLength } let signals = StandardInput().compactMap { $0 } let part1 = signals.map { markerEnd(for: $0, markerLength: 4)}.reduce(0, +) let part2 = signals.map { markerEnd(for: $0, markerLength: 14)}.reduce(0, +) print("part 1 : \(part1)") print("part 2 : \(part2)")
-
-🎄- 2022 Day 5 Solutions -🎄-
#!/usr/bin/env swift sh import Algorithms // https://github.com/apple/swift-algorithms typealias Label = Character typealias Instruction = (amount: Int, source: Int, destination: Int) struct StandardInput: Sequence, IteratorProtocol { func next() -> String? { return readLine(strippingNewline: false) } } let sections = StandardInput() .compactMap { $0 } .split(separator: "\n") .map { Array($0) } let stacks = parseStacks(from: sections[0]) let instructions = parseInstructions(from: sections[1]) print(apply(instructions, to: stacks, oneAtATime: true)) print(apply(instructions, to: stacks, oneAtATime: false)) // MARK: - Private private func parseStacks(from section: [String]) -> [[Label]] { let crates = section.map { let start = $0.index($0.startIndex, offsetBy: 1) return Array($0.suffix(from: start).striding(by: 4)) } let stackCount = crates[0].count var stacks: [[Label]] = Array(repeating: [Label](), count: stackCount) crates.reversed().forEach { for (index, label) in $0.enumerated() { stacks[index].append(label) } } return stacks.map { $0.filter { $0.isLetter } } } private func parseInstructions(from section: [String]) -> [Instruction] { return section.map { let tokens = $0.dropLast().split(separator: " ") return (Int(tokens[1])!, Int(tokens[3])! - 1, Int(tokens[5])! - 1) } } private func apply( _ instructions: [Instruction], to stacks: [[Label]], oneAtATime: Bool ) -> String { var stacks = stacks instructions.forEach { let cargo = Array(stacks[$0.source].suffix($0.amount)) stacks[$0.source] = stacks[$0.source].dropLast($0.amount) stacks[$0.destination].append( contentsOf: oneAtATime ? cargo.reversed() : cargo ) } return String(stacks.map { $0.last! }) }
-
-🎄- 2022 Day 3 Solutions -🎄-
Swift. Algorithms contains chunks(ofCount: 3) but I had to write chunks(totalCount:) myself.
-
-🎄- 2022 Day 1 Solutions -🎄-
Algorithms has `max(count:)` now. 💻🖥️
-
foursum?
Create windows of 4 elements.
-
Understanding algorithms
There is also a swift algorithm package that’s a precursor to the standard library if you want to examine legit implementation built into Swift.
-
-🎄- 2021 Day 1 Solutions -🎄-
I used Algorithms and took inspiration from Kotlin with it's zipWithNext function.
adventofcode
-
-❄️- 2023 Day 6 Solutions -❄️-
On GitHub.
-
-🎄- 2022 Day 21 Solutions -🎄-
My Scala solution – to be cleaned up.
-
Advent of Code (in MiniScript), Day 18
Welcome back to my series of Advent of Code solutions in MiniScript! Day 18 was pretty straightforward, though it presents some interesting choices in how to represent the data -- choices I'm not sure I made optimally.
-
-🎄- 2022 Day 18 Solutions -🎄-
My Scala solution.
-
Late bloomers (that started life closer to 30), how are things going for you?
And I've solved all of the Advent of Code problems so far this year, which is utterly unimportant but still brings me joy.
-
Coding/programming is absolutely fantastic
If you'd enjoy some coding challenges, advent of code (https://adventofcode.com/) is currently going on.
-
Advent of Code (in MiniScript), Day 17
Welcome back to my series of Advent of Code solutions in MiniScript! In Day 17 we got to (sort of) play Tetris. Five different Tetris-like shapes fall into a pit, moved left or right on each step according to the input. The first task is to see how high this stack will grow after 2022 blocks have been dropped in.
- Can someone give me a good idea for C# console app I could make?
- The Empty List
-
Advent of Code (in MiniScript), Day 16
Welcome back to my series of Advent of Code solutions in MiniScript! Day 16 was... how to put this?
What are some alternatives?
v2ray-core - A platform for building proxies to bypass network restrictions.
codewars.com - Issue tracker for Codewars
swift-evolution - This maintains proposals for changes and user-visible enhancements to the Swift Programming Language.
bitburner - Bitburner Game
spring-boot-demo - 🚀一个用来深入学习并实战 Spring Boot 的项目。
LeetCode - This is my LeetCode solutions for all 2000+ problems, mainly written in C++ or Python.
swift-numerics - Advanced mathematical types and functions for Swift
Exercism - Scala Exercises - Crowd-sourced code mentorship. Practice having thoughtful conversations about code.
SpringBoot-Labs - 一个涵盖六个专栏:Spring Boot 2.X、Spring Cloud、Spring Cloud Alibaba、Dubbo、分布式消息队列、分布式事务的仓库。希望胖友小手一抖,右上角来个 Star,感恩 1024
developer-roadmap - Interactive roadmaps, guides and other educational content to help developers grow in their careers.
CS-Notes - :books: 技术面试必备基础知识、Leetcode、计算机操作系统、计算机网络、系统设计
Advent-of-Code - Advent of Code