Given an infinite matrix filled with the natural numbers as shown below:
1 2 4 7 . . . 3 5 8 . . . . 6 9 . . . . . 10 . . . . . . . . . . . .
Also, given an integer N and the task is to find the row and the column of the integer N in the given matrix.
Input: N = 5 Output: 2 2 5 is present in the 2nd row and the 2nd column. Input: N = 3 Output: 2 1
Approach: On observing the problem carefully, the row number can be obtained by subtracting first x natural numbers from N such that they satisfy the condition N – (x * (x + 1)) / 2 ≥ 1 and the resultant value will be the required row number.
To get the corresponding column, add first x natural numbers to 1 such that they satisfy the condition 1 + (y * (y + 1)) / 2 ≤ A. Subtract this resultant value from N to get the gap between the base and the given value and again subtract the gap from y + 1.
Below is the implementation of the above approach:
Time Complexity: O(log(N))
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Find orientation of a pattern in a matrix
- Print matrix in diagonal pattern
- Printing string in plus ‘+’ pattern in the matrix
- Print matrix in snake pattern
- Print concentric rectangular pattern in a 2d matrix
- Print numbers in matrix diagonal pattern
- Print matrix in snake pattern from the last column
- Find trace of matrix formed by adding Row-major and Column-major order of same matrix
- Find the maximum sum of Plus shape pattern in a 2-D array
- Find sub-matrix with the given sum
- Find a sub matrix with maximum XOR
- Find the mean vector of a Matrix
- Find row with maximum sum in a Matrix
- Find if given matrix is Toeplitz or not
- Find the sum of Eigen Values of the given N*N matrix
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.