#string-manipulation

Overview In this section we will try to solve a problem mentioned in Perl Weekly Challenge. The problem is called Edit Distance. You are given two strings str1 and str2. Write a function to find out the minimum operations required to convert str1 into str2. The operations can be insert, remove or replace a character. Example Input: str1 = "kitten"; str2 = "sitting" Output: 3 Operation 1:…

Overview In this example we will see how to reverse a string in Java. This problem is mention in Perl Weekly Challenge. Let us say we have a string ‘This is the best language in the world’. The method should return ‘world the in language best the is This‘. All the leading and trailing spaces should be removed and if there are more than one spaces between the words it should be reduced to one…

Java Solution for Repeated String

Overview In this article we will see how to solve a Repeated String problem in Java. This problem is described in Hacker Rank. There is a string, s, of lowercase English letters that is repeated infinitely many times. Given an integer, n, find and print the number of letter a’s in the first n letters of the infinite string. Example s = ‘abcac’, n = 10 The substring we consider is abcacabcac,…

This was a easy problem but I faced some difficulty in understanding it. The problem was to calculate the minimum number of steps required for a string. First the string is taken as input,then the first character is loaded,printed and increment operations are done till we dont reach the second character.

The main point was that if the difference is positive then the difference can be just 

a[i]-a[i-1]                     provided i>0

whereas if this difference is negative then you will have to subtract its absolute value from 26 i.e.