Completed Competitive_Coding-3

[sreevardhan1099]

Completed Competitive_Coding-3

https://leetcode.com/problems/pascals-triangle/
https://leetcode.com/problems/k-diff-pairs-in-an-array/description/

[super30admin]

• Strengths:
  • The solution correctly implements the logic for generating Pascal's triangle.
  • The comments are clear and helpful in understanding the approach.
  • The edge cases are handled properly.
• Areas for Improvement:
  • Consider using for loops instead of while loops for better readability and simplicity.
  • The logic for handling the edges of each row can be simplified by initializing the row with 1s and then filling the middle elements, which would make the code cleaner.
  • The variable names could be more descriptive (e.g., prev_row instead of result[i-2]).