#	Problem	Difficulty	Topics Used	Approach Summary	Complexity	Link
1	Move Zeroes	Easy	Array, Two Pointers	Maintain non-zero index and swap when needed	Time: O(n), Space: O(1)	https://leetcode.com/problems/move-zeroes/description/
2	Rotate Array	Medium	Array, Two Pointers, Reversal Technique	Reverse entire array → reverse first k → reverse remaining	Time: O(n), Space: O(1)	https://leetcode.com/problems/rotate-array/description/
3	Check if Array is Sorted and Rotated	Easy	Array	Count the number of places where order breaks; valid if ≤ 1	Time: O(n), Space: O(1)	https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/description/
4	Remove Duplicates from Sorted Array	Easy	Array, Two Pointers	Slow–fast pointer technique to overwrite duplicates	Time: O(n), Space: O(1)	https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/
5	Fibonacci Number	Easy	Dynamic Programming, Math	Iterative DP or optimized variable-based approach	Time: O(n), Space: O(1)	https://leetcode.com/problems/fibonacci-number/description/
6	Valid Palindrome	Easy	String, Two Pointers	Normalize string, compare characters inward	Time: O(n), Space: O(1)	https://leetcode.com/problems/valid-palindrome/description/
7	Palindrome Number	Easy	Math	Reverse digits without converting to string	Time: O(log n), Space: O(1)	https://leetcode.com/problems/palindrome-number/description/
8	Reverse Integer	Medium	Math	Pop–push digits and check for overflow using bounds	Time: O(log n), Space: O(1)	https://leetcode.com/problems/reverse-integer/description/