Skip to content

Instantly share code, notes, and snippets.

@kmicinski

kmicinski/recursion-practice.py

Created September 19, 2018 02:51
Show Gist options
  • Star 1 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save kmicinski/45efee0ac452e0f2af07113459144477 to your computer and use it in GitHub Desktop.
Save kmicinski/45efee0ac452e0f2af07113459144477 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
recursion-practice.py
def isEmpty(lst): return len(lst) == 0
def hd(lst): return lst[0]
def tl(lst): return lst[1:]
# Return the reverse of lst
def reverse(lst): return []
# Find the minimum element of the list
def findMin(lst): return 0
# Concatenate every string in the list together
def concatAll(lst): return ""
# Return the longest string in a list of strings
def longestString(lst): return ""
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment