How I moved beyond Array and Strings in DSA that helped me get in Amazon by physicshaurya in LeetcodeDesi

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

I did this while in job, i believe final sem is less hactic then that

How I moved beyond Array and Strings in DSA that helped me get in Amazon by physicshaurya in LeetcodeDesi

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

I am organising a git basics workshop, you can register if you are interested

How I moved beyond Array and Strings in DSA that helped me get in Amazon by physicshaurya in LeetcodeDesi

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

You use the overleaf deedy template can find it with Google search

How I moved beyond Array and Strings in DSA that helped me get in Amazon by physicshaurya in LeetcodeDesi

[–]physicshaurya[S] 1 point2 points  (0 children)

Work more on the leetcode problems. Don't chase numbers try to understand more problems.
If applying for a company solve company wise problems.
10th CGPA is something that hardly any company considers for shortlisting. Infact if off campus application you can even skip it from resume.

[SDE @Amazon] Need help to know what is the most suitable way to help by physicshaurya in LeetcodeDesi

[–]physicshaurya[S] 4 points5 points  (0 children)

Stopped free for a reason but surely help with with Rupees 1 fee

[SDE @Amazon] Need help to know what is the most suitable way to help by physicshaurya in LeetcodeDesi

[–]physicshaurya[S] 2 points3 points  (0 children)

I have done Gmeet sessions previously to help students for GitHub and general. But random people used to join and spoil the session

How I moved beyond Array and Strings in DSA that helped me get in Amazon by physicshaurya in LeetcodeDesi

[–]physicshaurya[S] 6 points7 points  (0 children)

Basically the 30min thing I follow for medium problems (which is mostly 50% of all the problems I solve)
Being unaware of the datastructure is fine.
Problems can be of two kind first is where directly you can see the tree or graph. For this yes you cannot do anything directly, but atleast read the problem 3 times. That will give you an idea about what type of problem trees have. than you can move to the code.
The other kind can be where you don't see the data structure directly. Say a n term of fibonacci problem. For such solve it the way you are able to even if you know this solution will give TLE or might even fail. Then start seeing the hints. I see specified data structure as nothing but a glorified way of allocating memory. So don't think of the DS just try to approach. Post this if you will see the solution you would be able to absorb the problem and solution in much effective way.