top of page
Search
Valid Ip Addresses InterviewBit Solution
Given a string containing only digits, restore it by returning all possible valid IP address combinations.
A valid IP address must be in the
Compare Version Numbers InterviewBit Solution
Problem: Compare Version Numbers Problem Statement: Compare two version numbers version1 and version2. If version1 > version2 return 1,...
Reverse the String InterviewBit Solution
Given a string A.
Return the string A after reversing the string word by word.
Length of Last Word InterviewBit Solution
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
If the
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:
Convert to Palindrome
Given a string A consisting only of lowercase characters, we need to check whether it is possible to make this string a palindrome after rem
Minimum Characters required to make a String Palindromic InterviewBit Solution
Given a string A. The only operation allowed is to insert characters at the beginning of the string.
Find how many minimum characters are ne
Implement StrStr Interviewbit Solution
Implement strStr().
strstr - locate a substring ( needle ) in a string ( haystack ).
Try not to use standard library string functions for
Count And Say InterviewBit Solution
The count-and-say sequence is the sequence of integers beginning as follows:
1, 11, 21, 1211, 111221, ...
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
bottom of page