{"id":20973243,"url":"https://github.com/boudhayan/algorithm-solutions-in-swift","last_synced_at":"2025-10-28T07:36:00.230Z","repository":{"id":37966783,"uuid":"386905375","full_name":"boudhayan/Algorithm-Solutions-In-Swift","owner":"boudhayan","description":"This repository contains 250+  data structures and algorithms solutions from AlgoExpert, LeetCode \u0026 HackerRank in Swift 🧑🏻‍💻","archived":false,"fork":false,"pushed_at":"2024-07-21T17:13:18.000Z","size":719,"stargazers_count":89,"open_issues_count":0,"forks_count":11,"subscribers_count":4,"default_branch":"main","last_synced_at":"2025-04-14T03:56:11.257Z","etag":null,"topics":["algoexpert","algoexperts","algorithm","algorithm-challenges","algorithms","algorithms-and-data-structures","algorithms-implemented","hackerrank","hackerrank-solutions","interview-preparation","interview-questions","leetcode","leetcode-practice","leetcode-questions","leetcode-solutions","leetcode-swift"],"latest_commit_sha":null,"homepage":"","language":"Swift","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/boudhayan.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":"CODEOWNERS","security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-07-17T10:19:50.000Z","updated_at":"2025-02-17T03:39:28.000Z","dependencies_parsed_at":"2024-02-04T10:45:02.845Z","dependency_job_id":"387424c9-2a0b-4a58-9964-5abd900443c5","html_url":"https://github.com/boudhayan/Algorithm-Solutions-In-Swift","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/boudhayan/Algorithm-Solutions-In-Swift","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boudhayan%2FAlgorithm-Solutions-In-Swift","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boudhayan%2FAlgorithm-Solutions-In-Swift/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boudhayan%2FAlgorithm-Solutions-In-Swift/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boudhayan%2FAlgorithm-Solutions-In-Swift/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/boudhayan","download_url":"https://codeload.github.com/boudhayan/Algorithm-Solutions-In-Swift/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boudhayan%2FAlgorithm-Solutions-In-Swift/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":281403407,"owners_count":26495042,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-28T02:00:06.022Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algoexpert","algoexperts","algorithm","algorithm-challenges","algorithms","algorithms-and-data-structures","algorithms-implemented","hackerrank","hackerrank-solutions","interview-preparation","interview-questions","leetcode","leetcode-practice","leetcode-questions","leetcode-solutions","leetcode-swift"],"created_at":"2024-11-19T04:12:58.596Z","updated_at":"2025-10-28T07:36:00.209Z","avatar_url":"https://github.com/boudhayan.png","language":"Swift","readme":"# Algorithms Solutions in Swift\nThis repository contains solutions from AlgoExpert, LeetCode \u0026amp; HackerRank in Swift programming language. \n\nSuggestions and contributions are welcome.\n\n### \u003ca href=/https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/\u003eHackerRank\u003c/a\u003e\n| Serial No.  | Problem  | Solution  | Time Complexity | Space Complexity  | Notes  |\n|---|---|---|---|---|---|\n|1|3D Surface Area|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/3D%20Surface%20Area\"\u003eLink\u003c/a\u003e|_|_|_|\n|2|Almost Sorted|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Almost%20Sorted\"\u003eLink\u003c/a\u003e|_|_|_|\n|3|Binary Search Trees|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Binary%20Search%20Trees\"\u003eLink\u003c/a\u003e|_|_|_|\n|4|Bitwise AND|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Bitwise%20AND\"\u003eLink\u003c/a\u003e|_|_|_|\n|5|Convert Decimal to Binary|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Convert%20Decimal%20To%20Binary\"\u003eLink\u003c/a\u003e|_|_|_|\n|6|Count Pairs|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Count%20Pairs\"\u003eLink\u003c/a\u003e|_|_|_|\n|7|Encryption|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Encryption\"\u003eLink\u003c/a\u003e|_|_|_|\n|8|Extra Long Factorials|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Extra%20Long%20Factorials\"\u003eLink\u003c/a\u003e|_|_|_|\n|9|Larry's Array|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Larry's%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|10|Merge Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Merge%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|11|Palindrome String|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Palindrome%20String\"\u003eLink\u003c/a\u003e|_|_|_|\n|12|Reverse String|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Reverse%20String\"\u003eLink\u003c/a\u003e|_|_|_|\n|13|Sum of Natural Number|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Sum%20of%20Natural%20Number\"\u003eLink\u003c/a\u003e|_|_|_|\n|14|Tic Tac Toe Winner|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Tic%20Tac%20Toe%20Winner\"\u003eLink\u003c/a\u003e|_|_|_|\n|15|Two Strings|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/HackerRank/Two%20Strings\"\u003eLink\u003c/a\u003e|_|_|_|\n\n\n\n### \u003ca href=/https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/\u003eLeetCode\u003c/a\u003e\n| Serial No.  | Problem  | Solution  | Time Complexity | Space Complexity  | Notes  |\n|---|---|---|---|---|---|\n|1|3 Sum Closest|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/3%20Sum%20Closest\"\u003eLink\u003c/a\u003e|_|_|_|\n|2|Merge Intervals|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Merge%20Intervals\"\u003eLink\u003c/a\u003e|_|_|_|\n|3|Divide Two Integers|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Divide%20Two%20Integers\"\u003eLink\u003c/a\u003e|_|_|_|\n|4|Single Number|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Single%20Number\"\u003eLink\u003c/a\u003e|_|_|_|\n|5|Majority Element|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Majority%20Element\"\u003eLink\u003c/a\u003e|_|_|_|\n|6|Three Number Sum Zero|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Three%20Sum%20Zero\"\u003eLink\u003c/a\u003e|_|_|_|\n|7|Binary Search|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Binary%20Search\"\u003eLink\u003c/a\u003e|_|_|_|\n|8|First Bad Version|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/First%20Bad%20Version\"\u003eLink\u003c/a\u003e|_|_|_|\n|9|Search Insert Position|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Search%20Insert%20Position\"\u003eLink\u003c/a\u003e|_|_|_|\n|10|Merge Intervals|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Merge%20Intervals\"\u003eLink\u003c/a\u003e|_|_|_|\n|11|Sort Colors|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sort%20Colors\"\u003eLink\u003c/a\u003e|_|_|_|\n|12|Design HashMap|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Design%20HashMap\"\u003eLink\u003c/a\u003e|_|_|_|\n|13|Squares of a Sorted Array|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Squares%20of%20a%20Sorted%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|14|Rotate Array|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Rotate%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|15|Move Zeros to End|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Move%20Zeros%20to%20End\"\u003eLink\u003c/a\u003e|_|_|_|\n|16|Two Sum - Input Array Sorted|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Two%20Number%20Sum%20-%20Sorted%20Input%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|17|Pascal's Triangle - II|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Pascal's%20Triangle%20II\"\u003eLink\u003c/a\u003e|_|_|_|\n|18|Rotate Image|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Rotate%20Image\"\u003eLink\u003c/a\u003e|_|_|_|\n|19|Spiral Matix II|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Spiral%20Matrix%20II\"\u003eLink\u003c/a\u003e|_|_|_|\n|20|Reverse String|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Reverse%20String\"\u003eLink\u003c/a\u003e|_|_|_|\n|21|Reverse Words in a String|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Reverse%20Words%20in%20a%20String\"\u003eLink\u003c/a\u003e|_|_|_|\n|22|Search in a 2D Matrix|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Search%20a%202D%20Matrix%20II\"\u003eLink\u003c/a\u003e|_|_|_|\n|23|Erase Overlapping Intervals|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Non-Overlapping%20Intervals\"\u003eLink\u003c/a\u003e|_|_|_|\n|24|Middle of the Linked List|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Middle%20of%20the%20Linked%20List\"\u003eLink\u003c/a\u003e|_|_|_|\n|25|Remove Nth Node from End of the Linked List|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Remove%20Nth%20Node%20from%20Linked%20List\"\u003eLink\u003c/a\u003e|_|_|_|\n|26|Longest Substring without Repeating Characters|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Longest%20Substring%20without%20Repeating%20Characters\"\u003eLink\u003c/a\u003e|_|_|_|\n|27|Permutation in a String|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Permutation%20in%20String\"\u003eLink\u003c/a\u003e|_|_|_|\n|28|Increasing Triplet Subsequence|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Increasing%20Triplet%20Subsequence\"\u003eLink\u003c/a\u003e|_|_|_|\n|29|Porduct of Array Except Self|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Product%20of%20Array%20Except%20Self\"\u003eLink\u003c/a\u003e|_|_|_|\n|30|Sub Array Sum Equals K|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sub%20Array%20Sum%20Equals%20K\"\u003eLink\u003c/a\u003e|_|_|_|\n|31|Add Strings|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Add%20Strings\"\u003eLink\u003c/a\u003e|_|_|_|\n|32|Longest Palindrome|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Longest%20Palindrome\"\u003eLink\u003c/a\u003e|_|_|_|\n|33|Word Pattern|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Word%20Pattern\"\u003eLink\u003c/a\u003e|_|_|_|\n|34|Partition Labels|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Partition%20Labels\"\u003eLink\u003c/a\u003e|_|_|_|\n|35|Group Anagrams|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Group%20Anagrams\"\u003eLink\u003c/a\u003e|_|_|_|\n|36|Multiply Strings|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Multiply%20Strings\"\u003eLink\u003c/a\u003e|_|_|_|\n|37|Flood Fill|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Flood%20Fill\"\u003eLink\u003c/a\u003e|_|_|_|\n|38|Max Area of Island|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Max%20Area%20of%20Island\"\u003eLink\u003c/a\u003e|_|_|_|\n|39|Merge Two Binary Trees|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Merge%20Two%20Binary%20Trees\"\u003eLink\u003c/a\u003e|_|_|_|\n|40|Populatng Next Right Pointer In Each Node|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Populating%20Next%20Right%20Pointer%20in%20Each%20Node\"\u003eLink\u003c/a\u003e|_|_|_|\n|41|Three Sum Smaller|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Three%20Sum%20Smaller\"\u003eLink\u003c/a\u003e|_|_|_|\n|42|Spiral Matrix|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sprial%20Matrix\"\u003eLink\u003c/a\u003e|_|_|_|\n|43|Valid Parentheses|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Parentheses\"\u003eLink\u003c/a\u003e|_|_|_|\n|44|Best Time to Buy and Sell Stock|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Best%20Time%20to%20Buy%20and%20Sell%20Stock\"\u003eLink\u003c/a\u003e|_|_|_|\n|45|Longest Palindrome|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Longest%20Palindrome\"\u003eLink\u003c/a\u003e|_|_|_|\n|46|Subsets|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Subsets\"\u003eLink\u003c/a\u003e|_|_|_|\n|47|Convert Time with Minimum Operations|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Convert%20Time%20Minimum%20Operations\"\u003eLink\u003c/a\u003e|_|_|_|\n|48|Find Players with Zero or One Loses|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Find%20Players%20Zero%20or%20One%20Loses\"\u003eLink\u003c/a\u003e|_|_|_|\n|49|Largest Integer Digit Swap By Parity|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Largest%20Integer%20Digit%20Swaps%20Parity\"\u003eLink\u003c/a\u003e|_|_|_|\n|50|Container with Most Water|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Container%20With%20Most%20Water\"\u003eLink\u003c/a\u003e|_|_|_|\n|51|License Key Formatting|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/License%20Key%20Formatting\"\u003eLink\u003c/a\u003e|_|_|_|\n|52|Unique Email Addresses|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Unique%20Email%20Address\"\u003eLink\u003c/a\u003e|_|_|_|\n|53|Sort By Parity|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sort%20by%20Parity\"\u003eLink\u003c/a\u003e|_|_|_|\n|54|Maximum Bags with Full Capacity of Rocks|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Maximum%20Bags%20with%20Full%20Capacity%20of%20Rocks\"\u003eLink\u003c/a\u003e|_|_|_|\n|55|Search 2D Matrix II|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Search%20a%202D%20Matrix%20II\"\u003eLink\u003c/a\u003e|_|_|_|\n|56|Remove Duplicates Sorted Array|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Remove%20Duplicates%20Sorted%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|57|Remove Element|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Remove%20Element\"\u003eLink\u003c/a\u003e|_|_|_|\n\n\n\n### \u003ca href=/https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/\u003eAlgoExpert\u003c/a\u003e\n| Serial No.  | Problem  | Solution  | Time Complexity | Space Complexity  | Notes  |\n|---|---|---|---|---|---|\n|1|Breadth First Search|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/%20Breadth%20First%20Search\"\u003eLink\u003c/a\u003e|_|_|_|\n|2|Array of Products|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Array%20of%20Products\"\u003eLink\u003c/a\u003e|_|_|_|\n|3|Binary Search Tree Construction|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/BST%20Construction\"\u003eLink\u003c/a\u003e|_|_|_|\n|4|Binary Search Tree Traversal|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/BST%20Traversal\"\u003eLink\u003c/a\u003e|_|_|_|\n|5|Binary Search|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Binary%20Search\"\u003eLink\u003c/a\u003e|_|_|_|\n|6|Binary Tree Diameter|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Binary%20Tree%20Diameter\"\u003eLink\u003c/a\u003e|_|_|_|\n|7|Branch Sums|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Branch%20Sums\"\u003eLink\u003c/a\u003e|_|_|_|\n|8|Bubble Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Bubble%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|9|Caesar Cipher Encryptor|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Caesar%20Cipher%20Encryptor\"\u003eLink\u003c/a\u003e|_|_|_|\n|10|Class Photos|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Class%20Photos\"\u003eLink\u003c/a\u003e|_|_|_|\n|11|Depth First Search|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Depth%20First%20Search\"\u003eLink\u003c/a\u003e|_|_|_|\n|12|Find Closest Value in Binary Search Tree|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Find%20Closest%20Value%20In%20BST\"\u003eLink\u003c/a\u003e|_|_|_|\n|13|Find Loop in Linked List|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Find%20Loop%20in%20Linked%20List\"\u003eLink\u003c/a\u003e|_|_|_|\n|14|Find Successor|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Find%20Successor\"\u003eLink\u003c/a\u003e|_|_|_|\n|15|Find Three Largest Numbers|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Find%20Three%20Largest%20Numbers\"\u003eLink\u003c/a\u003e|_|_|_|\n|16|First Duplicate Value|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/First%20Duplicate%20Value\"\u003eLink\u003c/a\u003e|_|_|_|\n|17|First Non-Repeating Character|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/First%20Non%20Repeating%20Character\"\u003eLink\u003c/a\u003e|_|_|_|\n|18|Four Number Sum|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Four%20Number%20Sum\"\u003eLink\u003c/a\u003e|_|_|_|\n|19|Generate Document|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Generate%20Document\"\u003eLink\u003c/a\u003e|_|_|_|\n|20|Invert Binary Tree|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Invert%20Binary%20Tree\"\u003eLink\u003c/a\u003e|_|_|_|\n|21|Insertion Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Insertion%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|22|Largest Range|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Largest%20Range\"\u003eLink\u003c/a\u003e|_|_|_|\n|23|Linked List Construction|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Linked%20List%20Construction\"\u003eLink\u003c/a\u003e|_|_|_|\n|24|Longest Palindromic Substring|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Longest%20Palindromic%20Substring\"\u003eLink\u003c/a\u003e|_|_|_|\n|25|Longest Peak|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Longest%20Peak\"\u003eLink\u003c/a\u003e|_|_|_|\n|26|Max Subset Sum No Adjacent|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Max%20Subset%20Sum%20No%20Adjacent\"\u003eLink\u003c/a\u003e|_|_|_|\n|27|Merge Linked Lists|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Merge%20LinkedLists\"\u003eLink\u003c/a\u003e|_|_|_|\n|28|Merge Overlapping Intervals|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Merge%20Overlapping%20Intervals\"\u003eLink\u003c/a\u003e|_|_|_|\n|29|Merge Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Merge%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|30|Minimum Height Binary Search Tree|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Min%20Height%20BST\"\u003eLink\u003c/a\u003e|_|_|_|\n|31|Minimum Waiting Time|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Minimum%20Waiting%20Time\"\u003eLink\u003c/a\u003e|_|_|_|\n|32|Monotonic Array|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Monotonic%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|33|Move Element To End|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Move%20Element%20to%20End\"\u003eLink\u003c/a\u003e|_|_|_|\n|34|Node Depths|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Node%20Depths\"\u003eLink\u003c/a\u003e|_|_|_|\n|35|Non-Constructible Change|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Non-Constructible%20Change\"\u003eLink\u003c/a\u003e|_|_|_|\n|36|Nth Fibonacci Number|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Nth%20Fibonacci\"\u003eLink\u003c/a\u003e|_|_|_|\n|37|Palindrome Check|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Palindrome%20Check\"\u003eLink\u003c/a\u003e|_|_|_|\n|38|Prodcut Sum|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Product%20Sum\"\u003eLink\u003c/a\u003e|_|_|_|\n|39|Quick Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Quick%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|40|Remove Duplicates From Linked List|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Remove%20Duplicates%20From%20Linked%20List\"\u003eLink\u003c/a\u003e|_|_|_|\n|41|Remove kth Node From End|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Remove%20Kth%20Node%20From%20End\"\u003eLink\u003c/a\u003e|_|_|_|\n|42|Reverse Linkedlist|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Reverse%20Linkedlist\"\u003eLink\u003c/a\u003e|_|_|_|\n|43|Run Length Encoding|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Run%20Length%20Encoding\"\u003eLink\u003c/a\u003e|_|_|_|\n|44|Search For Range|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Search%20For%20Range\"\u003eLink\u003c/a\u003e|_|_|_|\n|45|Search in Sorted Matrix|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Search%20In%20Sorted%20Matrix\"\u003eLink\u003c/a\u003e|_|_|_|\n|46|Selection Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Selection%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|47|Shifted Binary Search|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Shifted%20Binary%20Search\"\u003eLink\u003c/a\u003e|_|_|_|\n|48|Single Cycle Check|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Single%20Cycle%20Check\"\u003eLink\u003c/a\u003e|_|_|_|\n|49|Smallest Difference|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Smallest%20Difference\"\u003eLink\u003c/a\u003e|_|_|_|\n|50|Sorted Squared Array|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Sorted%20Squared%20Array\"\u003eLink\u003c/a\u003e|_|_|_|\n|51|Spiral Traverse|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Spiral%20Traverse\"\u003eLink\u003c/a\u003e|_|_|_|\n|52|Subarray Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Subarray%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|53|Sum of Linkedlist|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Sum%20of%20Linked%20List\"\u003eLink\u003c/a\u003e|_|_|_|\n|54|Tandem Bicycle|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Tandem%20Bicycle\"\u003eLink\u003c/a\u003e|_|_|_|\n|55|Three Number Sort|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Three%20Number%20Sort\"\u003eLink\u003c/a\u003e|_|_|_|\n|56|Three Number Sum|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Three%20Number%20Sum\"\u003eLink\u003c/a\u003e|_|_|_|\n|57|Tournament Winner|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Tournament%20Winner\"\u003eLink\u003c/a\u003e|_|_|_|\n|58|Two Number Sum|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Two%20Number%20Sum\"\u003eLink\u003c/a\u003e|_|_|_|\n|59|Validate Binary Search Tree|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Validate%20BST\"\u003eLink\u003c/a\u003e|_|_|_|\n|60|Validate Subsequence|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Validate%20Subsequence\"\u003eLink\u003c/a\u003e|_|_|_|\n|61|ZigZag Traverse|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/ZigZag%20Traverse\"\u003eLink\u003c/a\u003e|_|_|_|\n|62|Valid Starting City|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Valid%20Starting%20City\"\u003eLink\u003c/a\u003e|_|_|_|\n|63|Task Assignment|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Task%20Assignment\"\u003eLink\u003c/a\u003e|_|_|_|\n|64|Min Rewards|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Min%20Rewards\"\u003eLink\u003c/a\u003e|_|_|_|\n|65|Kadanes Algorithm|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Kadanes%20Algorithm\"\u003eLink\u003c/a\u003e|_|_|_|\n|66|Calender Matching|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Calender%20Matching\"\u003eLink\u003c/a\u003e|_|_|_|\n|67|Balanced Brackets|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Balanced%20Brackets\"\u003eLink\u003c/a\u003e|_|_|_|\n|68|Apartment Hunting|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Apartment%20Hunting\"\u003eLink\u003c/a\u003e|_|_|_|\n|69|Group Anagrams|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Group%20Anagrams\"\u003eLink\u003c/a\u003e|_|_|_|\n|70|Valid IP Addresses|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Valid%20IP%20Addresses\"\u003eLink\u003c/a\u003e|_|_|_|\n|71|Permutations|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Permutations\"\u003eLink\u003c/a\u003e|_|_|_|\n|72|Power Sets|\u003ca href=\"https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/Power%20Set\"\u003eLink\u003c/a\u003e|_|_|_|\n\n\n\n### Note: ReadMe file does not contain all the solution links from this repo. It is still in progress and I am updating in my free time.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fboudhayan%2Falgorithm-solutions-in-swift","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fboudhayan%2Falgorithm-solutions-in-swift","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fboudhayan%2Falgorithm-solutions-in-swift/lists"}