Loading...

Wellesley College Computer Science Club

About

The Wellesley Computer Science Club is dedicated to fostering community within the Computer Science community through events focused on technology, professional development, and academic enrichment. We strive to provide opportunities for students to connect, collaborate, and deepen their engagement with computer science both inside and outside the classroom.

Calendar

only available to Wellesley students

Resources

CS Course Pre-requisite Diagram Tech Recruitment Guide CS Club Tech Referrals List Job Posting Github

Meet the Eboard!

Question of the Week

Reverse Nodes in k-Group

Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is.

You may not alter the values in the list's nodes, only nodes themselves may be changed.

 

Example 1:

Input: head = [1,2,3,4,5], k = 2
Output: [2,1,4,3,5]

Example 2:

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.val <= 1000

 

Follow-up: Can you solve the problem in O(1) space?


HINT

Think about what you could store to avoid re-scanning the input.


Contact

email us for inquiries

Follow Us on Instagram!