Skip to content

Commit d9b5b8c

Browse files
committed
add array sorted and rotated
1 parent 9aa48f6 commit d9b5b8c

4 files changed

Lines changed: 53 additions & 36 deletions

File tree

‎Algorithm Solutions In Swift.xcodeproj/project.pbxproj‎

Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -20,6 +20,7 @@
2020
1F7037672F3E5642002CFFE1 /* _RopeModule in Frameworks */ = {isa = PBXBuildFile; productRef = 1F7037662F3E5642002CFFE1 /* _RopeModule */; };
2121
1F85E42E2F500D0F0097933E /* RecursiveBubbleSort.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F85E42D2F500D060097933E /* RecursiveBubbleSort.swift */; };
2222
1F85E4312F500D2A0097933E /* RecusriveInsertionSort.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F85E4302F500D210097933E /* RecusriveInsertionSort.swift */; };
23+
1F85E4362F5062490097933E /* SortedRotated.swift in Sources */ = {isa = PBXBuildFile; fileRef = 1F85E4352F5062420097933E /* SortedRotated.swift */; };
2324
6A09C87827EA646600BB9A38 /* MinRewards.swift in Sources */ = {isa = PBXBuildFile; fileRef = 6A09C87727EA646600BB9A38 /* MinRewards.swift */; };
2425
6A09C87B27EA690200BB9A38 /* BuySellStock.swift in Sources */ = {isa = PBXBuildFile; fileRef = 6A09C87A27EA690200BB9A38 /* BuySellStock.swift */; };
2526
6A09C87C27EA690200BB9A38 /* BuySellStock.swift in Sources */ = {isa = PBXBuildFile; fileRef = 6A09C87A27EA690200BB9A38 /* BuySellStock.swift */; };
@@ -332,6 +333,7 @@
332333
/* Begin PBXFileReference section */
333334
1F85E42D2F500D060097933E /* RecursiveBubbleSort.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RecursiveBubbleSort.swift; sourceTree = "<group>"; };
334335
1F85E4302F500D210097933E /* RecusriveInsertionSort.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = RecusriveInsertionSort.swift; sourceTree = "<group>"; };
336+
1F85E4352F5062420097933E /* SortedRotated.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = SortedRotated.swift; sourceTree = "<group>"; };
335337
6A09C87727EA646600BB9A38 /* MinRewards.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = MinRewards.swift; sourceTree = "<group>"; };
336338
6A09C87A27EA690200BB9A38 /* BuySellStock.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = BuySellStock.swift; sourceTree = "<group>"; };
337339
6A09C87F27EBA43800BB9A38 /* SmallestSubstringAllCharacters.swift */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.swift; path = SmallestSubstringAllCharacters.swift; sourceTree = "<group>"; };
@@ -610,6 +612,14 @@
610612
path = "Recursive Insertion Sort";
611613
sourceTree = "<group>";
612614
};
615+
1F85E4342F50623E0097933E /* Sorted and Rotated Array */ = {
616+
isa = PBXGroup;
617+
children = (
618+
1F85E4352F5062420097933E /* SortedRotated.swift */,
619+
);
620+
path = "Sorted and Rotated Array";
621+
sourceTree = "<group>";
622+
};
613623
6A09C87627EA645400BB9A38 /* Min Rewards */ = {
614624
isa = PBXGroup;
615625
children = (
@@ -1225,6 +1235,7 @@
12251235
6A88CEE526C056A400A3746B /* LeetCode */ = {
12261236
isa = PBXGroup;
12271237
children = (
1238+
1F85E4342F50623E0097933E /* Sorted and Rotated Array */,
12281239
1F85E42C2F500D010097933E /* Recursive Bubble Sort */,
12291240
6A6C59C92C4D78C9004309F7 /* Build a Matrix With Conditions */,
12301241
6A6C59C62C4D786F004309F7 /* Topological Sort */,
@@ -2810,6 +2821,7 @@
28102821
6A651A3D290783D6000731BB /* ContainsDuplicate.swift in Sources */,
28112822
6AF578E726A3E320007B37CA /* MoveElementToEnd.swift in Sources */,
28122823
6AE51D3D26B3C89C00102A7C /* SumOfLinkedList.swift in Sources */,
2824+
1F85E4362F5062490097933E /* SortedRotated.swift in Sources */,
28132825
6A88CED726BF03F700A3746B /* 3DSurfaceArea.swift in Sources */,
28142826
6A91243027023BF200D50C17 /* ReverseWords.swift in Sources */,
28152827
6A651A5E29078969000731BB /* PalindromeLinkedList.swift in Sources */,
Lines changed: 1 addition & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,7 @@
11
import Foundation
22

33

4-
//func insertionSort(array: inout [Int]) -> [Int] {
5-
// for idx in 1..<array.count {
6-
// var sortedIdx = idx - 1
7-
// let key = array[idx]
8-
// while sortedIdx >= 0, key < array[sortedIdx] {
9-
// array[sortedIdx + 1] = array[sortedIdx]
10-
// sortedIdx -= 1
11-
// }
12-
// array[sortedIdx + 1] = key
13-
// }
14-
// return array
15-
//}
164

175

6+
var array = [3, 4, 5, 1, 2]
187

19-
var array = [5, 3, 1, 7, 2]
20-
recursiveInsertionSort(&array)
21-
print(array)
Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
//
2+
// SortedRotated.swift
3+
// Algorithm Solutions In Swift
4+
//
5+
// Created by littlebanana on 26/02/26.
6+
//
7+
8+
// problem link: https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/
9+
10+
func check(_ nums: [Int]) -> Bool {
11+
var count = 0
12+
for i in stride(from: 1, to: nums.count, by: 1) {
13+
if nums[i] > nums[(i + 1)%nums.count] {
14+
count += 1
15+
}
16+
}
17+
return count <= 1
18+
}

‎README.md‎

Lines changed: 22 additions & 21 deletions
Original file line numberDiff line numberDiff line change
@@ -117,27 +117,28 @@ Suggestions and contributions are welcome.
117117
|81|Sort An Array|[Problem](https://leetcode.com/problemset/all/?search=Sort%20An%20Array)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sort%20An%20Array)|_|Sorting|_|
118118
|82|Sort Colors|[Problem](https://leetcode.com/problemset/all/?search=Sort%20Colors)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sort%20Colors)|_|Sorting|_|
119119
|83|Sort by Parity|[Problem](https://leetcode.com/problemset/all/?search=Sort%20by%20Parity)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sort%20by%20Parity)|_|Sorting|_|
120-
|84|Spiral Matrix II|[Problem](https://leetcode.com/problemset/all/?search=Spiral%20Matrix%20II)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Spiral%20Matrix%20II)|_|Matrix|_|
121-
|85|Sprial Matrix|[Problem](https://leetcode.com/problemset/all/?search=Sprial%20Matrix)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sprial%20Matrix)|_|Matrix|_|
122-
|86|Squares of a Sorted Array|[Problem](https://leetcode.com/problemset/all/?search=Squares%20of%20a%20Sorted%20Array)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Squares%20of%20a%20Sorted%20Array)|_|Sorting|_|
123-
|87|String to Integer(atoi)|[Problem](https://leetcode.com/problemset/all/?search=String%20to%20Integer%28atoi%29)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/String%20to%20Integer%28atoi%29)|_|String|_|
124-
|88|Strings Multiply|[Problem](https://leetcode.com/problemset/all/?search=Strings%20Multiply)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Strings%20Multiply)|_|String|_|
125-
|89|Sub Array Sum Equals K|[Problem](https://leetcode.com/problemset/all/?search=Sub%20Array%20Sum%20Equals%20K)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sub%20Array%20Sum%20Equals%20K)|_|Array|_|
126-
|90|Subsets|[Problem](https://leetcode.com/problems/subsets/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Subsets)|_|_|_|
127-
|91|Symmetric Tree|[Problem](https://leetcode.com/problemset/all/?search=Symmetric%20Tree)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Symmetric%20Tree)|_|Tree|_|
128-
|92|Three Sum Smaller|[Problem](https://leetcode.com/problems/3sum-smaller/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Three%20Sum%20Smaller)|_|Array|_|
129-
|93|Three Sum Zero|[Problem](https://leetcode.com/problemset/all/?search=Three%20Sum%20Zero)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Three%20Sum%20Zero)|_|Array|_|
130-
|94|Top K Frequent Elements|[Problem](https://leetcode.com/problems/top-k-frequent-elements/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Top%20K%20Frequent%20Elements)|_|_|_|
131-
|95|Topological Sort|[Problem](https://leetcode.com/problemset/all/?search=Topological%20Sort)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Topological%20Sort)|_|Graph|_|
132-
|96|Two Number Sum - Sorted Input Array|[Problem](https://leetcode.com/problemset/all/?search=Two%20Number%20Sum%20-%20Sorted%20Input%20Array)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Two%20Number%20Sum%20-%20Sorted%20Input%20Array)|_|Sorting|_|
133-
|97|Unique Binary Search Tree 2|[Problem](https://leetcode.com/problems/unique-binary-search-trees-ii/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Unique%20Binary%20Search%20Tree%202)|_|Tree|_|
134-
|98|Unique Email Address|[Problem](https://leetcode.com/problemset/all/?search=Unique%20Email%20Address)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Unique%20Email%20Address)|_|_|_|
135-
|99|Valid Anagram|[Problem](https://leetcode.com/problems/valid-anagram/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Anagram)|_|String|_|
136-
|100|Valid Palindrome 2|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Palindrome%202)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Palindrome%202)|_|String|_|
137-
|101|Valid Parantheses|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Parantheses)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Parantheses)|_|_|_|
138-
|102|Valid Parentheses|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Parentheses)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Parentheses)|_|_|_|
139-
|103|Valid Suduku|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Suduku)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Suduku)|_|_|_|
140-
|104|Word Pattern|[Problem](https://leetcode.com/problemset/all/?search=Word%20Pattern)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Word%20Pattern)|_|String|_|
120+
|84|Sorted and Rotated Array|[Problem](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sorted%20and%20Rotated%20Array)|_|Sorting|_|
121+
|85|Spiral Matrix II|[Problem](https://leetcode.com/problemset/all/?search=Spiral%20Matrix%20II)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Spiral%20Matrix%20II)|_|Matrix|_|
122+
|86|Sprial Matrix|[Problem](https://leetcode.com/problemset/all/?search=Sprial%20Matrix)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sprial%20Matrix)|_|Matrix|_|
123+
|87|Squares of a Sorted Array|[Problem](https://leetcode.com/problemset/all/?search=Squares%20of%20a%20Sorted%20Array)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Squares%20of%20a%20Sorted%20Array)|_|Sorting|_|
124+
|88|String to Integer(atoi)|[Problem](https://leetcode.com/problemset/all/?search=String%20to%20Integer%28atoi%29)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/String%20to%20Integer%28atoi%29)|_|String|_|
125+
|89|Strings Multiply|[Problem](https://leetcode.com/problemset/all/?search=Strings%20Multiply)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Strings%20Multiply)|_|String|_|
126+
|90|Sub Array Sum Equals K|[Problem](https://leetcode.com/problemset/all/?search=Sub%20Array%20Sum%20Equals%20K)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Sub%20Array%20Sum%20Equals%20K)|_|Array|_|
127+
|91|Subsets|[Problem](https://leetcode.com/problems/subsets/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Subsets)|_|_|_|
128+
|92|Symmetric Tree|[Problem](https://leetcode.com/problemset/all/?search=Symmetric%20Tree)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Symmetric%20Tree)|_|Tree|_|
129+
|93|Three Sum Smaller|[Problem](https://leetcode.com/problems/3sum-smaller/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Three%20Sum%20Smaller)|_|Array|_|
130+
|94|Three Sum Zero|[Problem](https://leetcode.com/problemset/all/?search=Three%20Sum%20Zero)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Three%20Sum%20Zero)|_|Array|_|
131+
|95|Top K Frequent Elements|[Problem](https://leetcode.com/problems/top-k-frequent-elements/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Top%20K%20Frequent%20Elements)|_|_|_|
132+
|96|Topological Sort|[Problem](https://leetcode.com/problemset/all/?search=Topological%20Sort)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Topological%20Sort)|_|Graph|_|
133+
|97|Two Number Sum - Sorted Input Array|[Problem](https://leetcode.com/problemset/all/?search=Two%20Number%20Sum%20-%20Sorted%20Input%20Array)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Two%20Number%20Sum%20-%20Sorted%20Input%20Array)|_|Sorting|_|
134+
|98|Unique Binary Search Tree 2|[Problem](https://leetcode.com/problems/unique-binary-search-trees-ii/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Unique%20Binary%20Search%20Tree%202)|_|Tree|_|
135+
|99|Unique Email Address|[Problem](https://leetcode.com/problemset/all/?search=Unique%20Email%20Address)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Unique%20Email%20Address)|_|_|_|
136+
|100|Valid Anagram|[Problem](https://leetcode.com/problems/valid-anagram/)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Anagram)|_|String|_|
137+
|101|Valid Palindrome 2|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Palindrome%202)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Palindrome%202)|_|String|_|
138+
|102|Valid Parantheses|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Parantheses)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Parantheses)|_|_|_|
139+
|103|Valid Parentheses|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Parentheses)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Parentheses)|_|_|_|
140+
|104|Valid Suduku|[Problem](https://leetcode.com/problemset/all/?search=Valid%20Suduku)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Valid%20Suduku)|_|_|_|
141+
|105|Word Pattern|[Problem](https://leetcode.com/problemset/all/?search=Word%20Pattern)|[Solution](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/LeetCode/Word%20Pattern)|_|String|_|
141142
<!-- AUTO:END:LEETCODE -->
142143

143144
### [AlgoExpert](https://github.com/boudhayan/Algorithm-Solutions-In-Swift/tree/main/AlgoExpert/)

0 commit comments

Comments
 (0)