41. First Missing Positive

leetcode-potd

Given an unsorted integer array nums. Return the smallest positive integer that is not present in nums. You must implement an algorithm that runs in O(n) time and

Summed Matrix

gfg-potd

A matrix is constructed of size n*n and given an integer ‘q’. The value at every cell of the matrix is given as, M(i,j)

Scroll to Top