Problem Summary

Determine the number of bits to flip when converting integer n to integer m.

Read More

Problem Summary

Given a decimal number that is passed in as a string, return the binary representation (also a string). If the fractional part of the number can not be represented accurately in binary with at most 32 characters, return ERROR.

Read More

Problem Summary

Find the number of trailing zeros in N! (N factorial).

Read More

Problem Summary

Given two strings of length N (P and Q) and an integer S, find the maximum of L such that there exists a pair of indices(i,j) for which we have M(i,j,L) ≤ S.

M(i,j,L) refers to the size of the set {0 ≤ x < L | p[i+x] ≠ q[j+x]}.

Read More

Problem Summary

Given a sorted array of N integers, find the starting and ending position of a given target value.

Read More

Problem Summary

Given N pieces of wood with integer length L[i], cut them into equal to or more than K pieces with the same integer length. Find the maximum length of the small pieces.

Read More

Problem Summary

A is an array with N integers which has the following features:

1. The numbers in adjacent positions are different.
2. A[0] < A[1] && A[N - 2] > A[N - 1].

We define a position P is a peak if: A[P] > A[P-1] && A[P] > A[P+1]

Find a peak element in this array.

Read More

Problem Summary

Suppose there are K packets with (x1, x2, x3,….xk) candies in them, where xi denotes the number of candies in the ith packet, then we define unfairness as

Given N packets, find the minimum unfairness when you pick K out of N packets.

Read More

Problem Summary

Given an array A with N integers, find the maximum sum of a

1. Continguous subarray.
2. Not necessarily contiguous subarray.

Empty subarrays or subsequences should not be considered.

Read More

Problem Summary

Given a string of integers, whose first character is not zero, find the sum of all substrings.

Read More