#Leetcode

iven the head of a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
Example 1:
Input: head = [1,4,3,2,5,2], x = 3
Output: [1,2,2,4,3,5]
Example 2:
Input: head = [2,1], x = 2
Output: [1,2]
Link to challenge : leetcode.com/problems/partiti... or
leetcode.com/explore/challeng...

[@paraschauhan4466]

keep going alisha i hope you are achieved more

[@SahilBansal17]

Thanks, Great explanation!

[@surajnetha3426]

Thanks for the explanation and code is also easy !!😄

[@anshulbansal7712]

Helpful solution

[@666Imaginative]

Thanks :) God bless you

[@reshmaparveen6679]

Great example

[@ashokdurunde1814]

thank you

[@Star_Bawa9]

Could you please guide me which lang to choose for leetcode ,i have learned java but mostly people use c++.??why is that

[@jedex99]

it was awesome I was surprised 😮😮😮 how you have explained you nailed it Alisha 😮😮😮

[@gouravkumarshaw417]

Thanks!!

[@raushankumar6993]

Thanks🙏🙏

[@aviralsharma9260]

nice explanation

[@divyagupta6854]

Even though your handwriting is bad, your way of explaining things is awesome. It was nicely explained, and explanation is easy to grasp.

[@chaitanyanimma2939]

hope you'll post videos frequently!! And also if possible,why don't you post many other tricky medium - hard questions.

[@probabilitycodingisfunis1]

Hey ,I will definitely try to post other questions too.

[@ankushchavhan1332]

Awesome

[@SantiagoRodriguez-bz8ck]

Te amo me acabas de iluminar la vida

[@rachitbadoni5717]

Nice explanation Di ❤😇

[@nikhilpandey3486]

Great

[@shivamagarawal8236]

can't it be done w/o creating the other list i.e in O(1) space

[@sameera2426]

yes it can be

[@sdaks001]

@@sameera2426 how

[@Yash-fh7gm]

hey thanks for posting this great video, very nicely explained
videos of Code with Alisha never disappoints