Skip to content

reachanihere/Data-Structures-and-Algorithms

View on GitHub ↗Related repositories →

Welcome to the Efficient Data Structures and Algorithms repository! This repository is a comprehensive collection of well-implemented data structures and algorithms in various programming languages, designed to help you understand and implement efficient solutions to common problems.

active 2023-08-202025-08-05 (UTC)

Complete coverage26,531 / 26,531 hourly files (100%) · 2 absent upstream2023-08-152026-08-24 (UTC)
Events
23
Pushes
0
Pull requests
2
Issues
1
Stars
17
Forks
3

Activity over time

Daily event counts in the loaded window

Line chart, 717 days from 2023-08-20 to 2025-08-05. Pushes: 0 total, peak 0 in a day. Pull requests: 2 total, peak 1 in a day. Issues: 1 total, peak 1 in a day. Comments: 0 total, peak 0 in a day. Stars: 17 total, peak 2 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Stars, PRs, issues and forks are under-captured in the later part of this window. GH Archive progressively stopped capturing non-push events during 2026 — −95% or worse by the end of the window. Every series here except Pushes fades for that reason, so a decline above reflects the archive, not this repository. Pushes stay reliable throughout, so read them, and the contributor counts derived from them, as the real signal. Data health has the measurements.

Top contributors

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

ContributorContributionsPushesPRsComments
DineshDeshal2020
nandwani-rohit1000

Recent activity

Latest issues, pull requests and releases

  • Pull request#39DineshDeshal2024-04-23 04:55
  • Pull request#39DineshDeshal2024-04-09 08:53
  • Issue#38nandwani-rohit2023-10-05 19:16
    Error in code implementation of a binary tree problem

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