Feb 2

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Check if Array Is Sorted and Rotated.py

@@ -0,0 +1,21 @@
+from typing import List
+
+
+class Solution:
+    def check(self, nums: List[int]) -> bool:
+        return sum(nums[i] < nums[i-1] for i in range(len(nums))) <= 1
+
+
+def main():
+    nums = [3, 4, 5, 1, 2]
+    assert Solution().check(nums) is True
+
+    nums = [2, 1, 3, 4]
+    assert Solution().check(nums) is False
+
+    nums = [1, 2, 3]
+    assert Solution().check(nums) is True
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -5,7 +5,7 @@
 | Day | Problem | Level | Status |
 | --- | --- | --- | --- |
 | February 01 | [3151. Special Array I](https://leetcode.com/problems/special-array-i/) | Easy | Solved |
-| February 02 | []() |  |  |
+| February 02 | [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | Easy | Solved |
 | February 03 | []() |  |  |
 | February 04 | []() |  |  |
 | February 05 | []() |  |  |
@@ -37,6 +37,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 1 | 1 | 0 |
+| Easy   | 2 | 2 | 0 |
 | Medium | 0 | 0 | 0 |
 | Hard   | 0 | 0 | 0 |