Purpose
The following PR addresses nodes' names and descriptions to make them more descriptive for beginners, PRs are organized according to the location in DynamoDS.

These corrections are for CoreNodes.List

NODE 165 : List.Transpose
Description Input: A list of lists to be transposed -> List of lists to be transposed
Description Output: A list of transposed lists. -> List of transposed lists.

NODE 166 : List.SortIndexByValue
Description Input: The list of items to be sorted -> List of items to be sorted
Output: newList -> int[]
Description Output: The indices of the items in the sorted list. -> Indices of the items in the sorted list.

NODE 167 : List.Sort
Output: newList -> list
Description Output: The indices of the items in the sorted list. -> Sorted list

NODE 171 : List.Reorder
Description Output: The reordered list. -> Reordered list.

NODE 172 : List.GroupByKey
Output: unique keys -> uniqueKeys

NODE 177 : ReplaceByCondition
Description Input: Predicate used to determine if it should be replaced -> Replacement function used to determine if an object should be replaced
Output: var -> item
Description Output: If condition(item) = True, then replaceWith is returend. Otherwise item is returned unaltered -> Item replaced by condition

NODE 180 : List.Insert
Description Output: The list with the element inserted -> List with the element inserted

NODE 181 : List.Flatten
Input: amt -> amount
Description Input: Layers of nesting to remove. -> Layers of list nesting to remove (-1 will remove all list nestings)
Output: var[]..[] -> list
Description Output: var[]..[] -> Flattened list by amount

NODE 187 : List.AddItemToFront
Description Output: New list. -> List with added items

NODE 188 : List.AddItemToEnd
Output: var[]..[] -> list
Description Output: var[]..[] -> List with added items

NODE 192 : List.SetUnion
Output: newList -> list

NODE 193 : List.SetIntersection
Output: newList -> list

NODE 194 : List.SetDifference
Output: newList -> list

NODE 195 : List.MinimumItem
Description Input: List to take the minimum value from -> List of comparable items to take the minimum value from
Output: min -> item
Description Output: Minimum value from the list. -> Minimum item from the list.

NODE 196 : List.MaximumItem
Description Input: List to take the maximum value from -> List of comparable items to take the maximum value from
Output: max -> item
Description Output: Maximum value from the list. -> Maximum item from the list.

NODE 197 : List.LastItem
Output: last -> item

NODE 201 : List.IsEmpty
Description Input: List to check for items, -> List to be checked if it is empty
Description Output: Whether the list is empty. -> True if list is empty, false if it isn't

NODE 207 : List.Contains
Description Output: Whether list contains the given item. -> True if list contains item, false if it doesn’t

NODE 208 : List.AllTrue
Description Output: Whether all items are true. -> True if all items from list are true, false if one or more items is not true

NODE 209 : List.AllIndicesOf
Output: var[]..[] -> indices

NODE 210 : List.AllFalse
Description Output: Whether all items are false. -> True if all items from list are false, false if one or more items is not false

NODE 213 : List.Combinations
Output: comb -> lists

NODE 359 : List.Clean
Description Input: var[]..[] -> List containing nulls and empty sublists to clean
Output: var[]..[] -> list

Reviewers

@Amoursol
@QilongTang
@aparajit-pratap