Today I solved..

---

LeetCode 75 - Level 1

Day 2.

• 205 Isomorphic Strings (Easy)
• 392 Is Subsequence (Easy)

---

Algorithm - Algorithm I

Day 2. Two Pointers

• 977 Squares of a Sorted Array (Easy)

• 189 Rotate Array (Medium)

  class Solution:
    def rotate(self, nums: List[int], k: int) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        n = len(nums)        
        k %= n
        count = 0
        i = 0
  
        while count != n:
  
            cache = nums[i]
  
            j = (i + k) % n
            nums[j], cache = cache, nums[j]
            count += 1
            while j != i:
                j = (j + k) % n
                nums[j], cache = cache, nums[j]
                count += 1
  
            i += 1