✨ Day 7; Week 1 ✔️

Author: AkashRajpurohit

README.md

@@ -4,14 +4,15 @@
 
 [Challenge Link](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/)
 
-## Week 1 🚧
+## Week 1 ✅
 
 1. [Number of Recent Calls](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3480/) ➡️ [CPP Solution](Week1/RecentCounter.cpp)
 2. [Combination Sum](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3481/) ➡️ [CPP Solution](Week1/combinationSum.cpp)
 3. [K-diff Pairs in an Array](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3482/) ➡️ [CPP Solution](Week1/findPairs.cpp)
 4. [Remove Covered Intervals](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3483/) ➡️ [CPP Solution](Week1/removeCoveredIntervals.cpp)
 5. [Complement of Base 10 Integer](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3484/) ➡️ [CPP Solution](Week1/bitwiseComplement.cpp)
 6. [Insert into a Binary Search Tree](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3485/) ➡️ [CPP Solution](Week1/insertIntoBST.cpp)
+7. [Rotate List](https://leetcode.com/explore/challenge/card/october-leetcoding-challenge/559/week-1-october-1st-october-7th/3486/) ➡️ [CPP Solution](Week1/rotateRight.cpp)
 
 ## Week 2 🚧
 

Week1/rotateRight.cpp

@@ -0,0 +1,47 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+class Solution {
+public:
+    ListNode* rotateRight(ListNode* head, int k) {
+        ListNode* iter = head, *prev, *iter2;
+        int numNodes = 0;
+        
+        if(k == 0 || !head) return head;
+        
+        while(iter) {
+            iter = iter->next;
+            numNodes++;
+        }
+        
+        k %= numNodes;
+        
+        if(numNodes == 1 || k == 0) return head;
+        
+        iter = head;
+        
+        while(numNodes - k > 0) {
+            prev = iter;
+            iter = iter->next;
+            numNodes--;
+        }
+        
+        prev->next = NULL;
+        
+        iter2 = iter;
+        
+        while(iter2->next) iter2 = iter2->next;
+        
+        iter2->next = head;
+        head = iter;
+        
+        return head;
+    }
+};