Given two arrays A[] and B[], both consisting of N positive integers, the task is to find the maximum score among all possible same-indexed subarrays… Read More
Gblog
Must Do Coding Questions for Product Based Companies
As the placement season is back, GeeksforGeeks is here to help you crack the interview. We have selected some most commonly asked and MUST DO… Read More
Given a positive integer N, the task is to find the number of ways to represent N as Bitwise XOR of distinct positive integers less… Read More
Given three non-negative integers A, B, and N where A is non-zero, the task is to find the number of integers less than or equal… Read More
Given an integer N, the task is to find the number of steps required to reduce the given number N to 1 by performing the… Read More
Given a matrix mat[][] of dimensions N * M and a set of coordinates of cell coordinates[][] of size Q, the task is to find… Read More
Given an integer N, repeatedly choose two distinct integers from the range 2 to N and if their GCD is found to be greater than… Read More
Given two positive integers, N and M, and an array arr[ ] consisting of (N + M) integers such that the first N elements are… Read More
Given an undirected Graph consisting of N nodes in the form of an adjacency matrix graph[][] of size N*N, the task is to print all… Read More
Given an array arr[] consisting of N positive integers and an integer K, the task is to find the highest frequency of any array element… Read More
Given an array arr[] consisting of N positive integers, the task is to find the elements which are greater than at least half of the… Read More
Given an array arr[] consisting of (N – 1), the task is to construct a permutation array P[] consisting of the first N Natural Numbers… Read More
Given a positive integer N, the task is to maximize the integer N by rearranging the digits and check if the sum of the left… Read More
Given two positive integers X and Y, the task is to check if it is possible to convert the number X into Y, either by… Read More
