leetcode rust workspace

• https://neetcode.io/roadmap

General

icc_....: interview crash course problems

test command:

cargo nextest run --no-fail-fast -p p125_valid_palindrome --no-capture
clrm; cargo test -p [package] -- --test-threads 1
clrm; cargo clippy --package [package]

p2236_root_equals_sum_of_children

• implemented conversion of vector to treenode¹

p28_find_the_index_of_the_first_occurrence_in_a_string

Knuth-Morris-Pratt (KMP) algorithm | String Matching Algorithm | Substring Search Knuth–Morris–Pratt KMP - Find the Index of the First Occurrence in a String - Leetcode 28 - Python

p909_snakes_and_ladders

optimization Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory

p997_find_the_town_judge

graph

References:

Footnotes

1. Construct a complete binary tree from given array in level order fashion ↩