title | date | tags | domain |
---|---|---|---|
Task 18 ( 10th NOV 2022 ) |
2022-11-09 16:00:00 -0800 |
Problem of the day week 3 |
CP |
Every day we will be giving you one problem to solve from the easy level and will increase the difficulty day by day. Problems will be published on the Hackerrank website to submit your solution to the problem, follow the given steps:
- Create an account on hackerrank website ( If already have an account, leave this step).
- Link the problem link which will be provided below.
- Read and solve the problem and submit your solution there.
- If you have doubts regarding the problem or you got stuck, you can contact the mentor assigned to you.
Given a string S, and a number N where length(S) is perfectly divisible by N, we need to generate substrings of length N from S. Then, the ASCII value of the Substrings should be added in a specific manner to get the output. Check the example for the explanation
Input Format
The first line contains the number of Test cases T. 3*T lines follow. The first line of every test case contains the length of the String The second line contains the String S. The third line contains N.
Link for the problem : https://www.hackerrank.com/problem-of-the-day-week-3
All the best ✨