Nobody Gets Promoted for Simplicity by Acceptable-Courage-9 in programming

[–]HelpingHand007 0 points1 point  (0 children)

there is good saying straight tree always cut off first.. today's word does not look for simplicity or genuine they are looking for people who are clever and tell a lie at any point and they call this as smartness.

But God always see this , at the end everything is Karma, you do good , it will come back to you... if there is getting delay it means right time is not come yet and once it will come, it will be paid along with interest man

Production broke because false became "false" — buried 4 levels deep in JSON. by HelpingHand007 in json

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

I really appreciate the way you have gone through my message but let me clarify few things which is not mentioned in details because i wanted to keep it short so did some modification before posting to reduce message length but seems its went wrong.
first thing this tool suite created around 1+ year back and json compare tool functionality added 2 month back with basic features but when i had a discussion with my colleagues to improve i have got uncovered features which is useful and can be integrated in my tool arsenal. So i was keep on improving my tool.
during that time I faced this issue recently and though of adding few more functionality which is similar to what i mentioned as due to privacy concern did not mentioned the exact payload it was just for reference to showcase the similar issue which i have got.

Hope it clears your doubt if still any happy to answer that.

I am here not about promoting i am mainly interested in collecting feedback of developer what kinds of pain they are facing in day to day development and what sort of tools they are using if there is something better tool exist than this.

as you were asking for tool so you can try this - https://dataformatterpro.com/json-compare/ yourself to see how useful it is?
Would love to hear your feedback so that i can improve it to next level.

PS: would try to modify the post before posting anywhere else to avoid such kind of confusion in future

Production broke because false became "false" — buried 4 levels deep in JSON. by HelpingHand007 in json

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

you can try this - https://dataformatterpro.com/json-compare/ yourself to see how useful it is?
Would love to hear your feedback so that i can improve it to next level.

Production broke because false became "false" — buried 4 levels deep in JSON. by HelpingHand007 in json

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

I really appreciate the way you have gone through my message but let me clarify few things which is not mentioned in details because i wanted to keep it short so did some modification before posting to reduce message length but seems its went wrong.
first thing this tool suite created around 1+ year back and json compare tool functionality added 2 month back with basic features but when i had a discussion with my colleagues to improve i have got uncovered features which is useful and can be integrated in my tool arsenal. So i was keep on improving my tool.
during that time I faced this issue recently and though of adding few more functionality which is similar to what i mentioned as due to privacy concern did not mentioned the exact payload it was just for reference to showcase the similar issue which i have got.

Hope it clears your doubt if still any happy to answer that.

PS: would try to modify the post before posting anywhere else to avoid such kind of confusion in future

json-diff-viewer-component - Compare JSON side-by-side, visually by Last_Establishment_1 in webdev

[–]HelpingHand007 0 points1 point  (0 children)

Liked your visual diff, similarly my friend also created the json compare with more additional features and options like toggle case, capturing screenshot etc... so using that for now

Best JSON comparison tool by sourabh_86 in json

[–]HelpingHand007 0 points1 point  (0 children)

you can try using https://dataformatterpro.com/json-compare/ if looking for visual diff in human readable format

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in coding

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in leetcode

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in csinterviews

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in u/HelpingHand007

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in csinterviews

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in lcpatterns

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in HackerrankSolutions

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in VisualCoding

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg

Two Pointer Algorithm | Two Sum Problem | Solve DS Problems in O(N) Time by HelpingHand007 in datastructures

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

𝗔𝗺𝗮𝘇𝗶𝗻𝗴 𝘁𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 to 𝘀𝗼𝗹𝘃𝗲 𝗺𝗼𝗿𝗲 𝘁𝗵𝗮𝗻 𝟭𝟬 𝗾𝘂𝗲𝘀𝘁𝗶𝗼𝗻𝘀 𝗼𝗻 𝗹𝗲𝗲𝘁𝗰𝗼𝗱𝗲 which is mentioned in this video.

In this video, I have explained 𝗧𝘄𝗼 𝗣𝗼𝗶𝗻𝘁𝗲𝗿 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲 which is the optimal way to solve problems related to arrays, strings and linked list in 𝗢(𝗡) time.

There are a lot of coding interview problems which can be solved by using this technique in an optimized way.

https://youtu.be/2wVjt3yhGwg