for (let i = 0; i < count; i = i + 1) {
rows.push(character);
character.repeat(i);
thats my code
for (let i = 0; i < count; i = i + 1) {
rows.push(character);
character.repeat(i);
thats my code
If you have a question about a specific challenge as it relates to your written code for that challenge and need some help, click the Help button located on the challenge. This button only appears if you have tried to submit an answer at least three times.
The Help button will create a new topic with all code you have written and include a link to the challenge also. You will still be able to ask any questions in the post before submitting it to the forum.
Thank you.
or if you want to keep using this topic, please provide a link to the step
i dont understand the question. im failing to pass this step
const character = "#";
const count = 8;
const rows = [];
// User Editable Region
for (let i = 0; i < count; i = i + 1) {
rows.push(character);
character.repeat(i);
}
// User Editable Region
let result = ""
for (const row of rows) {
result = result + row + "\n";
}
console.log(result);
User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/131.0.0.0 Safari/537.36
Learn Introductory JavaScript by Building a Pyramid Generator - Step 45
This is the line they wanted you to fix.
This line currently pushes one character to the rows array. But they want you to use repeat on the character to make it duplicate itself
you need to change the argument of push following the instructions, do not write a new line
try this
code removed by moderator
hi @T1S3YX
It is great that you solved the challenge, but instead of posting your full working solution, it is best to stay focused on answering the original poster’s question(s) and help guide them with hints and suggestions to solve their own issues with the challenge. How to Help Someone with Their Code Using the Socratic Method
We are trying to cut back on the number of spoiler solutions found on the forum and instead focus on helping other campers with their questions and definitely not posting full working solutions.