Danny has a possible list of passwords of Manny’s facebook account. All passwords length is odd. But Danny knows that Manny is a big fan of palindromes. So, his password and reverse of his password
… Read More string
Given Set of words or A String find whether chain is possible from these words or not
You are given N strings or N words. You have to find whether a chain can be formed with all the strings given namely n ?
Chain : A chain can be formed between 2
Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )
Main DNA sequence(a string) is given (let say strDNA) and another string to search for(let say strPAT).
You have to find the minimum length window in strDNA where strPAT is subsequence.
… Read More You have to find the minimum length window in strDNA where strPAT is subsequence.
Add Sub Multiply very large number stored as string
Very large number like 2994320121 and 125346232 is given in character string.
You need to add, subtract and multiply two numbers and store number in character array only.
Logic
1) First way to create a
… Read More You need to add, subtract and multiply two numbers and store number in character array only.
Logic
1) First way to create a
Printing each word reverse in string
Find Percentage of Words matching in Two Strings
There are two strings s1 and s2. Find the maximum of percentage word matching from s1 to s2 and s2 to s1.
Where, percentage word matching= (Total words matched in s2/total number of words in
Printing Longest Common Subsequence
Printing Longest Common Subsequence
Given two sequences, print the longest subsequence present in both of them.
Examples:
LCS for input Sequences “ABCDGH” and “AEDFHR” is “ADH” of length 3.
LCS for input Sequences “AGGTAB” and
Given a string, find the first character which is non-repetitive
Given a string, find the first character which is non -repetitive i.e that character must not be present anywhere else in the string.
With two different solutions.
Eg : Input : teeterson
Output : r, Length of the longest substring without repeating characters
Length of the longest substring without repeating characters
Method 1 (Brute Force Method)
We can consider all substrings.
One by one and check for each substring whether it contains all unique characters or not.
There
Given a float number convert it into the string WITHOUT using any inbuilt Function
Convert a floating point number to string
Given a float number convert it into the string WITHOUT using any inbuilt Function
Method 1:
class Float2String
{
public static void main(String[] args)
{
float f=7.64f;
String