Akshat S. Madhavan

B.Tech CSE (Applied AI) student · Competitive Programming & Problem Solving

Bengaluru, Karnataka, India

@gokuu007

0 followers

🎓 B.Tech in CS (Applied AI) at Polaris School of Technology · Graduating 2030

About

B.Tech student in Computer Science (Applied AI) with experience in competitive programming problem setting and student engagement. Strong background in algorithms, data structures, and building test cases for robustness and correctness.

Experience

Problem Setter Intern

CodeHurdle

Designed and reviewed competitive programming problems covering algorithms, data structures, and problem-solving. Created comprehensive test cases and edge cases to validate correctness, efficiency, and robustness. Contributed to competitive programming contests and ICPC-style problem sets.
Student Ambassador

ThinkingofThinking

Represented ThinkingofThinking and promoted its initiatives within the student community. Engaged with students to increase awareness and participation in learning and community activities.
Student Ambassador

ThinkingofThinking

Represented ThinkingofThinking and promoted its initiatives within the student community. Engaged with students to increase awareness and participation in learning and community activities.

Education

B.Tech

Polaris School of Technology

Computer Science (Applied AI)

Computer Science (Applied AI)
Higher Secondary Education

Mother Teresa Senior Secondary School

Skills

<3 months

C Algorithms Data Structures Competitive Programming

Projects

C++ Stress Tester and Test Case Generator Tool

C++

Built a C++ stress testing tool to generate random test cases and detect discrepancies between competing solutions. Automated program execution and output comparison to identify incorrect solutions and edge-case failures.
C++ Stress Tester and Test Case Generator Tool

C++

Built a C++ stress testing tool to generate random test cases and detect discrepancies between competing solutions. Automated program execution and output comparison to identify incorrect solutions and edge-case failures.
Campus Navigation Using Dijkstra’s Algorithm

Dijkstra’s Algorithm

Developed a campus navigation system to find shortest routes between locations using Dijkstra’s algorithm. Modeled campus landmarks as graph nodes with weighted edges representing distances and generated optimal routes dynamically.
Campus Navigation Using Dijkstra’s Algorithm

Dijkstra’s Algorithm

Developed a campus navigation system to find shortest routes between locations using Dijkstra’s algorithm. Modeled campus landmarks as graph nodes with weighted edges representing distances and generated optimal routes dynamically.

🏆 Achievements & awards

LeetCode Contest Ranking

2402 max rating on LeetCode; global rank 99, India rank 25 in a contest with 30,000 participants.
CodeChef 5 Star Coder

5 Star Coder on CodeChef; highest global rank 42 out of 16,000 participants.
Codeforces Rating

1895 max rating on Codeforces; achieved India rank 266 in a contest.

⚽ Extracurricular activities

Coding Wiz

Led a Discord-based competitive programming club, mentoring 70+ students through structured sessions and doubt-solving support.
C++ and DSA Curriculum Delivery

Designed and delivered a C++ and DSA curriculum, successfully instructing 50+ students across 7 sessions.

Explore the Broxer community

💬 Q&A Ask about roles, salaries and interviews — and help others. 👥 Circles Join discussions on skills, companies and industries. 📰 Feed Follow updates and insights from the community.