Skip to content

This code defines a method that takes an array of integers and a target integer. It uses a hash map to store the indices of the elements. For each element, it checks if the complement (target - current number) exists in the map. If found, it returns the indices of the two numbers that add up to the target.

active 2024-10-072024-10-07 (UTC)

Complete coverage27,243 / 27,245 hourly files (100%) · 2 absent upstream2023-08-152026-09-23 (UTC)
Events
3
Pushes
1
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 1 days from 2024-10-07 to 2024-10-07. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
Polynelokuru721100

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.