GDG-IGDTUW/DSA-1
Jan 2026 – Feb 2026
2 Months active
Languages Used
C++
Technical Skills
BFS traversalC++C++ programmingalgorithm designalgorithm developmentalgorithms
Anoushka Gupta
PROFILE
Anoushka Gupta
Anoushka contributed four core data structure and algorithm features to the GDG-IGDTUW/DSA-1 repository over two months, focusing on C++ and algorithm design. She implemented binary tree level order traversal with both standard BFS and zigzag variants, and developed linked list cycle detection using hash-set and Floyd’s Tortoise and Hare approaches. Anoushka also delivered a next greater element solution for circular arrays, providing both brute-force and optimized methods. In February, she added a linked list palindrome checker using in-place reversal and two-pointer techniques. Her work emphasized code hygiene, maintainability, and reusable utilities, demonstrating depth in data structures and algorithms.
Overall Statistics
Feature vs Bugs
100%Features
Repository Contributions
6Total
Bugs
0
Commits
6
Features
4
Lines of code
366
Activity Months2
Your Network
53 people
Work History
February 2026
1 Commits • 1 Features
Feb 1, 2026February 2026: Implemented a Linked List Palindrome Check utility for the DSA-1 repo, introducing solution.cpp as the entry point. The feature verifies whether a singly linked list is a palindrome by locating the middle, reversing the second half in place, and comparing both halves. This delivers a reusable, efficient data-structure utility with linear-time performance and constant extra space, enhancing the repository's capability for algorithm validation and interview prep.
1 Commits • 1 Features
Feb 1, 2026February 2026: Implemented a Linked List Palindrome Check utility for the DSA-1 repo, introducing solution.cpp as the entry point. The feature verifies whether a singly linked list is a palindrome by locating the middle, reversing the second half in place, and comparing both halves. This delivers a reusable, efficient data-structure utility with linear-time performance and constant extra space, enhancing the repository's capability for algorithm validation and interview prep.
February 2026
January 2026
5 Commits • 3 Features
Jan 1, 2026January 2026: Delivered three core DS&A features in GDG-IGDTUW/DSA-1 with robust, multi-approach solutions and improved code hygiene. Features delivered: Binary Tree Level Order Traversal (standard BFS and zigzag variants), Linked List Cycle Detection (hash-set brute force and Floyd’s Tortoise and Hare), and Next Greater Element in Circular Array (brute-force and optimized). Notable commits include c2f041e2ecba4620f7725fdda19b523f23aabdbf; 50c979e5b35b19bbd9a148e6fccd7173b17c04e7; 1efa739f976c0d1aa37c4d14ff7591165d021b06; 04d1cfa9353e422645fc7c1f857fc36b055b1c5c; a43544d079a73169da0ff32aa464287a6d651244. The file rename to anoushka1405--Binary Trees - Q1 -level Order Traversal.cpp improves clarity and maintainability. Impact: strengthens the DS&A reference library, accelerates solution delivery for related problems, and demonstrates proficiency in BFS, cycle detection, and optimization techniques. Technologies/skills: C++, BFS, hash-based lookups, Floyd’s Tortoise and Hare algorithm, problem decomposition, and code hygiene.
January 2026
5 Commits • 3 Features
Jan 1, 2026January 2026: Delivered three core DS&A features in GDG-IGDTUW/DSA-1 with robust, multi-approach solutions and improved code hygiene. Features delivered: Binary Tree Level Order Traversal (standard BFS and zigzag variants), Linked List Cycle Detection (hash-set brute force and Floyd’s Tortoise and Hare), and Next Greater Element in Circular Array (brute-force and optimized). Notable commits include c2f041e2ecba4620f7725fdda19b523f23aabdbf; 50c979e5b35b19bbd9a148e6fccd7173b17c04e7; 1efa739f976c0d1aa37c4d14ff7591165d021b06; 04d1cfa9353e422645fc7c1f857fc36b055b1c5c; a43544d079a73169da0ff32aa464287a6d651244. The file rename to anoushka1405--Binary Trees - Q1 -level Order Traversal.cpp improves clarity and maintainability. Impact: strengthens the DS&A reference library, accelerates solution delivery for related problems, and demonstrates proficiency in BFS, cycle detection, and optimization techniques. Technologies/skills: C++, BFS, hash-based lookups, Floyd’s Tortoise and Hare algorithm, problem decomposition, and code hygiene.
Activity
Loading activity data...
Quality Metrics
Correctness100.0%
Maintainability96.6%
Architecture96.6%
Performance100.0%
AI Usage20.0%
Skills & Technologies
Programming Languages
C++
Technical Skills
BFS traversalC++C++ programmingalgorithm designalgorithm developmentalgorithmsbinary treesdata structureslinked lists
Repositories Contributed To
Overview of all repositories you've contributed to across your timeline