Devashish Shakya

TCS | 2024 | MERN | DSA
A normal programmer doing normal things.

[Devashish Shakya @DevashishShaky]

Just check if the element is present or not. If not, add it in the list at the same index as its value.
#gfg #potd #POTDwithGFG

[Devashish Shakya @DevashishShaky]

Yeah-Yeah not the best solution I know but the simplest.

[Devashish Shakya @DevashishShaky]

Gfg Potd solution

[Devashish Shakya @DevashishShaky]

Does not feel like an optimal approach... But it works!
#LeetCode #problem of the day #solution below.

[Devashish Shakya @DevashishShaky]

below is the solution to today's #potd of #gfg

[Devashish Shakya @DevashishShaky]

Today's question was Tricky, I thought search from the left and search from the right if the index intersects then return True else False. BUT that didn't work. The best approach requires you to check the left indexes first then right indexes if we reach end or start return true.

[Devashish Shakya @DevashishShaky]

GFG POTD Initially I was doing the weird thing storing all the sub arrays sum in a HashSet and then searching from left to right and Obviously I was wrong. But below is the correct approach to the question.

[Devashish Shakya @DevashishShaky]

GFG potd solution... Good night.

[Devashish Shakya @DevashishShaky]

#LeetCode #POTD #dsa #problem wants you to divide the sorted array such that the sum of first and last should be equal to (first - 1)th + (last - 1)th... (first - n)th + (last - n)th term and find the sum of the product the opposite end elements. I hope it makes sense.🤨

[Devashish Shakya @DevashishShaky]

(Day 24) GFG's POTD solution question wants you to find the elements whose frequency is greater than N/3.
The solution is very simple just add everything in a map and update the frequency accordingly.
Below is the solution in Java.
#POTDwithGFG #dsa #geeksforgeeks

[Devashish Shakya @DevashishShaky]

#LeetCode todays #potd solution

[Devashish Shakya @DevashishShaky]

Today's GFG POTD was a very simple question which involves the use of ArrayList. You need to know only two things how to add and how to delete in the ArrayList.
Below is the solution in java.
#POTDwithGFG #geekstreak2024 #gfg

[Devashish Shakya @DevashishShaky]

Day 21! 🎉 I just completed the 21-day #geekstreak2024 powered by #DeutscheBank. This was my first coding challenge, and it’s been an exciting journey! From tough problems to easy wins, every day helped sharpen my skills. Now, I’m ready for the next challenge! 🚀

[Devashish Shakya @DevashishShaky]

21/21 and I have finally completed the GFG's 21 days streak challenge. This is my #first time completing any programing #challenge ever. Now, I'm planning to continue the challenge and let's see where it takes me.
Cheers 🔥🔥🔥 #geekstreak2024 #DeutscheBank

[Devashish Shakya @DevashishShaky]

20/21🔥Only one day left to complete the #geekstreak2024 21 days challenge powered by #DeutscheBank below is the code in C++.

[Devashish Shakya @DevashishShaky]

Solution for day 19 of #geekstreak2024 and #DeutscheBank. This question was very easy below is the solution.

[Devashish Shakya @DevashishShaky]

@AyushSondhiya @DeutscheBank @geeksforgeeks Great job Bro! I will recommend you to continue the streak. Cheers.

[Devashish Shakya @DevashishShaky]

Today is day 18 of the 21-day challenge of #geekstreak2024 #DeutscheBank potd challenge.

[Devashish Shakya @DevashishShaky]

Day 17 of 21 days challenge #geekstreak2024 powered by #DeutscheBank. Solved the question before going to office. Below is the solution in java.

[Devashish Shakya @DevashishShaky]

Day 16 of solving #geekstreak2024 powered by #DeutscheBank and todays question is similar to stock span problem with a different approach.
Below is the solution in java.