Skip to main content

Data Structures - Strings

1) Find if a given First String is a SubSequence of a Second String


2) Find Max Occurring Frequency Character in  a String


3) Check if Sequence of Characters of Two Strings can become same by removal of a Character


4) Remove all Duplicate Words from a String


5) Find for a Given Two Strings, if one is the rotation of the Other.


6) Find if two Strings are K-Anagrams


7) Longest Common Subsequence where character occurs at least k times.


8) Find if the two given Strings are anagrams of Each Other.



9) Anagram SubString Search

Comments

Post a Comment

Popular posts from this blog

HashMap in Java

1) Implement HashMap in Java, with the put and get operations   HashMap can be implemented in Java Using Arrays. Use the same logic that the Out of the Box   HashMap follows, for resizing, and load factor, when ever the HashMap reaches the size of the   resize with the load factor a new Array is created, and the previous array contents are copied over   to the new Array.  HashMap is Not Synchronized by default. We can synchronize the whole map by using Synchronization, or by using collection.synchronizedmap(map), which synchronizes all the operations on the map. Alternatively We can use the CocurrentHashMap which does not lock the read operations, rather locks the segments that are being written. 2) HashMap vs LinkedHashMap vs IdentityHashMap 3) HashMap vs ConcurrentHashMap 4) Implement a Cache using LinkedHashMap
Post a Comment
Read more