( Problem A ) Pikachu and the Game of Strings

( Problem A ) Pikachu and the Game of Strings | Editorial by abhinavkeshav

We have been given two strings **s** and **t** of length **n**.
We need to convert **s** to **t** in **minimum** possible days.
Process of counting days is described in the problem statement.
We will loop through the strings and calculate the **difference** between the **ascii** values of characters of both strings at position **i**.We will store the value in a variable named **v**.
Now the **days count** can be calculated as **(v/13)+(v%13)**.
If the **ascii** value of character of **s** is greater than the **ascii** value of character of **t** then we find **v** as **26+(difference between the ascii value of characters)**.

```
Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        String s=sc.next();
        String t=sc.next();
        int count=0;
        for(int i=0;i<n;i++){
            if((int)s.charAt(i)<=(int)t.charAt(i)){
                int v=(int)t.charAt(i)-(int)s.charAt(i);
                count+=(v/13)+(v%13);
            }else{
                int v=26+(int)t.charAt(i)-(int)s.charAt(i);
                count+=(v/13)+(v%13);
            }
        }
        System.out.println(count);
```

( Problem A ) Pikachu and the Game of Strings | Editorial by abhinavkeshav

Download submission

All caught up!

View submission

Is your resume even shortlisted?