📚 Data Structures & Algorithms in Swift

A growing collection of Data Structures & LeetCode-style DSA solutions implemented in Swift 🚀

Welcome to my DSA in Swift repository!

This repo is my personal journey (and a helpful reference for others) to master Data Structures and Algorithms — all implemented in Swift 💻

Here, you’ll find clean, well-documented solutions to popular problems from LeetCode — neatly organized by data structure and algorithm type.

💡 Objective

This repository documents my journey to master Data Structures & Algorithms using Swift, by solving real interview-standard problems and organizing them by topic.

Perfect for:

• ✅ iOS Engineers prepping for interviews
• ✅ Swift learners who want DSA fundamentals
• ✅ Anyone who wants clean, readable Swift solutions

🚀 Goals

• 📘 Strengthen understanding of core data structures and algorithms
• 🧩 Solve LeetCode problems in Swift
• 🗂️ Organize them by category for easy navigation
• 🧠 Write clean, readable, and efficient Swift code
• 💬 Optionally include explanations & time complexities

📚 Repository Structure

Each directory represents a Data Structure or Algorithm Category.
Within each folder, you’ll find problems with their Swift implementations and clear explanations (where applicable).

📦 Folder	🧩 Description
🧮 Arrays	Problems involving arrays, searching, sorting, and manipulation
🔗 LinkedList	Linked list operations – reversing, merging, detecting cycles
🧱 Stack	Stack-based problems (e.g. parentheses, next greater element)
🌀 Queue	FIFO structures, sliding window, and scheduling problems
🔍 Hashing	HashMap / Dictionary based problems
🌳 Trees	Binary Trees, BSTs, traversals, depth/height problems
🌐 Graphs	BFS, DFS, pathfinding, connected components
🧠 DynamicProgramming	Classic DP problems like LIS, LCS, Knapsack

---

Each folder includes:

• ✅ Swift solution
• 🧠 Approach / Explanation (when helpful)
• ⏱ Time & space complexity
• 🔗 Link to original problem

🛠 Technologies Used

• Swift 5+
• Xcode Playground / Swift files
• LeetCode problem references

🧩 Problem Format

Each problem typically includes:

• Problem name
• Link to the original problem
• Approach / Explanation
• Time & Space Complexity
• Swift Solution

Example:

// 🔗 Problem: https://leetcode.com/problems/two-sum/
// 🧠 Approach: HashMap to store visited numbers and their indices
// ⏰ Time: O(n)
// 💾 Space: O(n)

func twoSum(_ nums: [Int], _ target: Int) -> [Int] {
    var map = [Int: Int]()
    for (i, num) in nums.enumerated() {
        if let j = map[target - num] {
            return [j, i]
        }
        map[num] = i
    }
    return []
}

---