I am a mechanical engineer by education and in the software companies for last 15 years. I would like to get a SWE job in FANG. So started leetcoding and I am able to solve array , string , binary tree , recursion , two pointer problems. I am clueless in how to identify and how to approach and solve graph problems and DP problems. What Should be my study plan before I start solving graph and dp problems in Leetcode. Thanks for your help. Tc : 200k
What being mechanical engineer has to do with your inability to solve DP?
What should your study plan be before you start solving graph and DP problems? Stop overanalyzing holy shit, just start by solving graph and DP problems.
how to identify problems relating to: graph - states and transitions between them DP - caching/memoization on subproblems if it's still too hard to figure out problem type, just start solving the easiest problems after filtering for a specific tag
Thank you
You will have issues with visa transfer though.
Not. If he had 10 years of experience.
I am USC here now.
Elements of programing interviews
Thanks
If ur already 200k+ what appeals u about faang?
I am also a ME and have gotten a hang of Graph. DP is still elusive. I would say work out the classical graph algos (Bfs, Dfs, djikstra ) on a paper. See how the stack/queue changes as you move along. Invest a week just in understanding the simplest of things and do the easy questions . Also, the MIT lectures on graph are very nice. Good luck
Thank you , good advice.
Check this --> https://www.coursera.org/learn/algorithms-on-graphs Fellow Mechie. but I took an algo. course in my undergrad and simultaneously did the whole specialization. Can confirm the course is as good as any Uni course for theory.
Why would Bloomberg have a mechE
I had previous 10y experience In IT companies like infosys in India and I was able crack bb interview.
Gotcha