vmthanh-bi
Unafraid of failure, eager to learn and innovate out-the-box solutions, I am looking forward to joining a team and sponging up knowledge!
Warsaw, Poland
Pinned Repositories
100-Days-of-SwiftUI
Project Repository for the course 100 Days of SwiftUI by Hacking With Swift
100DaysOfSwiftUI
This repository is dedicated to documenting my progress of the Hacking With Swift's course "100 Days of SwiftUI" by Paul Hudson.
Closest-pair-of-points
Implementing an O(n lg n) algorithm to determine the closest pair of points in a provided set of points P in the two-dimensional plane.
Fibonacci-heap
Implementing a Fibonacci heap to find the shortest path for a provided set of a graph's edges and vertices.
HackingWithSwift
The project source code for hackingwithswift.com
Laying-out-text
Program that reads all of the text from a provided file, prompts the user for a maximum line length, and prints the text out optimally broken into lines of length less than or equal to the given maximum.
My100DaysOfSwiftUI
My daily practices for the HackingWithSwift 100DayOfSwiftUI Challenge (iOS 13)
Prim-s-Algorithm
Writing Prim's algorithm to find the shortest path for a given set of a graph's edges and vertices.
Single-Linked-List
Creating a singly-linked list without a dummy head node.
Union-by-rank-Path-compression
Given a disjoint set data structure, I use two strategies - union by rank and path compression - to find the connected components of the structure's graph.
vmthanh-bi's Repositories
vmthanh-bi/100-Days-of-SwiftUI
Project Repository for the course 100 Days of SwiftUI by Hacking With Swift
vmthanh-bi/100DaysOfSwiftUI
This repository is dedicated to documenting my progress of the Hacking With Swift's course "100 Days of SwiftUI" by Paul Hudson.
vmthanh-bi/Closest-pair-of-points
Implementing an O(n lg n) algorithm to determine the closest pair of points in a provided set of points P in the two-dimensional plane.
vmthanh-bi/Fibonacci-heap
Implementing a Fibonacci heap to find the shortest path for a provided set of a graph's edges and vertices.
vmthanh-bi/HackingWithSwift
The project source code for hackingwithswift.com
vmthanh-bi/Laying-out-text
Program that reads all of the text from a provided file, prompts the user for a maximum line length, and prints the text out optimally broken into lines of length less than or equal to the given maximum.
vmthanh-bi/My100DaysOfSwiftUI
My daily practices for the HackingWithSwift 100DayOfSwiftUI Challenge (iOS 13)
vmthanh-bi/Prim-s-Algorithm
Writing Prim's algorithm to find the shortest path for a given set of a graph's edges and vertices.
vmthanh-bi/Single-Linked-List
Creating a singly-linked list without a dummy head node.
vmthanh-bi/tomatocan
Frontend code of thinQ.tv website.
vmthanh-bi/Union-by-rank-Path-compression
Given a disjoint set data structure, I use two strategies - union by rank and path compression - to find the connected components of the structure's graph.
vmthanh-bi/vmthanh-bi
Config files for my GitHub profile.
vmthanh-bi/WasteWatchers
Lawrence University Capstone project: iOS app to help monitor food items inside your fridge.