technojam/Ultimate_Algorithms_Repository

XOR Linked List; traversal

Open

#314 opened on Oct 16, 2020

View on GitHub
 (1 comment) (0 reactions) (0 assignees)C++ (165 forks)auto 404
hacktoberfest

Repository metrics

Stars
 (87 stars)
PR merge metrics
 (PR metrics pending)

Description

XOR Linked List

  • In a doubly linked list, you store two pointers per node: prev and next. In an XOR linked list, you store one pointer per node, which is the XOR of prev and next, or if one of them is absent, just the other, which is the same as XORing with 0.
  • The reason why you can still traverse an XOR linked list in both directions relies on the properties of XOR and the redundancy of information inherent in a double linked list.

Contributor guide

Research direction
Study XOR linked list concept and implement traversal in C++.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
3
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Mostly clear
Prerequisites
Linked ListsXOR
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
50