Count pairs Sum in matrices

gfg-potd

Given two matrices mat1[][] and mat2[][] of size n x n, where the elements in each matrix are arranged in strictly ascending order. Specifically, each row is sorted

Kth element in Matrix

gfg-potd

Given a matrix mat[][] of size n*n, where each row and column is sorted in non-decreasing order. Find the kth smallest element in the matrix. Examples:

Majority Element

gfg-potd

Given an array arr[]. Find the majority element in the array. If no majority element exists, return -1. Note: A majority element in an array

Unique Number III

gfg-potd

Given an array of integers arr[] where, every element appears thrice except for one which occurs once.Find that element which occurs once. Examples: Input: arr[] = [1, 10, 1, 1]

Unique Number II

gfg-potd

Given an array arr[] containing 2*n + 2 positive numbers, out of which 2*n numbers exist in pairs whereas only two number occur exactly once and

Scroll to Top