{"id":23684083,"url":"https://github.com/lepharamramchiary/pascals-triangle-leetcode","last_synced_at":"2025-10-06T15:01:55.952Z","repository":{"id":156031566,"uuid":"602467526","full_name":"LepharamRamchiary/Pascals-Triangle-Leetcode","owner":"LepharamRamchiary","description":null,"archived":false,"fork":false,"pushed_at":"2023-02-16T09:28:02.000Z","size":1,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-29T20:33:26.700Z","etag":null,"topics":["cpp"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/LepharamRamchiary.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-02-16T09:19:21.000Z","updated_at":"2023-05-03T07:36:11.000Z","dependencies_parsed_at":null,"dependency_job_id":"7d2e7ad6-c247-4fea-b197-7f2dca7f90cd","html_url":"https://github.com/LepharamRamchiary/Pascals-Triangle-Leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LepharamRamchiary%2FPascals-Triangle-Leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LepharamRamchiary%2FPascals-Triangle-Leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LepharamRamchiary%2FPascals-Triangle-Leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LepharamRamchiary%2FPascals-Triangle-Leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LepharamRamchiary","download_url":"https://codeload.github.com/LepharamRamchiary/Pascals-Triangle-Leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239735874,"owners_count":19688355,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp"],"created_at":"2024-12-29T20:33:06.404Z","updated_at":"2025-10-06T15:01:55.875Z","avatar_url":"https://github.com/LepharamRamchiary.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"**# Pascal's Triangle**\n\n**Question**:-\n\nGiven an integer numRows, return the first numRows of Pascal's triangle.\n```\n      1\n    1   1\n  1   2   1\n 1   3   3  1\n1   4  6  4   1\n```\n\n\nExample 1:\n```\nInput: numRows = 5\nOutput: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]]\n```\nExample 2:\n```\nInput: numRows = 1\nOutput: [[1]]\n```\n\n\n**Solution**\n```c++\n#include \u003cbits/stdc++.h\u003e\nusing namespace std;\n\nclass Solution\n{\npublic:\n    vector\u003cvector\u003cint\u003e\u003e generate(int numRows)\n    {\n        vector\u003cvector\u003cint\u003e\u003e ans(numRows);\n        for (int i = 0; i \u003c numRows; i++)\n        {\n            ans[i].resize(i + 1);\n            for (int j = 0; j \u003c= i; j++)\n            {\n                if (j == 0 || j == i)\n                {\n                    ans[i][j] = 1;\n                }\n                else\n                {\n                    ans[i][j] = ans[i - 1][j - 1] + ans[i - 1][j];\n                }\n            }\n        }\n        return ans;\n    }\n};\n\nint main()\n{\n    Solution sb;\n    int n;\n    cout \u003c\u003c \"Enter The number that you need to rows: \";\n    cin \u003e\u003e n;\n    vector\u003cvector\u003cint\u003e\u003e rows = sb.generate(n);\n    for (int i = 0; i \u003c n; i++)\n    {\n        for (int j = 0; j \u003c= i; j++)\n        {\n            cout \u003c\u003c rows[i][j] \u003c\u003c \" \";\n        }\n        cout \u003c\u003c endl;\n    }\n    return 0;\n}\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flepharamramchiary%2Fpascals-triangle-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flepharamramchiary%2Fpascals-triangle-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flepharamramchiary%2Fpascals-triangle-leetcode/lists"}