Definition for binary tree public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } }

Breadth first search implementation.

271. Encode and Decode Strings https://leetcode.com/problems/encode-and-decode-strings/#/description Design an algorithm to encode a list of strings

Connected components implementation

Topological sort implementation

DFS implementation

Graph implementation

Graph implementation

Directed edge implementation

Edge Weighted Digraph implementation

Graph implementation

Graph implementation

Graph implementation

Heap sort implementation. Has some bugs.

The {@code IndexMinPQ} class represents an indexed priority queue of generic keys. It supports the usual <em>insert</em> and <em>delete-the-minimum</e

https://leetcode.com/problems/lru-cache/#/description 146. LRU Cache Design and implement a data structure for Least Recently Used (LRU) cache. It

Symbol Table class implemented via Binary Search Tree (BST)