Skip to content

Commit 0a66be1

Browse files
Create Readme.md
1 parent 6c5bff4 commit 0a66be1

File tree

1 file changed

+39
-0
lines changed

1 file changed

+39
-0
lines changed

5 - Loops/Readme.md

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
# [6th problem in the 30-Days-of-Code-Hackerrank Challenge](https://www.hackerrank.com/challenges/30-loops/problem?isFullScreen=true)
2+
## This repository contains the codes, I have been submitting in the 30 Days of Code program by Hackerrank.
3+
4+
## Task
5+
Given an integer,```n``` , print its first ```10``` multiples. Each multiple ```nxi```, (where ```1 ≤ n ≤ 10```) should be printed on a new line in the form: ```n x i = result```.
6+
7+
The problem should follow the following format:
8+
<img src="https://github.com/AdityaSeth777/30-Days-of-Code-Hackerrank/blob/main/5%20-%20Loops/5%20day.png">
9+
10+
## Logic
11+
It will be updated after uploading all the required details in all the questions in the repo.
12+
13+
## FAQ
14+
- How to stop the script? Ctrl+C (control+C for Mac)
15+
- For any other problems, feel free to raise an issue.
16+
17+
## Contributing
18+
Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
19+
20+
Please make sure to update tests as appropriate.
21+
22+
## License
23+
[MIT License © Aditya Seth](https://github.com/AdityaSeth777/30-Days-of-Code-Hackerrank/blob/main/License)
24+
25+
## What next ?
26+
- I will be working on completing this wonderful bunch of programs by Hackerrank, which I will be uploading as well.
27+
- Along with that, I will be uploading other programs as well including my college assignments and other projects.
28+
29+
## Where to contact ?
30+
31+
32+
## 🙋‍♂️ Support
33+
34+
💙 If you like this project, give it a ⭐ and share it with friends!<br><br>
35+
[☕ Buy me a coffee](https://www.buymeacoffee.com/adityaseth)
36+
37+
---
38+
39+
Made with ❤️ and C, C++, Python, Ruby, and Kotlin. <br><br>

0 commit comments

Comments
 (0)