Skip to content

isidzukuri/algorithms

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

68 Commits
misc
misc
 
 
README.md
README.md
 
 
all-paths-from-source-to-target.rs
all-paths-from-source-to-target.rs
 
 
binary-search.rs
binary-search.rs
 
 
can_sum.rb
can_sum.rb
 
 
cats_and_mouse.rb
cats_and_mouse.rb
 
 
climbing_the_leaderboard.rb
climbing_the_leaderboard.rb
 
 
construct_word_ways.rb
construct_word_ways.rb
 
 
container-with-most-water.rs
container-with-most-water.rs
 
 
counting_valleys.rb
counting_valleys.rb
 
 
course-schedule.rs
course-schedule.rs
 
 
design-graph-with-shortest-path-calculator.rs
design-graph-with-shortest-path-calculator.rs
 
 
diagonal_difference.rb
diagonal_difference.rb
 
 
electronic_shop.rb
electronic_shop.rb
 
 
fibonacci.rb
fibonacci.rb
 
 
fibonacci_tabulation.rb
fibonacci_tabulation.rb
 
 
find-first-and-last-position-of-element-in-sorted-array.rs
find-first-and-last-position-of-element-in-sorted-array.rs
 
 
grid_traveler.rb
grid_traveler.rb
 
 
insert-greatest-common-divisors-in-linked-list.rs
insert-greatest-common-divisors-in-linked-list.rs
 
 
letter-combinations-of-a-phone-number.rs
letter-combinations-of-a-phone-number.rs
 
 
longest_common_prefix.rs
longest_common_prefix.rs
 
 
median-of-two-sorted-arrays.rs
median-of-two-sorted-arrays.rs
 
 
merge-nodes-in-between-zeros.rs
merge-nodes-in-between-zeros.rs
 
 
merge-two-sorted-lists.rs
merge-two-sorted-lists.rs
 
 
minimum-number-of-vertices-to-reach-all-nodes.rs
minimum-number-of-vertices-to-reach-all-nodes.rs
 
 
minimum_distances.rb
minimum_distances.rb
 
 
nested_hash_keys.rb
nested_hash_keys.rb
 
 
number-of-provinces.rs
number-of-provinces.rs
 
 
palindrome_number.rs
palindrome_number.rs
 
 
path-with-minimum-effort.rs
path-with-minimum-effort.rs
 
 
plus-one.rs
plus-one.rs
 
 
remove-duplicates-from-sorted-array.rs
remove-duplicates-from-sorted-array.rs
 
 
repeated_string.rb
repeated_string.rb
 
 
roman_to_integer.rs
roman_to_integer.rs
 
 
schedule_print.rb
schedule_print.rb
 
 
shortest-path-visiting-all-nodes.rs
shortest-path-visiting-all-nodes.rs
 
 
snapshot-array.rs
snapshot-array.rs
 
 
staircase.rb
staircase.rb
 
 
time-based-key-value-store.rs
time-based-key-value-store.rs
 
 
time-based-key-value-store_binary_heap.rs
time-based-key-value-store_binary_heap.rs
 
 
time-based-key-value-store_improved_syntax.rs
time-based-key-value-store_improved_syntax.rs
 
 
unique-paths-iii.rs
unique-paths-iii.rs
 
 
valid_parentheses.rs
valid_parentheses.rs
 
 

Repository files navigation

Useful links

Comprehensive collection of knowledge: videos, pdfs, implementations

Datastructure cheat sheet short

Datastructure cheat sheet with explenations

Data structures, Algorithms mindmap

Big-o cheat sheet

Visualising data structures and algorithms through animation

https://www.cs.usfca.edu/~galles/visualization/AVLtree.html

https://www.cs.usfca.edu/~galles/visualization/RedBlack.html

https://en.wikipedia.org/wiki/List_of_algorithms

Graphs

algorithms cheat sheet

Pathfiding

BFS with Bitmasking

In standard BFS scenarios, a visited array or set is diligently maintained to steer clear of revisiting nodes. However, BFS with Bitmasking challenges this norm. Nodes, instead of being dismissed, are revisited, now equipped with an additional layer of information — the state. This state, often represented by a bitmask, augments the node’s identity, enriching the exploration process. Used in solution of Travelling salesman problem.

TSP solution with BFS + Bitmasking video explanation pt1

TSP solution with BFS + Bitmasking video explanation pt2, code

Eulerian circuit and path

Network flow

bipartite matching

See also: bipartite matching, capacity scaling

source

youtube

Bitmasking

In computer programming, the process of modifying and utilizing binary representations of numbers or any other data is known as bitmasking.

See also chapter 10 "Bit manipulation", "Competitive programmer's handbook" by Antti Laaksonen

About

attempts to implement algorithms

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages