Rotate List - LeetCode Can you solve this real interview question? Rotate List - Given the head of a linked list, rotate the list to the right by k places
Rotate Image - LeetCode You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise) You have to rotate the image in-place, which means you have to modify the input 2D matrix directly
Rotate Array - LeetCode Can you solve this real interview question? Rotate Array - Given an integer array nums, rotate the array to the right by k steps, where k is non-negative
Reverse Nodes in k-Group - LeetCode Example 1: [https: assets leetcode com uploads 2020 10 03 reverse_ex1 jpg] Input: head = [1,2,3,4,5], k = 2 Output: [2,1,4,3,5] Example 2: [https: assets leetcode com uploads 2020 10 03 reverse_ex2 jpg] Input: head = [1,2,3,4,5], k = 3 Output: [3,2,1,4,5] Constraints: * The number of nodes in the list is n * 1 <= k <= n <= 5000 * 0 <= Node
Linked List - LeetCode Level up your coding skills and quickly land a job This is the best place to expand your knowledge and get prepared for your next interview
Reverse Linked List II - LeetCode Example 1: [https: assets leetcode com uploads 2021 02 19 rev2ex2 jpg] Input: head = [1,2,3,4,5], left = 2, right = 4 Output: [1,4,3,2,5] Example 2: Input: head = [5], left = 1, right = 1 Output: [5] Constraints: * The number of nodes in the list is n * 1 <= n <= 500 * -500 <= Node val <= 500 * 1 <= left <= right <= n Follow up: Could you do
Linked List Cycle II - LeetCode Example 1: [https: assets leetcode com uploads 2018 12 07 circularlinkedlist png] Input: head = [3,2,0,-4], pos = 1 Output: tail connects to node index 1 Explanation: There is a cycle in the linked list, where tail connects to the second node
Split Linked List in Parts - LeetCode Example 1: [https: assets leetcode com uploads 2021 06 13 split1-lc jpg] Input: head = [1,2,3], k = 5 Output: [ [1], [2], [3], [], []] Explanation: The first element output [0] has output [0] val = 1, output [0] next = null