Pinned Loading

1. lena_research_dbt lena_research_dbt Public

   Python 1 1

2. Topological Sort Topological Sort

   1

   def topological_sort(graph):

   2

       s, result = set(), []

   3

   4

       def _recurse(u):

   5

           if u not in s:

3. Python trick to find subsequence Python trick to find subsequence

   1

   How it works

   2

   ------------

   3

   4

   Suppose `sequence = 'Hello!'` and `subsequence = 'ello'` then the function would execute like so:

   5

4. Python memoize wrapper Python memoize wrapper

   1

   from functools import wraps

   2

   3

   def memo(f):

   4

     cache = {}

   5

5. Basic Sorts Basic Sorts

   1

   def mergesort(A):

   2

     def _merge(A, left, m, right):

   3

       left_A, right_A = A[left:m], A[m:right]

   4

       left_len, right_len = len(left_A), len(right_A)

   5