Anthony Lepore – Medium

Anthony Lepore

Anthony Lepore
in
Better Humans

30 Years of Keeping a Dream Journal

Recording my dreams every morning since high school has fostered an appreciation of the variety of life’s experiences.

Mar 16, 2022

A dream scene of a sailboat crossing the starts and space dust.

Mar 16, 2022

Anthony Lepore
in
CodeX

Detect a Loop/Cycle in a Singly Linked List

A detailed examination of the Floyd cycle detection algorithm in Ruby

Nov 4, 2021

Detect a Loop/Cycle in a Singly Linked List

Nov 4, 2021

Anthony Lepore
in
CodeX

Lexicographic Permutation Algorithm in Ruby

A simple algorithm coded in Ruby to find the next lexicographic permutation explained in detail.

Oct 28, 2021

Lexicographic Permutation Algorithm in Ruby

Oct 28, 2021

Anthony Lepore

How Did an Unknown Ghostwriter Become Part of an Identity Theft Crime?

A warning to freelancers

Oct 6, 2021

How Did an Unknown Ghostwriter Become Part of an Identity Theft Crime?

Oct 6, 2021

Anthony Lepore
in
CodeX

The Fastest Searching Algorithm: Binary Search in Ruby

I am going to start off by saying that this is the fastest searching algorithm with a few caveats. For starters, the data structure that is…

Jun 20, 2021

Photo by Flavio Takemoto

Jun 20, 2021

Anthony Lepore
in
CodeX

Data Structures & Algorithms in Ruby: Depth-First Search (In-order) for Binary Trees

We have now come of the final of the three main types of Depth-First Search (DFS) for a Binary Search Tree: In-Order traversal. DFS…

Jun 11, 2021

Data Structures & Algorithms in Ruby: Depth-First Search (In-order) for Binary Trees

Jun 11, 2021

Anthony Lepore
in
CodeX

Data Structures & Algorithms in Ruby: Depth-First Search (Post-order) for Binary Trees

Last week we introduced the concept of Depth-First Search for Binary Tree traversals. Of the three main types of Depth-First Search (DFS)…

Jun 5, 2021

Data Structures & Algorithms in Ruby: Depth-First Search (Post-order) for Binary Trees

Jun 5, 2021

Anthony Lepore
in
CodeX

Data Structures & Algorithms in Ruby: Depth-First Search (Pre-order) for Binary Trees

In continuing with our current topic of binary tree traversals in Ruby, we are going to introduce depth-first search this week. If you…

May 28, 2021

Data Structures & Algorithms in Ruby: Depth-First Search (Pre-order) for Binary Trees

May 28, 2021

Anthony Lepore
in
CodeX

Data Structures & Algorithms in Ruby: Breadth-First Search for Binary Trees

Last week, we implemented a #find method for our Binary Search Tree which returned the Boolean true/false indicating whether our value was…

May 22, 2021

Data Structures & Algorithms in Ruby: Breadth-First Search for Binary Trees

May 22, 2021

Anthony Lepore
in
CodeX

Data Structures in Ruby: Binary Search Tree — Part II

May 13, 2021

Data Structures in Ruby: Binary Search Tree — Part II

May 13, 2021

Anthony Lepore

Anthony Lepore

Composer, playwright, designer for theater, jazz musician, philosopher, software engineer and technical writer for a FinTech firm in NYC.

Following

Help
Status
About
Careers
Press
Blog
Privacy
Terms
Text to speech
Teams