Time is Money, Efficiency is Life
active 2023-12-25 → 2025-03-07 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 439 days from 2023-12-25 to 2025-03-07. Pushes: 119 total, peak 8 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 21 total, peak 8 in a day. Comments: 10 total, peak 5 in a day. Stars: 3 total, peak 1 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
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| OccupyMars2025 | 150 | 119 | 0 | 10 |
Recent activity
Latest issues, pull requests and releases
- Issue comment#17OccupyMars20252024-10-24 12:57[solved] page 392, Exercise 14.3-1
- Issue comment#16OccupyMars20252024-10-24 11:10[TODO] study Catalan numbers, its relationship with "number of ways of fully parenthesizing the matrix chain multiplication", "number of full binary trees with n leaves"
- Issue comment#16OccupyMars20252024-10-24 11:10[TODO] study Catalan numbers, its relationship with "number of ways of fully parenthesizing the matrix chain multiplication", "number of full binary trees with n leaves"
- Issue#16OccupyMars20252024-10-24 03:31[TODO] study Catalan numbers
- Issue#15OccupyMars20252024-10-20 11:24[TODO] How to generate a random integer number from within a range
- Issue comment#14OccupyMars20252024-09-27 08:12[solved] my solution to the Exercise 14.2-5 is different from the authors' answer
- Issue#14OccupyMars20252024-09-27 07:06[not solved]
- Issue#13OccupyMars20252024-09-07 12:34[TODO] pieces are cut in order of monotonically increasing size
- Issue#12OccupyMars20252024-06-11 06:05[solved][bug][ch13, red-black tree] After inserting 10 nodes, I get only 4 nodes
- Issue comment#12OccupyMars20252024-06-11 06:00[solved][bug][ch13, red-black tree] After inserting 10 nodes, I get only 4 nodes
- Issue#12OccupyMars20252024-06-11 03:11[bug][ch13, red-black tree] After inserting 10 nodes, I get only 4 nodes
- Issue#11OccupyMars20252024-06-05 09:14[solved][debug][ Exercise 12.3-6] in C++, tree_delete method have bugs
- Issue comment#11OccupyMars20252024-06-05 09:12[debug][ Exercise 12.3-6] in C++, tree_delete method have bugs
- Issue comment#11OccupyMars20252024-06-05 09:08[debug][ Exercise 12.3-6] in C++, tree_delete method have bugs
- Issue#11OccupyMars20252024-06-05 08:58[debug][ Exercise 12.3-6] in C++, tree_delete method have bugs
- Issue#10OccupyMars20252024-06-05 08:55[solved][debug][ Exercise 12.3-6] in python, tree_delete method have bugs
- Issue#3OccupyMars20252024-06-05 08:54[solved] amazingly conter-intuitive: Suppose that instead of swapping element A[i] with a random element from the subarray A[i:n], we swapped it with a random element from anywhere in the array
- Issue#6OccupyMars20252024-06-05 08:54[solved][amazing solution][ch12, binary search trees] k successive calls to TREE-SUCCESSOR take O(k+h) time
- Issue#7OccupyMars20252024-06-05 08:54[solved] difference between `path splitting` and `path halving` on https://en.wikipedia.org/wiki/Disjoint-set_data_structure
- Issue#8OccupyMars20252024-06-05 08:53[solved][bug] when I change `vector<tuple<int, int, int>> repair_edges;` to `priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, CompareCost> repair_edges;`, there occurs an error for some unknown test case
- Issue comment#10OccupyMars20252024-06-05 02:30[debug][ Exercise 12.3-6] in python, tree_delete method have bugs
- Issue comment#10OccupyMars20252024-06-05 02:27[debug][ Exercise 12.3-6] in python, tree_delete method have bugs
- Issue#10OccupyMars20252024-06-05 01:33[debug][ Exercise 12.3-6] in python, tree_delete method have bugs
- Issue#9OccupyMars20252024-06-01 05:32[TODO][improve] practice_programming/0001. Battle Over Cities: both c++ and python implementation "Time Limit Exceeded"
- Issue#8OccupyMars20252024-05-31 17:02[not solved][bug] when I change `vector<tuple<int, int, int>> repair_edges;` to `priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, CompareCost> repair_edges;`, there occurs an error for some unknown test case
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 3 stars here means stars gained during the window, not the repo's star count.