Skip to content
    SeaCode
    Learning tracksCode ArenaWorkshops & EventsInstructors
    Log inSign up
    Practice problems / Pascal's triangle

    Pascal's triangle

    Easydynamic programmingarraymath

    Return the first n rows of Pascal's triangle: each row starts and ends with 1, and every inner number is the sum of the two above it.

    Example 1

    Input:  n = 5
    Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]

    Example 2

    Input:  n = 1
    Output: [[1]]

    Constraints

    • 1 ≤ n ≤ 30

    Submit checks your solution against 7 tests, including hidden ones.

    /**
     * @param {int} n
     * @return {int[][]}
     */
    function generate(n) {
      
    }
    
    Sign in to run
    SeaCode

    Learn to code for real, online or at our branch in front of Cairo University, Giza.

    Learn

    • All courses
    • Interactive tutorials
    • Interview practice problems
    • Mock interview
    • Learning tracks
    • Code Arena
    • Workshops & Events
    • Knowledge library
    • Team projects

    Your account

    • Log in
    • Sign up
    • Learning plan
    • Certificates
    • Site map

    Contact us

    • WhatsApp
    • 010 9094 1104
    • In front of Cairo University, Giza

    © 2026 SeaCode. All rights reserved.