Java: Shift characters and compare

-

 

Given two strings A and B, return whether or not A can be shifted some number of times to get B.

 

For example,

     if A is abcde and B is cdeab, return true.

     If A is abc and B is acb, return false.


The Problem is much similar to :Using String inbuilt methods

Hope you can trace and understand easily 😊




Note:

·         The above solution is not the ultimate or the only way to approach the problem.

·         Attaching screenshot because you need to practice than copying code and executing in IDE.

·         As I said there are ‘N’ number of ways to solve the issue, here I tried using inbuilt methods from String class and get the solution.

·         Comments and suggestions are always welcome. git link: https://github.com/failed-peanut/java



Comments

Post a Comment

Popular posts from this blog

Java: Given a String find the distinct characters in it and count it

-
Image
  Given a String find the distinct characters in it and count it.   Input:   DISTINCT Output: DSNC 4 Approach: ·          Well, to approach this problem there are ‘N’ number of ways. ·          Convert string to character array. ·          Use HashMap to hold keys as characters and count as values. ·          Use any Set implemented Class add the characters and get the count. ( we can get distinct but need to remove repeated character ) ·          Use traditional Brute force method with multiple for loops, check each character and get the count. ·          Create your custom class with member variables as character and count add in to an ArrayList and get the count. ·        ...
Read more

Java: Reverse a singly linked list

-
Image
  Reverse a singly linked list     * Example:   Input : 1->2->3->4->NULL   Output: 4->3->2->1->NULL Approach: ·          Well, to approach this problem there are ‘N’ number of ways. ·          Use Stack data structure push Nodes, pop Node one by one and link to next popped Node. ·          Iterate through Nodes add it to List/Array iterate Array backwards. ·          Use recursive approach. ·          Use temp Nodes and change links iteratively. ·          Etc. Iterative Approach with using temp Nodes: ·          Assuming head is pointing to starting Node. Recursive Method: Note: ·          The above...
Read more