Did you know SD-WANs can improve network connectivity? Check out this webinar to learn how an SD-WAN simplified, one-click tool can help you migrate and manage data in the cloud.
Become a Premium Member and unlock a new, free course in leading technologies each month.
Recursion-1 > triangle
prev | next | chance
We have triangle made of blocks. The topmost row has 1 block, the next row down has 2 blocks, the next row has 3 blocks, and so on. Compute recursively (no loops or multiplication) the total number of blocks in such a triangle with the given number of rows.
triangle(0) → 0
triangle(1) → 1
triangle(2) → 3
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
what is row and what is block and how they are related to triange and what we have to returnThey could have named this challenge "stairs". Here is a image I found to illustrate the concept. It's shape is roughly a triangle. They want to give total number of blocks needed to construct the triangle(stairs).
public int triangle(int rows) {
if(rows==1){
return 1;
}
return rows+triangle(rows-1);
}
above fails one test casexpected Runhow to decide base case begin with 0 or with 1. it is failing 0 case now
triangle(0) → 0 Exception:java.lang.StackOverflowErr or (line number:2) X
triangle(1) → 1 1 OK
triangle(2) → 3 3 OK
triangle(3) → 6 6 OK
triangle(4) → 10 10 OK
triangle(5) → 15 15 OK
triangle(6) → 21 21 OK
triangle(7) → 28 28 OK
other tests
If you are experiencing a similar issue, please ask a related question
Join the community of 500,000 technology professionals and ask your questions.