[FE] Coding Challenge - Binh Nguyen Thanh #192
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Overview
Problem 1: Three Ways to Sum to N
Challenge: Implement 3 unique approaches to calculate the sum of all integers from 1 to n.
Solutions Implemented:
n * (n + 1) / 2Each solution includes:
Problem 2: Currency Swap Application
Challenge: Build a fancy, intuitive cryptocurrency swap form with real-time exchange rates and modern UI/UX.
Key Features:
View Live Demo
Tech Stack:
Problem 3: Messy React Code Analysis
Challenge: Identify computational inefficiencies and anti-patterns in a React component, then provide a refactored version.
Analysis Results: 17 issues identified across 5 categories:
anytype, empty interfaces, redundant annotations, property duplication, missing exportsEach issue includes: