Microsoft

3 Sum - InterviewBit Solution

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target.

Pretty Json - InterviewBit Solution

Given a string A representing JSON object. Return an array of the string denoting JSON object with proper indentation.

Divide Integers InterviewBit Solution

Divide two integers without using multiplication, division and mod operator. Return the floor of the result of the division.

Justified Text - InterviewBit Solution

Given a string A representing JSON object. Return an array of the string denoting JSON object with proper indentation. Rules for proper inde

Multiply Strings - InterviewBit Solution

Multiply Strings in C++, without using libraries for this purpose.

Add Binary Strings InterviewBit Solution

Given two binary strings, return their sum (also a binary string). Example: a = "100" -> 4 in decimal b = "11" -> 3 in decimal Return a +

Roman To Integer InterviewBit Solution

Given a string A representing a roman numeral. Convert A into an integer. A is guaranteed to be within the range from 1 to 3999.

Integer To Roman InterviewBit Solution

Given an integer A, convert it to a roman numeral, and return a string corresponding to its roman numeral version.

Atoi - InterviewBit Solution

Implement atoi to convert a string to an integer.

Reverse the String InterviewBit Solution

Given a string A. Return the string A after reversing the string word by word.