Explore >> Select a destination
|
You are here 
|
imapenguin.com | ||
| | | | |
www.martinkysel.com
|
|
| | | | | For two strings A and B, we define the similarity of the strings to be the length of the longest prefix common to both strings. | |
| | | | |
techtldr.com
|
|
| | | | | Updated in 2020 to work with Python 3. My company uses multiple git repos that all depend on one another. Often I find myself trying to grep through a few of them at the same time. Regular grep works, but it takes a long time and displays a lot of noise. git grep only searches [...] | |
| | | | |
idlip.github.io
|
|
| | | | | ||
| | | | |
bfontaine.net
|
|
| | | Tips and tricks in Python, Bash, Clojure and other languages/environments. | ||
