. Day 6 - Challenge 3 - Array Rotation JavaScript Skip to main content

Day 6 - Challenge 3 - Array Rotation JavaScript

Solving the Array Rotation Problem using JavaScript

Introduction: 

Array manipulation is a common task in programming, and one interesting challenge is rotating an array to the right by a given number of steps. In this blog post, we will explore the array rotation problem, understand the approach to solving it, and implement a JavaScript program that effectively rotates an array.

Problem Description: 

Given an array of integers and a rotation count k, the task is to rotate the array to the right by k steps. For instance, if the input array is [1, 2, 3, 4, 5] and k is 2, the expected output would be [4, 5, 1, 2, 3].

Approach: 

To solve the array rotation problem, we can use a cyclic rotation approach. The idea is to repeatedly move the elements to their final positions while ensuring that we don't overwrite any values. This can be achieved in a few steps:

  1. Calculate the effective rotation count: Since rotating an array by its length or multiples of its length would result in the same array, we can calculate the effective rotation count by taking the remainder of k when divided by the array length.

  2. Create a new array to store the rotated elements.

  3. Iterate through the original array, and for each element at index i, calculate the new index after rotation using (i + effectiveRotation) % array.length, and place the element in the new array at the calculated index.

  4. The new array now holds the rotated elements.

JavaScript Implementation:

 


function rotateArray(arr, k) {
    const effectiveRotation = k % arr.length;
    const rotatedArray = [];

    for (let i = 0; i < arr.length; i++) {
        const newIndex = (i + effectiveRotation) % arr.length;
        rotatedArray[newIndex] = arr[i];
    }

    return rotatedArray;
}

// Example usage
const inputArray = [1, 2, 3, 4, 5];
const rotationCount = 2;
const rotatedResult = rotateArray(inputArray, rotationCount);
console.log(rotatedResult); // Output: [4, 5, 1, 2, 3]

Conclusion: 

In this blog post, we explored the array rotation problem, discussed a cyclic rotation approach to solving it, and implemented a JavaScript program to rotate an array to the right by a given number of steps. Array manipulation problems like this one not only test our algorithmic skills but also enhance our ability to think critically and design efficient solutions. Happy coding!

Other Challenges:

  1. Day 3 Challenges
  2. Day 4 Challenges
  3. Day 5 Challenges

 

Labels:

Comments

Post a Comment

Popular posts from this blog

Day 7 - Challenge 2 - Valid Parentheses: A Guide to Checking Bracket Validity in JavaScript

Valid Parentheses: A Guide to Checking Bracket Validity in JavaScript Brackets are a fundamental part of programming languages and are used to group and structure code. In this blog post, we will explore the problem of determining whether a given string of brackets is valid or not using JavaScript. This problem is commonly referred to as the "Valid Parentheses" problem. Understanding the Problem: The problem statement provides a string that consists of three types of brackets: ( , ) , { , } , [ , and ] . The task is to determine whether the brackets in the string are arranged in a valid manner. For a string to be valid, each opening bracket must have a corresponding closing bracket of the same type, and they must be arranged in the correct order. For example, the strings "(){}[]" and "{[()]}" are valid, while "([)]" and "{{]}" are not. Approach: To solve this problem, we can use a stack data structure. The stack will help us keep tr...
Post a Comment
Read more

Day 9 - Challenge 2 - Reverse Linked List

Reversing a Singly Linked List in JavaScript: An In-Place Approach Introduction:   Singly linked lists are fundamental data structures in computer science that consist of a sequence of nodes, each containing data and a reference to the next node in the list. Reversing a singly linked list is a classic problem that challenges programmers to manipulate pointers effectively to achieve the desired outcome. In this blog post, we'll explore the problem of reversing a singly linked list using an in-place approach and provide a step-by-step solution in JavaScript. Problem Statement:   Given the head of a singly linked list, our task is to reverse the list in-place and return its new head. In other words, we need to modify the pointers of the nodes in such a way that the direction of the linked list is reversed. Solution Approach:   To solve this problem, we will iterate through the linked list while maintaining three pointers: previous , current , and next . The previous pointer...
Post a Comment
Read more

Day 8 - Challenge 3 - Unique Email Addresses

Solving the Problem of Counting Unique Email Addresses in JavaScript Introduction:  In today's digital age, email communication is an integral part of our lives. However, dealing with unique email addresses can sometimes be challenging due to variations that arise from period usage and the '+' character. In this blog post, we will explore how to tackle the problem of counting unique email addresses using JavaScript. Problem Statement: We are given a list of email addresses, and our task is to determine the number of unique email addresses. A unique email address consists of a local name and a domain name. The local name may contain periods ('.') and the character '+' which is ignored. Example:  Let's consider the following list of email addresses: "test.email+abc@gmail.com" "test.e.mail@gmail.com" "testemail@gmail.com" In this case, the number of unique email addresses is 1, as all three email addresses map to the same uniqu...
Post a Comment
Read more