Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion Package.swift
Original file line number Diff line number Diff line change
Expand Up @@ -23,9 +23,15 @@ let package = Package(
targets: [
.target(
name: "swift-ds-algorithms",
exclude: [
"Arrays/README.md",
"DataStructures/README.md",
"Integers/README.md",
"Strings/README.md"
],
plugins: skipPlugins ? [] : [
.plugin(name: "SwiftLintBuildToolPlugin", package: "SwiftLintPlugins")
],
]
),
.testTarget(
name: "swift-ds-algorithms-tests",
Expand Down
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
# Swift Algorithms
# Swift Algorithms ![](https://github.com/ahcode0919/swift-ds-algorithms/actions/workflows/ci.yml/badge.svg?branch=main)

Repository of solutions to various problems and algorithms in Swift.

Expand Down
64 changes: 63 additions & 1 deletion Sources/swift-ds-algorithms/Helpers.swift
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,17 @@ import Foundation
import GameKit

public class Helpers {
public enum HelperError: Error, CustomStringConvertible {
case invalidInput(message: String)

public var description: String {
switch self {
case .invalidInput(message: let message):
return message
}
}
}

public static func generateRandomString(ofLength length: Int = 1000000) -> String {
let characters = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890 "
let charCount = characters.count
Expand All @@ -17,9 +28,60 @@ public class Helpers {

for index in 0..<length {
let charIndex = characters.index(characters.startIndex,
offsetBy: randomGenerator.nextInt(upperBound: charCount))
offsetBy: randomGenerator.nextInt(upperBound: charCount))
wordArray[index] = characters[charIndex]
}
return String(wordArray)
}

public static func generateLinkedList(ofLength length: Int) throws -> SinglyLinkedListNode<Int> {
let dummyHead = SinglyLinkedListNode(value: 0)
var last = dummyHead

for index in 0..<length {
let node = SinglyLinkedListNode(value: index)
last.next = node
last = node
}

guard let head = dummyHead.next else {
throw HelperError.invalidInput(message: "Failed to generate a linked list")
}

return head
}

public static func generateLinkedList<T>(from array: [T]) throws -> SinglyLinkedListNode<T> {
var head: SinglyLinkedListNode<T>?
var last: SinglyLinkedListNode<T>?

for value in array {
let node = SinglyLinkedListNode(value: value)

if head == nil {
head = SinglyLinkedListNode(value: value)
last = head
} else {
last?.next = node
last = node
}
}

guard let head else {
throw HelperError.invalidInput(message: "Failed to generate a linked list")
}

return head
}

public static func linkedListToArray<T>(head: SinglyLinkedListNode<T>?) -> [T] {
var result: [T] = []
var current = head

while let node = current {
result.append(node.value)
current = node.next
}
return result
}
}
39 changes: 39 additions & 0 deletions Sources/swift-ds-algorithms/LinkedList/MergeLists.swift
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
// MergeLists.swift
// swift-ds-algorithms
//
// Created by Aaron on 8/16/26.
// Copyright © 2026. All rights reserved.
//

public enum MergeLists {
public static func merge(
head1: SinglyLinkedListNode<Int>?,
head2: SinglyLinkedListNode<Int>?
) -> SinglyLinkedListNode<Int>? {
let dummyHead = SinglyLinkedListNode(value: 0)
var current: SinglyLinkedListNode<Int>? = dummyHead
var currentHead1 = head1
var currentHead2 = head2

while let node1 = currentHead1, let node2 = currentHead2 {
if node1.value < node2.value {
current?.next = node1
currentHead1 = node1.next
} else {
current?.next = node2
currentHead2 = node2.next
}
current = current?.next
}

if let node = currentHead1 {
current?.next = node
}

if let node = currentHead2 {
current?.next = node
}

return dummyHead.next
}
}
35 changes: 35 additions & 0 deletions Sources/swift-ds-algorithms/LinkedList/ReverseLinkedList.swift
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
// ReverseLinkedList.swift
// swift-ds-algorithms
//
// Created by Aaron on 8/16/26.
// Copyright © 2026. All rights reserved.
//

public enum ReverseLinkedList {
public static func reverse(head: SinglyLinkedListNode<Int>?) -> SinglyLinkedListNode<Int>? {
var prev: SinglyLinkedListNode<Int>?
var current: SinglyLinkedListNode<Int>? = head

while current != nil {
let temp = current?.next
current?.next = prev
prev = current
current = temp
}

return prev
}

public static func reverseRecursive(
head: SinglyLinkedListNode<Int>?,
prev: SinglyLinkedListNode<Int>? = nil
) -> SinglyLinkedListNode<Int>? {
if head == nil {
return prev
}

let temp = head?.next
head?.next = prev
return reverseRecursive(head: temp, prev: head)
}
}
38 changes: 38 additions & 0 deletions Sources/swift-ds-algorithms/LinkedList/ZipperLists.swift
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
// ZipperLists.swift
// swift-ds-algorithms
//
// Created by Aaron on 8/16/26.
// Copyright © 2026. All rights reserved.
//

public enum ZipperLists {
public static func zipper(
head1: SinglyLinkedListNode<String>?,
head2: SinglyLinkedListNode<String>?
) -> SinglyLinkedListNode<String>? {
let dummyHead = SinglyLinkedListNode<String>(value: "")
var current1: SinglyLinkedListNode<String>? = head1
var current2: SinglyLinkedListNode<String>? = head2
var current: SinglyLinkedListNode<String>? = dummyHead

while let node1 = current1, let node2 = current2 {
current?.next = node1
current1 = node1.next
current = current?.next

current?.next = node2
current2 = node2.next
current = current?.next
}

if let node = current1 {
current?.next = node
}

if let node = current2 {
current?.next = node
}

return dummyHead.next
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
// Test.swift
// swift-ds-algorithms
//
// Created by Aaron on 8/16/26.
// Copyright © 2026. All rights reserved.
//

import swift_ds_algorithms
import Testing

struct MergeListsTests {

@Test func testMergeLists() throws {
var list1: SinglyLinkedListNode<Int>? = try Helpers.generateLinkedList(from: [1, 4, 5, 7, 10])
var list2: SinglyLinkedListNode<Int>? = try Helpers.generateLinkedList(from: [0, 3, 6, 8, 10, 11])
var result = MergeLists.merge(head1: list1, head2: list2)
var values = Helpers.linkedListToArray(head: result)
#expect(values == [0, 1, 3, 4, 5, 6, 7, 8, 10, 10, 11])

list1 = nil
list2 = nil
result = MergeLists.merge(head1: list1, head2: list2)
#expect(result == nil)

list1 = try Helpers.generateLinkedList(from: [1, 2, 3])
list2 = nil
result = MergeLists.merge(head1: list1, head2: list2)
values = Helpers.linkedListToArray(head: result)
#expect(values == [1, 2, 3])
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
// Test.swift
// swift-ds-algorithms
//
// Created by Aaron on 8/16/26.
// Copyright © 2026. All rights reserved.
//

import swift_ds_algorithms
import Testing

struct ReverseLinkedListTest {

@Test func testReverseLinkedList() throws {
var head: SinglyLinkedListNode<Int>?
#expect(ReverseLinkedList.reverse(head: head) == nil)

head = SinglyLinkedListNode(value: 0)
var result = ReverseLinkedList.reverse(head: head)
#expect(result?.value == 0)
#expect(result?.next == nil)

head = try Helpers.generateLinkedList(ofLength: 10)
result = ReverseLinkedList.reverse(head: head)
#expect(result != nil)

let values = Helpers.linkedListToArray(head: result)
#expect(values == [9, 8, 7, 6, 5, 4, 3, 2, 1, 0])
}

@Test func testReverseLinkedListRecursive() throws {
var head: SinglyLinkedListNode<Int>?
#expect(ReverseLinkedList.reverseRecursive(head: head) == nil)

head = SinglyLinkedListNode(value: 0)
var result = ReverseLinkedList.reverseRecursive(head: head)
#expect(result?.value == 0)
#expect(result?.next == nil)

head = try Helpers.generateLinkedList(ofLength: 10)
result = ReverseLinkedList.reverseRecursive(head: head)
#expect(result != nil)

let values = Helpers.linkedListToArray(head: result)
#expect(values == [9, 8, 7, 6, 5, 4, 3, 2, 1, 0])
}
}
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
// Test.swift
// swift-ds-algorithms
//
// Created by Aaron on 8/16/26.
// Copyright © 2026. All rights reserved.
//

import swift_ds_algorithms
import Testing

struct ZipperListsTests {

@Test func zipperLists() throws {
var result = ZipperLists.zipper(head1: nil, head2: nil)
#expect(result == nil)

var list1 = try Helpers.generateLinkedList(from: ["a", "b", "c"])
var list2 = try Helpers.generateLinkedList(from: ["x", "y", "z"])
result = ZipperLists.zipper(head1: list1, head2: list2)

var values = Helpers.linkedListToArray(head: result)
#expect(values == ["a", "x", "b", "y", "c", "z"])

list1 = try Helpers.generateLinkedList(from: ["a", "b", "c"])
list2 = try Helpers.generateLinkedList(from: ["x", "y"])
result = ZipperLists.zipper(head1: list1, head2: list2)

values = Helpers.linkedListToArray(head: result)
#expect(values == ["a", "x", "b", "y", "c"])

list1 = try Helpers.generateLinkedList(from: ["a", "b"])
list2 = try Helpers.generateLinkedList(from: ["x", "y", "z"])
result = ZipperLists.zipper(head1: list1, head2: list2)

values = Helpers.linkedListToArray(head: result)
#expect(values == ["a", "x", "b", "y", "z"])

list1 = try Helpers.generateLinkedList(from: ["a", "b", "c"])
result = ZipperLists.zipper(head1: list1, head2: nil)

values = Helpers.linkedListToArray(head: result)
#expect(values == ["a", "b", "c"])
}
}