b

hello@hong-yi.me

Singapore Joined on May 24, 2022 https://www.hong-yi.me/theprawncollective/bryanseah234

Education

Singapore

Work

Student

Mar 28

Finds the shortest path on a 2D grid (with obstacles) using the A* search algorithm.

2 min read

Mar 28

Determines the fewest coins needed to make up a given amount using a greedy algorithm.

2 min read

Mar 28

Colors a graph so that no two adjacent vertices share the same color using a backtracking approach.

2 min read

Mar 28

Finds the contiguous subarray within a one-dimensional array of numbers that has the largest sum.

2 min read

Mar 28

Applies the simulated annealing algorithm to search for an optimal solution in a large search space.

2 min read

Mar 28

Approximates a minimum Steiner tree by greedily connecting terminals with the shortest edges.

1 min read

Mar 28

Attempts to find a subset of numbers that sums exactly to a target value using a greedy strategy.

2 min read

Mar 28

Recursively finds a TSP path by always visiting the nearest unvisited city, and finally returning to the start.

2 min read

Mar 28

Schedule jobs on a fixed number of machines to minimize total completion time.

2 min read

Mar 28

Given a matrix and route, function improves route using 2-opt heuristic: reverses segments, reduce total travel distance.

2 min read

Mar 28

Places N queens on an NxN chessboard so that no two queens threaten each other.

2 min read

Mar 28

Solves a standard 9x9 Sudoku puzzle ensuring that each row, column, and 3x3 subgrid contains numbers 1-9.

2 min read

DEV Community

b

Badges

Three Year Club

Writing Debut

Two Year Club

One Year Club

GitHub Repositories

Finds the shortest path on a 2D grid (with obstacles) using the A* search algorithm.

Determines the fewest coins needed to make up a given amount using a greedy algorithm.

Colors a graph so that no two adjacent vertices share the same color using a backtracking approach.

Finds the contiguous subarray within a one-dimensional array of numbers that has the largest sum.

Applies the simulated annealing algorithm to search for an optimal solution in a large search space.

Approximates a minimum Steiner tree by greedily connecting terminals with the shortest edges.

Attempts to find a subset of numbers that sums exactly to a target value using a greedy strategy.

Recursively finds a TSP path by always visiting the nearest unvisited city, and finally returning to the start.

Schedule jobs on a fixed number of machines to minimize total completion time.

Given a matrix and route, function improves route using 2-opt heuristic: reverses segments, reduce total travel distance.

Places N queens on an NxN chessboard so that no two queens threaten each other.

Solves a standard 9x9 Sudoku puzzle ensuring that each row, column, and 3x3 subgrid contains numbers 1-9.