. Day 6 - Challenge 1 - Rotating a 2D Matrix in Place Skip to main content

Day 6 - Challenge 1 - Rotating a 2D Matrix in Place

Rotating a 2D Matrix in Place: A JavaScript Solution

Introduction: 

Rotating a 2D matrix by 90 degrees clockwise is a classic algorithmic problem that challenges your ability to manipulate arrays and indexes efficiently. In this blog post, we will explore an elegant solution to this problem using JavaScript, without requiring any extra space. We'll break down the problem, outline the approach, and provide a step-by-step implementation.

Problem Statement: 

Given a 2D matrix represented as an array of arrays, your task is to rotate the matrix by 90 degrees clockwise in-place.

Approach: 

The key idea behind rotating a matrix in-place is to perform a series of cyclic swaps of elements. We'll start by working on the outermost layer of the matrix and move towards the inner layers. For each layer, we'll perform a cyclic swap of four elements in a clockwise manner until the entire matrix is rotated.

Implementation in JavaScript: 

Let's dive into the JavaScript code that accomplishes this task:


function rotateMatrix(matrix) {
    const n = matrix.length;

    // Iterate through layers
    for (let layer = 0; layer < Math.floor(n / 2); layer++) {
        const first = layer;
        const last = n - 1 - layer;

        // Iterate within the current layer
        for (let i = first; i < last; i++) {
            const offset = i - first;
            const top = matrix[first][i]; // Save top element

            // Left to top
            matrix[first][i] = matrix[last - offset][first];

            // Bottom to left
            matrix[last - offset][first] = matrix[last][last - offset];

            // Right to bottom
            matrix[last][last - offset] = matrix[i][last];

            // Top to right
            matrix[i][last] = top; // Assign saved top to right
        }
    }
}

// Example usage
const matrix = [
    [1, 2, 3],
    [4, 5, 6],
    [7, 8, 9]
];

rotateMatrix(matrix);

console.log(matrix); // The rotated matrix will be printed here

Conclusion: 

Rotating a 2D matrix by 90 degrees clockwise without using extra space is a challenging problem that can be efficiently solved using cyclic swaps. The provided JavaScript solution demonstrates a step-by-step approach to achieve the rotation in-place. Understanding this algorithmic technique can be helpful not only for solving similar array manipulation problems but also for strengthening your programming skills overall.

Now write the same program in your favorite language in comment section. 

Other Challenges:

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

 

Comments

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...

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...

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...