Available question text
Find the largest k such that the triangular number 1+2+…+k ≤ n (i.e., k(k+1)/2 ≤ n); equivalently compute the maximum number of complete staircase rows — solvable by solving the quadratic or via integer binary search.
Related questions
Continue with questions that share topics or the same question type.
- Collect Coins in a Tree
Coding
- Distribute Coins in Binary Tree
Coding
- Find Number of Coins to Place in Tree Nodes
Coding
- Maximum Coins From K Consecutive Bags
Coding · Array · Binary Search · Greedy
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 441. Arranging Coins
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source