CTStudyGroup/BOJ
Nov 2024 – Jan 2025
3 Months active
Languages Used
Python
Technical Skills
AlgorithmAlgorithm DesignAlgorithm ImplementationBFSBacktrackingBasic Input/Output Handling
hzee97
PROFILE
Hzee97
Jang Hyeonji developed a robust suite of algorithmic problem solvers and utilities for the CTStudyGroup/BOJ repository over three months, focusing on Python-based solutions for competitive programming challenges. She engineered BFS-driven modules for grid and graph traversal, dynamic programming scripts for optimization problems, and standalone utilities for tasks like prime range calculation and password lookup. Her approach emphasized modular, testable code with reusable components, leveraging skills in data structures, algorithm design, and input/output handling. The work demonstrated depth through domain-specific implementations, such as depth-limited BFS for friendship networks and analytics tools for DNA consensus and water trapping calculations.
Overall Statistics
Feature vs Bugs
93%Features
Repository Contributions
27Total
Bugs
1
Commits
27
Features
13
Lines of code
718
Activity Months3
Your Network
1010 people
Work History
January 2025
1 Commits • 1 Features
Jan 1, 2025January 2025 (Month: 2025-01) - CTStudyGroup/BOJ: Key feature delivered a BFS-based two-level friendship counter for Baekjoon 5567 "Wedding". Implemented as hyeonji_5567.py using a graph representation and BFS traversal up to depth two to determine connected individuals. Commit e2b50f1fae1f3565d366a9b10925ae0a5ffd4bc4 ([Add] : hyeonji_5567.py). Major bugs fixed: none reported this month. Overall impact: provides an efficient, reusable approach for two-level connectivity problems, enabling faster problem solving and easy reuse for similar graph tasks; strengthens repo capabilities for competitive programming challenges. Technologies/skills: Python, BFS, graph data structures, depth-limited search, clean code organization, version control traceability.
1 Commits • 1 Features
Jan 1, 2025January 2025 (Month: 2025-01) - CTStudyGroup/BOJ: Key feature delivered a BFS-based two-level friendship counter for Baekjoon 5567 "Wedding". Implemented as hyeonji_5567.py using a graph representation and BFS traversal up to depth two to determine connected individuals. Commit e2b50f1fae1f3565d366a9b10925ae0a5ffd4bc4 ([Add] : hyeonji_5567.py). Major bugs fixed: none reported this month. Overall impact: provides an efficient, reusable approach for two-level connectivity problems, enabling faster problem solving and easy reuse for similar graph tasks; strengthens repo capabilities for competitive programming challenges. Technologies/skills: Python, BFS, graph data structures, depth-limited search, clean code organization, version control traceability.
January 2025
December 2024
11 Commits • 4 Features
Dec 1, 2024December 2024 monthly summary for CTStudyGroup/BOJ: Delivered a cohesive set of standalone Python utilities for algorithmic problem solving, analytics tasks, and domain-specific calculations; established a reusable codebase and user-facing tooling to accelerate solution delivery and learning.
December 2024
11 Commits • 4 Features
Dec 1, 2024December 2024 monthly summary for CTStudyGroup/BOJ: Delivered a cohesive set of standalone Python utilities for algorithmic problem solving, analytics tasks, and domain-specific calculations; established a reusable codebase and user-facing tooling to accelerate solution delivery and learning.
November 2024
15 Commits • 8 Features
Nov 1, 2024Month 2024-11 — CTStudyGroup/BOJ: Delivered a focused set of algorithmic solutions and utilities, emphasizing reliability, performance, and maintainability across core problem domains. Key features include BFS-based problem solvers for 3D grid challenges (3D tomato ripening and color-vision variants), trailing-zero computation for large factorials, a Sieve of Eratosthenes-based prime-range utility, a standalone Nth-number-with-'666' generator, and DP-based optimizations for constrained-time profit and long bitonic subsequences. Additional work encompassed sorting/data-processing utilities and DFS-based combinations, complemented by practical data-structure practice (stack/queue).
15 Commits • 8 Features
Nov 1, 2024Month 2024-11 — CTStudyGroup/BOJ: Delivered a focused set of algorithmic solutions and utilities, emphasizing reliability, performance, and maintainability across core problem domains. Key features include BFS-based problem solvers for 3D grid challenges (3D tomato ripening and color-vision variants), trailing-zero computation for large factorials, a Sieve of Eratosthenes-based prime-range utility, a standalone Nth-number-with-'666' generator, and DP-based optimizations for constrained-time profit and long bitonic subsequences. Additional work encompassed sorting/data-processing utilities and DFS-based combinations, complemented by practical data-structure practice (stack/queue).
November 2024
Activity
Loading activity data...
Quality Metrics
Correctness86.6%
Maintainability83.8%
Architecture71.8%
Performance80.0%
AI Usage20.0%
Skills & Technologies
Programming Languages
Python
Technical Skills
AlgorithmAlgorithm DesignAlgorithm ImplementationAlgorithmsBFSBacktrackingBasic Input/Output HandlingBasic StatisticsBreadth-First Search (BFS)Competitive ProgrammingData StructuresDynamic ProgrammingGame LogicGraph TheoryGraph Traversal
Repositories Contributed To
Overview of all repositories you've contributed to across your timeline