All Questions
9 questions
1
vote
1
answer
182
views
Testing Depth First Search Using Pytest
I have an implementation of depth first search, which I want to test using the pytest framework.
I would be making test cases for other graph algorithms, and would ...
- 445
10
votes
2
answers
2k
views
Verhoeff check digit algorithm
A recent question on credit card validation here on Code Review, led me down a dark rabbit hole of check digit algorithms. I took a stop at the Verhoeff algorithm and tried to implement it myself.
...
- 7,323
5
votes
2
answers
491
views
LinkedList class implementation in Python
I was solving this problem for implementing LinkedList and ListNode classes, and Insert and <...
- 2,559
10
votes
3
answers
1k
views
indexOf Boyer-Moore String Search algorithm
This is an implementation of Boyer-Moore string search algorithm index_of for a pattern in text. I was challenged to implement it by my friend.
This Python ...
- 2,559
4
votes
1
answer
1k
views
Making the Levenshtein distance code cleaner
I was writing an implementation of Levenshtein distance in Python and I found my code really ugly.
Have you any idea how to make it more elegant?
...
- 361
8
votes
2
answers
355
views
Next number with the same sum of digits
I recently came across a email bot that would give you random problems to solve.
Here is the problem.
Please write a function in python which receives a natural decimal N-digit number (1 to 15 ...
- 81
5
votes
2
answers
14k
views
Disjoint-set data structure in Python 3
Inspired by this question, I decided to implement a Disjoint-set data structure in Python 3. I mainly followed this description for understanding the algorithm (but did not do the optimizations for ...
- 1,655
5
votes
1
answer
984
views
Test many sorting algorithms using Python and Nose
I'm trying to learn how to build a good test suite, using simple sorting as an example.
Particularly, I am using Nose to generate all the tests based on a simple list of lists, where each sublist is a ...
- 151