Is the List Sorted
Return True if the values never decrease from one node to the next (equal neighbors are fine), otherwise False. An empty list or a one-node list counts as sorted. The list is passed in as head.
Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.
Example 1
head [1,2,2,5]
returns true
Never goes down.
Example 2
head [1,3,2]
returns false
3 is followed by 2.
Constraints
0 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Kth Smallest ValueBeginner
- Largest Adjacent Pair SumBeginner
- Largest ValueBeginner
- Last Node's ValueBeginner
- Linked List to TextBeginner
- Longest Run of Equal ValuesBeginner
- One Bubble PassBeginner
- Running Totals ListBeginner