The challenge Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: ["flower","flow","flight"] Output: "fl" Example 2: Input: ["dog","racecar","car... (more…)

You don't have permission to access /~annis/creations/PyLisp/ on this server. (more…)

mifid2-rts - Executable form of the MiFID II RTS (Regulatory Technical Standard) documents. (more…)

Part 5 of designing modules compares inheritance versus composition, and shows how new business requirements can be added without changing existing code. (more…)

In the previous article, we went through the basic understanding of what sets are and how their memberships work through simple Python 3… (more…)