17 OCT 2024 - Welcome Back to TorrentFunk! Get your pirate hat back out. Streaming is dying and torrents are the new trend. Account Registration works again and so do Torrent Uploads. We invite you all to start uploading torrents again!
TORRENT DETAILS
Master The Coding Interview Big Tech (FAANG) Interviews
TORRENT SUMMARY
Status:
All the torrents in this section have been verified by our verification system
Brand new course ready for the 2021 hiring season! Join a live online community of over 350,000+ engineers and a course taught by industry experts that have actually worked both in Silicon Valley and Toronto at top tech firms. Graduates of ZTM courses are now working at Google, Tesla, Amazon, Apple, IBM, JP Morgan, Facebook + other top tech companies.
This is one student 1 month after taking this course:
“I joined the course when it came out, and after a couple of months studying, practice, and more practice, losing sleep and everything I’m proud to say that I got an offer from GOOGLE!! I still can’t believe it, it’s incredibly surreal. And I can’t thank you and this entire community enough for what you’ve given me. This year is notorious for how tumultuous it’s been, but it’s seriously has been a test from the first second of this year.. I’ve shed many, many tears these past 12 months and could write a book on the experience this year. but i just want to Thank you, thank you, thank you from the bottom of my heart for providing me (and this community) the resources needed to realize my potential that I honestly never saw in myself.. and now that I know i can get this far, I know that this is only the beginning..”
Want to land a job at a great tech company like Google, Microsoft, Facebook, Netflix, Amazon, or other companies but you are intimidated by the interview process and the coding questions? Do you find yourself feeling like you get “stuck” every time you get asked a coding question? This course is your answer. Using the strategies, lessons, and exercises in this course, you will learn how to land offers from all sorts of companies. This is the ultimate resource to prepare you for coding interviews. Everything you need in one place!
The goal of the course isn’t to tell you: “Do 100 interview questions and hope you memorize their answers.” NO! Our goal is to use the hand selected common interview questions to give you a framework to answer ANY interview question that these companies may throw at you. Instead of trying to memorize common questions, we teach you the principles and fundamentals that you can use to notice certain common patterns in questions so that any question that you get, you have a framework to answer and be confident in your programming interview.
You will also get access to our private online community with thousands of developers online to help you get through the course and the interview!
Here is what you will learn to use in this course while answering the interview questions step by step with us:
—-Technical—-
1. Big O Notation
2. Data Structures Used:
* Arrays
* Hash Tables
* Singly linked lists
* Doubly linked lists
* Stacks
* Queues
* Binary Trees
* Binary Search Trees
* Tries
* N-ary Trees
* Min/Max Heaps
* Priority Queues
* 2-D Arrays/ Matrices
* Graphs
* Adjacency List
* Adjacency Matrix
* Interface Design
3. Algorithmic Paradigms Used:
* Recursion
* Sorting
* Searching
* Tree Traversals
* Graph Traversals
* Breadth First Search
* Depth First Search
* Divide and Conquer
* Greedy Method
* Dynamic Programming
* Backtracking
4. Specific Algorithms Used:
* Hoare’s Quickselect Algorithm
* Floyd’s Tortoise and Hare Cycle Detection Algorithm
* Bellman-Ford Algorithm
* Dijkstra’s Algorithm
* Topological Sort
Unlike most instructors out there, We are not marketers or salespeople. We are senior engineers and programmers who have worked and managed teams of engineers and have been in these interviews both as an interviewee as well as the interviewer.
Our job as instructors will be successful if we are able to help you get your dream job at a big company. This one skill of mastering the coding interview can really change the course of your career and life and we hope you sign up today to see what it can do for your career!
See you inside the course!
Taught by:
Andrei is the instructor of the highest rated Web Development course on Udemy as well as one of the fastest growing. His graduates have moved on to work for some of the biggest tech companies around the world like Apple, Google, JP Morgan, IBM, etc… He has been working as a senior software developer in Silicon Valley and Toronto for many years, and is now taking all that he has learned, to teach programming skills and to help you discover the amazing career opportunities that being a developer allows in life.
Having been a self taught programmer, he understands that there is an overwhelming number of online courses, tutorials and books that are overly verbose and inadequate at teaching proper skills. Most people feel paralyzed and don’t know where to start when learning a complex subject matter, or even worse, most people don’t have $20,000 to spend on a coding bootcamp. Programming skills should be affordable and open to all. An education material should teach real life skills that are current and they should not waste a student’s valuable time. Having learned important lessons from working for Fortune 500 companies, tech startups, to even founding his own business, he is now dedicating 100% of his time to teaching others valuable software development skills in order to take control of their life and work in an exciting industry with infinite possibilities.
Andrei promises you that there are no other courses out there as comprehensive and as well explained. He believes that in order to learn anything of value, you need to start with the foundation and develop the roots of the tree. Only from there will you be able to learn concepts and specific skills(leaves) that connect to the foundation. Learning becomes exponential when structured in this way.
Taking his experience in educational psychology and coding, Andrei’s courses will take you on an understanding of complex subjects that you never thought would be possible.
——-
Yihua Zhang is one of the Instructors of Zero To Mastery, one of the highest rated and fastest growing Web Development academies on Udemy. He has been working as a software developer for numerous years in Toronto for some of the largest tech companies in the world. He has also been working as an instructor for more than a decade. He is focused on bringing everything he has learned to help you achieve a new career as a developer, but also give you all the fundamental skills required to flourish in this incredible industry.
Yihua is a self taught developer, so he fully understands the challenges and mindset of coming into this industry from various other backgrounds. He has been on both sides of the table, as both an instructor and student numerous times so he can empathize with the difficulty of learning something new and challenging. Learning itself is a skill that needs to be practiced and improved upon, and he is dedicated to helping you improve and master that skill for yourself. Courses need to be practical, you need to be able to understand why you are learning the things that you are being taught. You need to understand the problem before you know the solution, and he prides himself on teaching you how to build professional, real world applications so you truly understand why you are doing things a specific way. He will teach you the mindset and skillset required to grow as a developer as fast as possible, so you can have the rich and fulfilling life that comes with this career.
Yihua’s courses will guide you to build beautifully written and richly featured applications, while truly understanding all the complex concepts you will encounter along the way.
Who this course is for:
Anyone that wants to work a Google, Amazon, Facebook, Microsoft, Apple, Netflix or other top tech companies
Any engineer, developer, programmer, who wants to improve their interviewing skills
Anyone interested in improving their whiteboard coding skills
Anyone who wants to become a better developer
Any self taught programmer who missed out on a computer science degree
Requirements
No previous computer science knowledge necessary
Basic understanding of one programming language
If you have the ambition to learn and get into one of these companies we will make it achievable for you! (see our student success stories)
Last Updated 1/2021
VISITOR COMMENTS (0 )
FILE LIST
Filename
Size
.pad/0
20 B
TutsNode.com.txt
63 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/1. Introduction/1. Course Breakdown.srt
16.2 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/1. Introduction/1.1 Appendix Chapter - Arrays and Big O.html
175 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/1. Introduction/2. Join Our Online Classroom!.html
2.1 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/1. Introduction/3. Exercise Meet The Community.html
1.9 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/1. Introduction/4. Download All Code + Solutions.html
465 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/1. Introduction/4.1 zerotomastery.io - Mastering the Coding Interview (FAANG) - Course Outline.pdf
65.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/3. Thinking About Our Approach.srt
24.1 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/10. Linked List - Question #8 - Merge Multi-Level Doubly Linked List (Medium)/4. Coding Out Our Solution.srt
20.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/11. Linked List - Question #9 - Cycle Detection (Medium)/1. Interview Question #9 - Cycle Detection.srt
15.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/11. Linked List - Question #9 - Cycle Detection (Medium)/4. Optional Proof Of How And Why Floyd_s Algorithm Works.srt
33.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/2. Thinking About Our Solution.srt
18.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/13. Stacks - Question #11 - Minimum Brackets To Remove (Medium)/3. Coding Our Solution.srt
14.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/15. Recursion (Sorting and Hoare_s QuickSelect) - Question #13 - Kth Largest Element/2. Optional Tail Recursion.mp4
231.9 MB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/15. Recursion (Sorting and Hoare_s QuickSelect) - Question #13 - Kth Largest Element/2. Optional Tail Recursion.srt
28.1 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/15. Recursion (Sorting and Hoare_s QuickSelect) - Question #13 - Kth Largest Element/5. Insights From Quick Sort.srt
17.4 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/15. Recursion (Sorting and Hoare_s QuickSelect) - Question #13 - Kth Largest Element/7. Coding Quicksort Into Our Solution.srt
18 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/15. Recursion (Sorting and Hoare_s QuickSelect) - Question #13 - Kth Largest Element/9. Coding Our Solution With Quickselect.srt
15.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/4. Walking Through Our Solution.srt
15.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/16. Recursion (Binary Search) - Question #14 - Start And End Of Target (Medium)/5. Coding Our Solution.srt
17.1 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/17. Binary Trees - Question #15 - Maximum Depth Of Binary Tree (Easy)/3. Learning The Process For Solving Binary Tree Problems.srt
27.1 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/18. Binary Trees - Question #16 - Level Order Of Binary Tree (Medium)/2. Walking Through Our Solution.srt
24.2 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/4. Thinking About Pre-Order, In-Order, and Post-Order Traversals For Our Solution.srt
16.9 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/19. Binary Trees - Question #17 - Right Side View of Tree (Medium)/6. Coding Our Final DFS Solution.srt
16.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/10.1 Leetcode Question Link.html
99 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/11. Solutions In Other Languages.html
264 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/2. How To Approach Our Problem.srt
16.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/3.1 Brute Force Solution Repl.html
109 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/5.1 Leetcode Question Link.html
99 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/6. Analyzing Space and Time Complexity.srt
14.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/7.1 Appendix Chapter - Hash Maps.html
175 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/2. Arrays - Question #1 Google Interview Question Two Sum (Easy)/8.1 Optimal Solution Code Repl.html
114 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/20. Full _ Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/2. Thinking Deeply About A Full Binary Tree.srt
15.2 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/20. Full _ Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/3. Figuring Out Number Of Nodes At Last Level.srt
21.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/20. Full _ Complete Binary Trees - Question #18 - Number Of Nodes In Complete Tree/4. Coding Out Our Full Solution.srt
29 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/21. Binary Search Tree - Question #19 - Validate Binary Search Tree (Medium)/2. Thinking About Our Logical Solution.srt
20.2 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/22. Heaps _ Priority Queues/3. Deletion In Heaps - Understanding Sift Down.srt
15.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/22. Heaps _ Priority Queues/6. Coding Our Deletion And Sift Down Methods.srt
16.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/24. 2D-Arrays - Question #20 Number Of Islands (Medium)/3. Approaching Our Problem - Thinking Deeply About The Values.srt
22.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/24. 2D-Arrays - Question #20 Number Of Islands (Medium)/5. Coding Our Solution.srt
25.8 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/24. 2D-Arrays - Question #20 Number Of Islands (Medium)/6. Thinking About Space And Time Complexity.srt
21.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/2. Figuring Out Our Initial Logic.srt
15.4 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/3. Figuring Out The Rest Of Our Solution.srt
19.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/25. 2D-Arrays - Question #21 Rotting Oranges (Medium)/4. Coding Out Our Solution.srt
19.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/2. Figuring Out Our Logical Solution.srt
19.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/26. 2D-Arrays - Question #22 - Walls And Gates (Medium)/3. Coding Out Our Solution.srt
16.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/27. Intro to Graphs - Representation _ Traversal Algorithms/1. Introduction To The Types Of Graphs.srt
15.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/28. Graphs - Question #23 - Time Needed to Inform All Employees (Medium)/1. Question #23 - Time Needed to Inform All Employees.srt
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/29. Graphs - Question #24 - Course Scheduler (Medium)/3. Coding Out Our Initial BFS Solution.srt
20.4 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/29. Graphs - Question #24 - Course Scheduler (Medium)/6. Coding Our Final Solution.srt
22.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/29. Graphs - Question #24 - Course Scheduler (Medium)/6.2 Optimal Topological Sort Solution (No Adjacency List) Code Repl.html
153 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/3. Arrays - Questions #2 - Container With Most Water (Medium)/1.1 Leetcode Question Link.html
117 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/3. Arrays - Questions #2 - Container With Most Water (Medium)/3. Thinking Through A Logical Brute Force Solution.srt
15.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/3. Arrays - Questions #2 - Container With Most Water (Medium)/4.1 Brute Force Solution Repl.html
134 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/3. Arrays - Questions #2 - Container With Most Water (Medium)/6. Thinking About Our Optimal Solution.srt
18.8 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/3. Arrays - Questions #2 - Container With Most Water (Medium)/7.1 Optimal Solution Code Repl.html
130 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/3. Arrays - Questions #2 - Container With Most Water (Medium)/7.2 Leetcode Question Link.html
117 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/1. Question #25 - Network Time Delay.srt
17.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/3. Greedy Method _ What Is Dijkstra_s Algorithm.mp4
233.7 MB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/3. Greedy Method _ What Is Dijkstra_s Algorithm.srt
21.9 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/5. Coding Our Solution With Dijkstra.srt
22.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/6. Time And Space Complexity Of Our Solution.srt
18.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/8. What is The Bellman-Ford Algorithm - Conceptualizing Dynamic Programming.srt
21.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/30. Graphs - Question #25 - Network Time Delay (Medium)/9. What is The Bellman-Ford Algorithm - The Algorithm Itself.srt
22.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/31. Dynamic Programming - Question #26 - Minimum Cost Of Climbing Stairs (Easy)/2. Understanding _ Identifying Recurrence Relation.srt
21.1 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/1. Question #27 - Knight Probability In Chessboard.srt
16.2 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/3. Identifying The Recurrence Relation.srt
22.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/5. Second Step - Memoizing Our Redundant Recursive Calls.srt
19.4 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/32. Dynamic Programming - Question #27 - Knight Probability In Chessboard (Medium)/6. Figuring Out The Logic For Our Bottom Up Solution.srt
19.6 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/33. Backtracking - Question #28 - Sudoku Solver (Hard)/3. Learning The Backtracking Template.srt
16.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/33. Backtracking - Question #28 - Sudoku Solver (Hard)/7. Coding The Recursive Backtracking Portion Of Our Solution.srt
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/34. Interface Design - Question #29 - Monarchy/3. Thinking About The Logical Of The Monarchy.srt
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/5. Strings - Question #4 - Typed Out Strings (Easy)/1.1 Leetcode Question Link.html
116 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/5. Strings - Question #4 - Typed Out Strings (Easy)/3.1 Brute Force Solution Repl.html
127 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/5. Strings - Question #4 - Typed Out Strings (Easy)/5. Coming Up With Optimal Solution.srt
15.2 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/5. Strings - Question #4 - Typed Out Strings (Easy)/6. Coding Our Optimal Solution.srt
15.3 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/5. Strings - Question #4 - Typed Out Strings (Easy)/6.1 Optimal Solution Code Repl.html
115 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/5. Strings - Question #4 - Typed Out Strings (Easy)/7.1 Leetcode Question Link.html
116 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/1.1 Leetcode Question Link.html
138 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/6. Strings - Question #5 - Longest Substring Without Repeating Characters (Medium)/3.1 Brute Force Solution Repl.html
145 B
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/7. Strings - Question #6 - Valid Palindrome _ Almost Palindrome/3. Almost A Palindrome.srt
14.7 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/9. Linked List - Question #7 - M, N Reversals (Medium)/2. Coming Up With A Logical Solution.srt
22.5 KB
[TutsNode.com] - Master the Coding Interview Big Tech (FAANG) Interviews/9. Linked List - Question #7 - M, N Reversals (Medium)/3. Coding Our Solution.srt
