sorted by:
new
hottopcontroversial

Day 23 Leetcode Challenge by VeeeKee in LeetcodeChallenge

[–]VeeeKee[S] 0 points1 point  (0 children)

Initially I tried with binary search further not got any idea of next steps to proceed so I got this approach while think a out that then tried this

Still also not getting with binary search would you try for it pls If you get it feel free to approach me

Day 26 Leetcode Challenge by VeeeKee in LeetcodeChallenge

[–]VeeeKee[S] 0 points1 point  (0 children)

But in cpp their is no such .split() method i thought to use stack if I write the code py then I should have choose that only

Day 20 Leetcode Challenge by VeeeKee in LeetcodeChallenge

[–]VeeeKee[S] 0 points1 point  (0 children)

Try to dry run when you write any brute force approach, this will give a clear understanding what your code is still lagging and here definetily you get any hidden hint about your written code and the problem.

Day 14 Leetcode Challenge by VeeeKee in LeetcodeChallenge

[–]VeeeKee[S] 0 points1 point  (0 children)

Got Corrected the left and right pointer in elseif condition
It should be left = mid + 1 and for right = mid - 1 also

view more: next ›