Sum of pairwise Hamming Distance InterviewBit SolutionHamming distance between two non-negative integers is defined as the number of positions at which the corresponding bits are different.
Prime Sum Interviewbit SolutionGiven an even number ( greater than 2 ), return two prime numbers whose sum will be equal to given number.
Anti Diagonals Interviewbit SolutionGive a N*N square matrix, return an array of its anti-diagonals. Look at the example for more details.
Kth Row of Pascal's Triangle Interviewbit SolutionGiven an index k, return the kth row of the Pascal’s triangle. Pascal’s triangle : To generate A[C] in row R, sum up A’[C] and A’[C-1] from
Pascal Triangle Interviewbit SolutionGiven numRows, generate the first numRows of Pascal’s triangle. Pascal’s triangle : To generate A[C] in row R, sum up A’[C] and A’[C-1] from
Spiral Order Matrix II Interviewbit SolutionGiven an integer A, generate a square matrix filled with elements from 1 to A2 in spiral order.
N/3 Repeat Number Interviewbit SolutionYou’re given a read only array of n integers. Find out if any integer occurs more than n/3 times in the array in linear time and constant ad