Sanjaykumar-IT/dsa-problems

Find the union of arrays in sorted order

Open

#21 opened on Oct 29, 2024

View on GitHub
 (0 comments) (0 reactions) (0 assignees)Java (4 forks)auto 404
hacktoberfesthacktoberfest-acceptedhactoberfest2024

Repository metrics

Stars
 (1 star)
PR merge metrics
 (PR metrics pending)

Description

Input: a = [1, 1, 2, 2, 2, 4], b = [2, 2, 4, 4] ( Both a and b are sorted arrays)

Output: [1,2,4]

Contributor guide

Research direction
Implement a function that takes two sorted arrays and returns a new sorted array containing the union (distinct elements from both) using two pointer technique.
Tech stack
java
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
1
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Under 1 hour
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Fresh
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
basic programming
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
90