Point book links at canonical repo URL (AdvancedAlgorithmPatterns)

Author: arpanpathak

CodingInterviewFightClub/book.toml

@@ -12,8 +12,8 @@ create-missing = false
 default-theme = "navy"
 preferred-dark-theme = "navy"
 mathjax-support = true
-git-repository-url = "https://github.com/arpanpathak/Algorithms_Kotlin"
-edit-url-template = "https://github.com/arpanpathak/Algorithms_Kotlin/edit/main/src/{path}"
+git-repository-url = "https://github.com/arpanpathak/AdvancedAlgorithmPatterns"
+edit-url-template = "https://github.com/arpanpathak/AdvancedAlgorithmPatterns/edit/main/src/{path}"
 additional-css = ["theme/css/nightowl.css"]
 additional-js = ["theme/js/book.js"]
 no-section-label = true

CodingInterviewFightClub/src/ch01-binary-search/apartment-hunting.md

@@ -1,6 +1,6 @@
 # 1.21 Apartment Hunting
 
-> **Source:** [`src/main/kotlin/binarysearch/ApartmentHunting.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/ApartmentHunting.kt)
+> **Source:** [`src/main/kotlin/binarysearch/ApartmentHunting.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/ApartmentHunting.kt)
 > **Pattern:** binary search + nearest-neighbor · **Gym page**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/capacity-to-ship-packages.md

@@ -1,6 +1,6 @@
 # 1.2 Capacity To Ship Packages Within D Days
 
-> **Source:** [`src/main/kotlin/binarysearch/CapacityToShipPackageWithinDDays.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/CapacityToShipPackageWithinDDays.kt)
+> **Source:** [`src/main/kotlin/binarysearch/CapacityToShipPackageWithinDDays.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/CapacityToShipPackageWithinDDays.kt)
 > **Pattern:** binary search on the answer · **Core page**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/closest-subsequence-sum.md

@@ -1,6 +1,6 @@
 # 1.22 Closest Subsequence Sum
 
-> **Source:** [`src/main/kotlin/binarysearch/ClosestSebsequenceSum.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/ClosestSebsequenceSum.kt)
+> **Source:** [`src/main/kotlin/binarysearch/ClosestSebsequenceSum.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/ClosestSebsequenceSum.kt)
 > **Pattern:** meet-in-the-middle + binary search · **The gym boss**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/find-first-and-last-position.md

@@ -1,6 +1,6 @@
 # 1.3 Find First And Last Position Of Target
 
-> **Source:** [`src/main/kotlin/binarysearch/FindFirstAndLastPosition.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/FindFirstAndLastPosition.kt)
+> **Source:** [`src/main/kotlin/binarysearch/FindFirstAndLastPosition.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/FindFirstAndLastPosition.kt)
 > **Pattern:** lower bound + upper bound · **Core page**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/find-k-closest-elements.md

@@ -1,6 +1,6 @@
 # 1.4 Find K Closest Elements
 
-> **Source:** [`src/main/kotlin/binarysearch/FindKClosestElements.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/FindKClosestElements.kt)
+> **Source:** [`src/main/kotlin/binarysearch/FindKClosestElements.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/FindKClosestElements.kt)
 > **Pattern:** binary search on the *start index* · **Core page** (the heap version is a famous follow-up)
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/find-minimum-in-rotated-sorted-array.md

@@ -1,6 +1,6 @@
 # 1.5 Find Minimum In Rotated Sorted Array
 
-> **Source:** [`src/main/kotlin/binarysearch/FindMinimumInRotatedSortedArray.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/FindMinimumInRotatedSortedArray.kt)
+> **Source:** [`src/main/kotlin/binarysearch/FindMinimumInRotatedSortedArray.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/FindMinimumInRotatedSortedArray.kt)
 > **Pattern:** rotated-array pivot · **Core page**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/find-peak-element-safe.md

@@ -1,6 +1,6 @@
 # 1.7 Find Peak Element (Safe Boundaries)
 
-> **Source:** [`src/main/kotlin/binarysearch/FindPeakElementBetterSolution.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/FindPeakElementBetterSolution.kt)
+> **Source:** [`src/main/kotlin/binarysearch/FindPeakElementBetterSolution.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/FindPeakElementBetterSolution.kt)
 > **Pattern:** monotone slope descent, boundary-safe · **Variant page**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/find-peak-element.md

@@ -1,6 +1,6 @@
 # 1.6 Find Peak Element
 
-> **Source:** [`src/main/kotlin/binarysearch/FindPeakElement.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/FindPeakElement.kt)
+> **Source:** [`src/main/kotlin/binarysearch/FindPeakElement.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/FindPeakElement.kt)
 > **Pattern:** monotone slope descent · **Core page**
 
 ## The Problem

CodingInterviewFightClub/src/ch01-binary-search/first-bad-version.md

@@ -1,6 +1,6 @@
 # 1.8 First Bad Version
 
-> **Source:** [`src/main/kotlin/binarysearch/FirstBadVersion.kt`](https://github.com/arpanpathak/Algorithms_Kotlin/blob/main/src/main/kotlin/binarysearch/FirstBadVersion.kt)
+> **Source:** [`src/main/kotlin/binarysearch/FirstBadVersion.kt`](https://github.com/arpanpathak/AdvancedAlgorithmPatterns/blob/main/src/main/kotlin/binarysearch/FirstBadVersion.kt)
 > **Pattern:** lower bound via an API predicate · **Core page**
 
 ## The Problem