Just started preparing for coding interviews. Decided to start with ctci since it's been 10 years since graduation. What's the best way to get through ctci quickly? I.e are there any chapters to ignore? Do problems from the book or just read the theory and jump to leetcode? Author herself says not to ask questions from her book.
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
My suggestion would be CS Fundamentals ->CTCI -> EPI -> Leetcode.
1. Learn Data Structures first. All of them important one atleast.
2. Try solving easy level question with those data structures so that you feel confident.
Eg : If you are studying LinkedList, learn how to reverse it and all.
3. Move on Algorithms part.
Eg . Learn famous algos like DFS, BFS, Recursion DP and all.
4. Start LeetCode grinding.
You can shuffle these in between.
Material : LC, AlgoExpert, GFG, other blogs just google,YouTube lots of good playlist on specific topics, shuffle pages of CtCI in between your preparation.
1. Buy good book on algorithm design and data structures. You need to have good understanding of the theory + online course (khan academy is good)
2. Solve problems on leetcode or hackerrank. Whether your are able to solve the problem or not always lookup discussion section.