Skip to content
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 our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[NEW ALGORITHM] Rotated Lists #1863

Closed
Dipanita45 opened this issue Nov 10, 2024 · 1 comment
Closed

[NEW ALGORITHM] Rotated Lists #1863

Dipanita45 opened this issue Nov 10, 2024 · 1 comment

Comments

@Dipanita45
Copy link
Contributor

Issue will be closed if:

  1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
  2. You propose an algorithm that is already present or has been mentioned in a previous issue.
  3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.


Name:

[NEW ALGORITHM] Rotated Lists

About:

Given the head of a linked list, rotate the list to the right by k places.


Labels:

new algorithm, gssoc-ext, hacktoberfest, level1


Assignees:

  • [yes] Contributor in GSSoC-ext
  • [yes] Want to work on it

Please assign me the issue
@pankaj-bind

@gurramtejaswini
Copy link

gurramtejaswini commented Nov 16, 2024

Hello @pankaj-bind @Dipanita45,
I would like to work on this issue, could you please assign this to me. It will be very helpful for my academics.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

3 participants