Tutorial Vietnam Document name URL Note Go Language Advanced Programming https://github.com/zalopay-oss/go-advanced Tutorial English Document name URL
REAL LIFE USAGE FOR DATASTRUCTURE Array: Seat of a Theatre represents an 2D array StacK: The browser history is stored in stack usually so we can go b
Binary Tree Node struct with LeetCode compatible Serialize / Deserialize format
LeetCode 的 Go 解答 进度 统计规则：1.免费题，2.算法题，3.能提交 Go 解答 Easy Medium Hard Total Accepted 265 456 187 908 Total 267 472 197 936 题解 题号 题目 通过率 难度 收藏 1250 * Check
leetcode-medium-0220 Leetcode #0220: Contains duplicate III Intro This repo is a sample solution for below programming problem: https://leetcode.com/p
golang_combination_sum Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candida
golang_kth_largest_in_a_stream Design a class to find the $k^{th} $ largest element in a stream. Note that it is the $ k^{th} $ largest element in the
golang_word_search_data_structure Design a data structure that supports adding new words and finding if a string matches any previously added string.
A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker.
golang_serialize_deserialize_binary_tree Serialization is the process of converting a data structure or object into a sequence of bits so that it can
golang_valid_BST Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left sub
golang_tree_right_side Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see