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

added intersection of two linked list #1581 #1651

Merged
merged 1 commit into from
Nov 4, 2024

Conversation

SKG24
Copy link
Contributor

@SKG24 SKG24 commented Nov 4, 2024

Given the heads of two singly linked-lists, headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return NULL.

Screen.Recording.2024-11-05.at.12.08.09.AM.mov

Screenshot 2024-11-05 at 12 08 47 AM

Given the heads of two singly linked-lists, `headA` and `headB`, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return `NULL`.
@pankaj-bind pankaj-bind merged commit 684c4d5 into AlgoGenesis:main Nov 4, 2024
1 of 2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants