Developed a high-performance solution for the Efficient Maximum Alternating Subsequence with Distance Constraint problem in the doocs/leetcode repository, focusing on scalable and maintainable algorithm design. Leveraging dynamic programming techniques alongside advanced data structures such as Fenwick Trees and Segment Trees, the implementation achieved fast maximum queries and optimized the computation to O(n log M) time complexity. The work was delivered in C++ and Python, emphasizing clear code structure and measurable performance improvements for large-scale input scenarios. This contribution addressed a core computational challenge, demonstrating strong problem-solving skills and a deep understanding of dynamic programming and data structure optimization.