Rotate Image Solution | Leetcode (In-place)

Introduction:

In this tutorial we will try to solve Rotate Image problem from Leetcode. it is an important question from coding interview point of view. so let's try to solve it.

Problem Statement:

We have give a n*n 2D matrix. and we have to rotate it by 90 degree in Clockwise direction.

Actually if you know little bit about Image Processing, then You already know that for manipulation or processing purpose we represent any image in the form of a 2D matrix. that's why the name of the problem is Rotate Image, which is quite relatable.

Given input matrix =
[
  [ 5, 1, 9,11],
  [ 2, 4, 8,10],
  [13, 3, 6, 7],
  [15,14,12,16]
], 

Output:
[
  [15,13, 2, 5],
  [14, 3, 4, 1],
  [12, 6, 8, 9],
  [16, 7,10,11]
]

Solution:

whenever you find these type of problem related to 2D matrix. then think in this way.

In any 2D matrix there will be four corner points, leftTop, rightTop, leftDown, rightDown. so we have to keep track of these four points. and we need an extra variable which will keep track of when we will stop doing this or when we will stop our execution.

Full Code:

void rotate(vector<vector<int>>& matrix) {
    int s=matrix.size()-1;
    int m=0;
    int j=s-m;
    while(m<j){
        int i=m,k=s-m,l=s-m;
    while(i<j){
        int temp=matrix[m][i];
        matrix[m][i]=matrix[l][m];
        int temp1=matrix[i][j];
        matrix[i][j]=temp;
        temp=matrix[k][l];
        matrix[k][l]=temp1;
        matrix[l][m]=temp;
        i++;
        l--;
    }
    m++;
    if(m>j){
        break;
    }
    j=s-m;
}
    }

In this solution I am using 5 variables m, i, j, k, l;

m = when we will go to next row and when we will stop execution.

i = it will keep track of uppermost row.

j = it will keep track of rightmost column.

k=it will keep track of lowermost row.

l=it will keep track of leftmost column.

do a dry run and then you will completely understand the code.

still if you have any query, just comment it down.

Comments

Construct Binary Tree from preorder and inorder | Data Structure

Introduction: In this tutorial we are going to see how we can construct the binary tree from given preorder and inorder. Prerequisites: you should know about binary tree traversal and on paper you can draw binary tree from given preorder and inorder traversal. Inorder:left->root->right; Preorder:root->left->right; Problem Statement: we have given two arrays. one for preorder and another for inorder. by using these two array we have to built a binary tree. eg: preorder = [3,9,20,15,7] inorder = [9,3,15,20,7] solution: Solution: We will follow recursive approach to solve this question.let's discuss how we can solve it. Trick: In the given preorder the very first element will be the root of the tree. then we will find root element in inorder also. and we know in inorder traversal we have left part then root and then right part of the tree. by using preorder we can get the root of the main tree and by using inorder and root we can get the left part and right part of the...

Symmetric Tree | Interview Problem

Introduction: In this tutorial we are going to solve a good question which will clear your doubts on how BFS or level order traversal is useful to solve binary tree problems. this is basically a question from Leetcode, and it is really very good problem to practice BFS. Problem Statement: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmetric: But the following [1,2,2,null,3,null,3] is not: Link : Leetcode Link please make binary tree on paper by the given array above. and you will get a clear picture of the problem. what we are going to do in this problem. Solution: As we know we are going to apply BFS to solve this problem. actually you have to just get one thing to solve this problem. we will perform BFS, but with little change or modification. So first we will store the root->val in a vector or array of the left subtree. and during this we will first insert left child and then ...

Linked List Data Structure | Creation and Traversal

Introduction: In this tutorial we will create our linked list. Before writing code let's understand key words related to linked list: 1. Head: first node of the linked list is called the head of the list. and this node is most important. 2.Tail: last node is called the tail of the list which must points to null. step1: For creating the list first of all let's declare the structure of Nodes of the list: struct Node{ int val; struct Node *next; } step2: write main function: int main(){ int n; cout<<"enter the number of Nodes:"; cin>>n; struct Node* head = NULL; struct Node* temp; int m; while(n--){ cout<<"enter the data into nodes:"; cin>>m; ...

programming for beginners

Search This Blog