@JulianWloch hair god is posting gpt solution and upvoting his own solution with fame accounts

@janardan_ai oh, that's not fair

@JulianWloch could you explain a bit since I feel like you quick sort is very simple to understand. today I went on with merge

@kara2004_91 you have a point somewhere in arr that is between the left (L) side and right (R), assign moving left side and right (l,r), increment through arr, and move smaller than pivot to moving left (l) side same for right (r), do it again from L static to l moving same fore right

@JulianWloch Don't know about Python, but in Java QuickSort is giving TLE

@RajReeshu Normal quick sort yes, but this one is a little bit changed to fit in time criteria

@JulianWloch i applied merge sort.😂😂

@JulianWloch and when I used quick sort gave me TLE 😭 had to use merge

@JulianWloch just python things code looks so small than java 🥲

@JulianWloch give a try to solve subsets question under leetcode

@JulianWloch Yeah today was good, Got it with Merge, Heap and quick

@JulianWloch In Java, Quick sort has worst complexity of o(N2), hence it will give TLE.

@JulianWloch As the question says minimum space possible, it would be better to apply heap sort instead of quick sort.

@JulianWloch Hi @JulianWloch do you make handwritten notes before writing the code? Can u share the approach you take!

@HMishra08 For leetcode, I go with thinking and Paint is surprisingly useful to visualize simple things.