Скачать или смотреть Partition A Linked List: Amazon Interview Problem | LeetCode 86

In this episode, we solve Cracking the Coding Interview Problem Partition List where we are given a target value and asked to partition a linked list around that value. We solve this in O(n) linear runtime and O(1) memory.

Watch and enjoy.

My Other Channel:    / @disrupted572  

Top Software/ Coding Channels:
   / @csdojo  
   / kevinnaughtonjr  
   / @jomakaze  
   / @techlead  

Top Python Coding Channels:
   / @neetcode  
   / @timc3406  

Twitter:   / realchrisibe  
Instagram:   / christopher_ibe  
Facebook:   / christopher.ibeekeocha  
Snapchat: @christopheribe
LinkedIn:   / christopher-ibe-ekeocha  

Problem Statement:
Partition: Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x.

(IMPORTANT: The partition element x can appear anywhere in the “right partition”; if does not need to appear between the left and right partitions. The additional spacing in the example below indicates the partition. Yes, the output below is one of many valid outputs!)
EXAMPLE
Input: 3 - 5 - 8 - 5 - 10 - 2 - 1 [partition=5]
Output: 3 - 1 - 2 - 10 - 5 - 5 - 8

Hint:
There are many solutions to this problem, most of which are equally optimal in runtime. Some have shorter, cleaner code than others. Can you brainstorm different solutions?

Consider the elements don’t have to stay in the same relative order. We only need to ensure that elements less than the pivot must be before elements greater than the pivot. Does that help you come up with more solutions?

LeetCode link: https://leetcode.com/problems/partiti...

Motivation Quotes:
https://graciousquotes.com/hard-work-...
https://www.birthdaywishes.expert/har...

Amazon Link: https://www.amazon.com/Cracking-Codin...