You have to write a function that receives a tree – potentially large but finite –
and a list of pairs of tree's nodes.
For each pair, you must determine if the two nodes are on a same path (True) in the tree or not (False), then return an iterable/list of these booleans.
Input: two arguments:
- a tree as a tuple (a node, list of sub-trees)
- a list of pairs (the tuples of two nodes)
Output: An iterable/list of booleans.
on_same_path( ('Me', [('Daddy', [('Grandpa', ), ('Grandma',...
- No Ads
- No Limits
- More Content
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin --ff
checkio install-plugin --chromium