# Tag Archives: array-traversal-question

Given three arrays A[], B[] and C[] of size N each and two integers X and Y, the task is to, find the minimum costâ€¦ Read More
Given an array arr[] containing N integers, the task is to check whether the array is monotonic or not (monotonic means either the array isâ€¦ Read More
Given an array arr[] of N integers, the task is to find all indices in the array, such that for each index i the arithmeticâ€¦ Read More
Given a matrix mat[][] and an integer K, the task is to find the length of the shortest path in a matrix from top-left toâ€¦ Read More
Given an array arr[] and an integer K, the task is to find the absolute difference between the ceil of the total sum of theâ€¦ Read More
Given a matrix A[][] of size N*M and a 2D array Q[][] consisting of queries of the form {X, K}, the task for each queryâ€¦ Read More
Given a matrix of size M x N consisting of integers, the task is to print the matrix elements using Breadth-First Search traversal. Examples: Input:â€¦ Read More
Given an array arr[] of size N, the task is to find the minimum increments by 1 required to be performed on the array elementsâ€¦ Read More
Given a 2D square matrix arr[][] of dimensions N x N, the task is to find the maximum path sum by moving diagonally from anyâ€¦ Read More
Given an array arr[] of size N, where arr[i] is the time required to visit ith city, the task is to find the minimum totalâ€¦ Read More
Given a matrix arr[][] of size N * M, the task is to print the matrix after removing all rows and columns from the matrixâ€¦ Read More
Given an array arr[] of size N, the task is to check if the array is spirally sorted or not. If found to be true,â€¦ Read More
Given an array arr[] consisting of N integers and an integer K, the task is to check if the sum of the array can beâ€¦ Read More
Given an array A[] consisting of N integers, where each value represents the marks of the ith student, the task is to find the minimumâ€¦ Read More
Given an array arr[] consisting of N integers and three integers X, Y, and K, the task is to find the farthest index that canâ€¦ Read More