- Notifications
You must be signed in to change notification settings - Fork2.4k
Creating a JS file for solving-pascals tringle.#1312
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.
Already on GitHub?Sign in to your account
Uh oh!
There was an error while loading.Please reload this page.
Conversation
Solved pascals-triangle in JS.
Hey,@voski Please tell me if I did it right this time. |
voski commentedOct 23, 2022 • edited
Loading Uh oh!
There was an error while loading.Please reload this page.
edited
Uh oh!
There was an error while loading.Please reload this page.
@aadil42 This pull request is#1312 The very first comment is the description of a pull request. In this case, it is#1312 (comment) I am quoting the description below. Does it look right to you? The files modified section is wrong, the language section is wrong, and the submission URL is not filled in again.
Take a look at this other pull request#1309 The description is updated to reflect the actual changes. Here is the description from#1309
You can see that the files modified section is updated to reflect the file in the pull request |
@voski I'm so sorry. I am new to contributing to repos. I really apologize for the confusion. I updated the description of a PR. Please check and let me know if it's right this time. I am so sorry and Thank you for explaining. |
Hey@voski, Did I do it wrong again? please let me know. Thank you |
Hey@voski, my PR hasn't been merged yet so this is just a kind reminder. Let me know if I need to do anything. |
Solving subarray-sum-equals-k in JS in O(n).
Hello there. I actually don’t have merge permissions on this repo. I’m just another contributor like you. |
dissesmac commentedOct 27, 2022 • edited by Ahmad-A0
Loading Uh oh!
There was an error while loading.Please reload this page.
edited by Ahmad-A0
Uh oh!
There was an error while loading.Please reload this page.
I think you can do it without checking if size > 2 Just I don't write on JS. I can share my solution on Swift. classSolution{func generate(_ numRows:Int)->[[Int]]{varresult=[[Int]](repeating:[1], count: numRows)foriin1..<numRows{result[i]=[Int](repeating:1, count: i+1)forjin1..< i{result[i][j]=result[i-1][j-1]+ result[i-1][j]}}return result}} I don't know why GitHub formats my code in this view. https://leetcode.com/problems/pascals-triangle/submissions/831121961/ |
@diss1993 I'll look into your solution soon. Thanks for sharing. |
@voski I thought you had merge permission. Anyway, thank you for your support and advice on how to make a proper PR. Thanks, huge thank you! |
@voski btw, I know you don't have merge permission. But is my PR ok? I just wanted to ask to make sure. Thank you again! |
I can't speak to your solution code. I haven't been working with JS much lately and I just don't have the time to get into it. As far as your PR description it is a lot better. However, the PR template has a bullet list, with bold text, and some italic text. In this submission, you have removed all the formatting. The content is good but the styling is lost! |
@voski Thank you, brother! I fixed the formatting. I didn't what text to make italics so left it. but I did the bullet points. |
Thanks for contributing (and collaborating)! |
Uh oh!
There was an error while loading.Please reload this page.