Concatenate list1 and list2.

Add one element to the tail of the list.

Delete list’s last element.

Delete list’s head element.

L1 – L2. Return list with elements that are in L1 but not in L2.

L1 intersect L2. Return list with elements that are in both L1 and L2.

Summation of 1 to n.

Summation of all elements in L.

Summation of two biggest elements in L.

Find 2 biggest elements in L, return them in a list.

(asclists ‘(73   62   32   19   22   95   98   29   31   63)) => ((73) (62) (32) (19 22 95 98) (29 31 63)).


Facebooktwittergoogle_plusredditpinterestlinkedinmail

Leave a Reply

Your email address will not be published. Required fields are marked *