search

Mozilla-Campus-Club-Cummins / HacktoberFest23_MozillaCCEW

0 stars 0 forks source link

Insert Greatest Common divisors in Linked List #101

Open Chaitralikore opened 1 year ago

Chaitralikore commented 1 year ago

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.

chaitrali29 commented 1 year ago

Will you please assign this issue to me Name : Chaitrali Bhosale C no.:UCE2022435 Batch: Sy Comp A

Chaitralikore commented 1 year ago

@chaitrali29 yes you can work on this issue Deadline: 18th oct'23 11:59pm

Chaitralikore commented 1 year ago

@chaitrali29 the deadline is over and you haven't sent the PR.