Click here to see the full article post
@KnightY you are right. Thanks for catching that. I have corrected it.
@ykvarts We need hashset because of collinear points. Consider the case- input contains only three collinear points. Then left-right scan and right-scan give the same result. Thanks.
@nlharish @kk636 @kk636 @bnslakk I have fixed the codes. Please have a look. Thanks.
@zestypanda I have changed it to O(n^2). Thanks.
@sumeet26 You can do anything you want. DFS is generally implemented using recursion and recursion is slow.
@sha256pki It's absolutely correct. :)
@aayushgarg You're right. Thanks for pointing out.
@zestypanda I've updated the article. Thanks for the valuable feedback.
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.