Microsoft 2/3

Longest Palindromic Substring InterviewBit Solution

Given a string S, find the longest palindromic substring in S. Substring of string S: S[i...j] where 0 <= i <= j < len(S) Palindrome string:

Implement StrStr Interviewbit Solution

Implement strStr(). strstr - locate a substring ( needle ) in a string ( haystack ). Try not to use standard library string functions for

Median of Array InterviewBit Solution

There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays ( The median of the array formed

Rotated Sorted Array Search InterviewBit Solution

Given an array of integers A of size N and an integer B. array A is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 mi

Search for a Range InterviewBit Solution

Given a sorted array of integers A(0 based index) of size N, find the starting and ending position of a given integer B in array A. Your alg

Square Root of Integer InterviewBit Solution

Given an integer, A. Compute and return the square root of A. If A is not a perfect square, return floor(sqrt(A)).

Sorted Permutation Rank InterviewBit Solution

Given a string, find the rank of the string amongst its permutations sorted lexicographically. Assume that no characters are repeated.

Trailing Zeros in Factorial InterviewBit Solution

Given an integer A, return the number of trailing zeroes in A!.

Grid Unique Paths InterviewBit Solution

A robot is located at the top-left corner of an A x B grid. The robot can only move either down or right at any point in time. The robot is

Anti Diagonals Interviewbit Solution

Give a N*N square matrix, return an array of its anti-diagonals. Look at the example for more details.