
LeetCode 3181 – Max Total Reward
Detailed analysis and solution for LeetCode problem 3181: Max Total Reward, using dynamic programming and bitset optimization.
Read note →M.Sc. CS Graduate / Backend Engineer
M.Sc. Computer Science new graduate specializing in backend engineering and cloud-native applications on AWS. Hands-on experience with Java Spring Boot microservices, REST APIs, and production-ready DevOps practices.
Degree
M.Sc. Computer Science
Microservices
10+ services
Focus
Backend & Cloud
Backend engineer for Financial Pulse, a social-style financial tracking platform on AWS.
Microservices-based e-commerce system focused on scalability and fault isolation.
Business delivery first, continuously improving full-stack skills.
Backend
Cloud & DevOps
Data & Search
Top 3 representative Projects
AWS Microservices
Social-style financial tracking platform with Spring Boot microservices and REST APIs.
EC2, RDS, DynamoDB, SQS, Lambda, Spring Boot
High Concurrency
10+ Spring Cloud services with RabbitMQ, Redis, and Elasticsearch for search and flash sales.
RabbitMQ, Redisson, Redis, Elasticsearch, Docker
DevOps
Automated build, test, and deploy pipelines using GitHub Actions and CloudFormation.
GitHub Actions, CloudFormation, AWS

Detailed analysis and solution for LeetCode problem 3181: Max Total Reward, using dynamic programming and bitset optimization.
Read note →Heap Sort is an efficient, in-place sorting algorithm that utilizes the properties of a binary heap data structure to sort elements in O(n log n) time complexity.
Read note →Dynamic programming approach to find the longest palindromic substring in a given string.
Read note →