[Feature Request]: Add Leetcode Problem 2807:

[Anshika14528]

Is there an existing issue for this?

• I have searched the existing issues

Feature Description

[Insert Greatest Common Divisors in Linked List]
Given the head of a linked list head, in which each node contains an integer value.

Between every pair of adjacent nodes, insert a new node with a value equal to the greatest common divisor of them.

Return the linked list after insertion.

The greatest common divisor of two numbers is the largest positive integer that evenly divides both numbers.

Use Case

For users to be able to see the solutions and understand it.

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

• I have read the Contributing Guidelines
• I'm a GSSOC'24 contributor
• I have starred the repository

[github-actions]

Hi @Anshika14528! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!