; Constructing a list using literals
'(3 2 1 "Hello" "World")

; Converting an existing data structure to a list
; `(seq x)` converts `x` to a list whenever possible. 
(seq [3 2 1 "Hello" "World"])

; There are also functions that generate lists.
; (range n) constructs a list of integers.
(range 10)

; (range m n) is a list of integers from m to (n-1)
(range 5 10)

; The nil value is treated as an empty list
nil

(def xs '(3 2 1 "Hello" "World" :again :and :again))

; Get the first element
(first xs)

; Get the rest of the list.
(rest xs)

; Last element of the list.
(last xs)

; Cherry picking elements
(nth xs 3)

; Take a few elements from the head list
(take 3 xs)

; Take a few elements from the end of the list
(take-last 3 xs)

; Remove a few elements from the head of the list
(drop 3 xs)

; Remove a few elements from the tail of the list
(drop-last 3 xs)

(def xs '(3 2 1 "Hello" "World" :again :and :again))

; Adding one element to the beginning
; (cons element list)
(cons "NEW" xs)

; Adding an element in the fastest way.
; (conj list element)
;
; Since we are dealing with linked list, the
; fastest insert is at the head of the list.
(conj xs "NEW")

; We can concatenate two lists to form a larger one.
(concat '("*" "**") xs)

; We can use concat to append elements to the tail of the list
(concat xs ["***"])

; We can insert multiple elements into the list in the most efficient way.
; For linked list, it's to prepend them at the end of the list.
(into xs ["*" "**"])

(def xs '(3 2 1 2 7 5 3 4 1))

; Count elements
(count xs)

; Count elements in an empty list
(count nil)

; Sort the list using a natural sorting
(sort xs)