I have 12 yoe. I am comfortable using python for data science but struggle to solve even the easy Leetcode problems. I miss accounting for the edge cases, thinking about more than one pointer makes my brain hurt, any data structure other than array or hashtable is too esoteric for me to fathom. All of my data skills are self taught.
I believe that building proficiency in software development will be beneficial to my career in the long term. I don’t have those opportunities at work at the moment.
I want to take the long term view. How should I prepare so that I go from a LC zero to hero in ONE year.
#Teachmemaster #leetcode #learntolive
Want to see the real deal?
More inside scoop? View in App
More inside scoop? View in App
blind
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
FOLLOWING
Industries
Job Groups
- Software Engineering
- Product Management
- Information Technology
- Data Science & Analytics
- Management Consulting
- Hardware Engineering
- Design
- Sales
- Security
- Investment Banking & Sell Side
- Marketing
- Private Equity & Buy Side
- Corporate Finance
- Supply Chain
- Business Development
- Human Resources
- Operations
- Legal
- Admin
- Customer Service
- Communications
Return to Office
Work From Home
COVID-19
Layoffs
Investments & Money
Work Visa
Housing
Referrals
Job Openings
Startups
Office Life
Mental Health
HR Issues
Blockchain & Crypto
Fitness & Nutrition
Travel
Health Care & Insurance
Tax
Hobbies & Entertainment
Working Parents
Food & Dining
IPO
Side Jobs
Show more
SUPPORT
FOLLOW US
DOWNLOAD THE APP:
comments
do learning cards first
then company cards
before interviews - top 50 company questions
I’d say pick up CTCI or EPI first. Go thru them.
And then
Check out this post! "Master Leetcode Style Coding Interviews [STOLEN] (Software Engineering)"
https://us.teamblind.com/s/qFvYbJqJ
1. Array - 15/11
2. Sliding Window - 9/3
3. Two Pointers - 12/4
4. Binary Search - 4/0
5. Fast and Slow pointers - 6/5
6. Merge Intervals - 6/4
7. Cycle Sort - 5/2
8. String - 19/8
9. Linked List - 9/8
10. Two Heaps - 3/0
11. Linked List Reversal - 6/5
12. Tree 9/7
13. Tree Breadth First Search - 9/9
14. Tree Depth First Search - 11/7
15. Stacks/Queues - 15/2
16. Top K Elements - 10/5
17. K-Way Merge - 3/2
18. Design - 4/2
19. Backtracking - 27/14
20. DP - 7/2
21. Greedy - 18/3
22. Graph BFS/DFS - 2/0
23. Topo Sort - 5/3
24. Union Find - 4/2
25. Tries - 14/3
26. Bit Manipulations - 14/14
27. Other 3/0
I will basically apply to many Tier 1/2 companies and gain practice. Google isn’t the only company I’m targeting so if in a year I don’t pass their bar, then I’ll still be applying elsewhere and hopefully gaining interview experience along the way. Blind has provided enough companies which can pay senior SWEs > $250k TC with decent WLB that I should be fine.