种子简介
种子名称:
[FreeCourseSite.com] Udemy - Data Structures and Algorithms in C++ For Coding Interview
文件类型:
视频
文件数目:
57个文件
文件大小:
792.65 MB
收录时间:
2018-12-6 09:55
已经下载:
3次
资源热度:
303
最近下载:
2024-12-23 07:35
下载BT种子文件
下载Torrent文件(.torrent)
立即下载
磁力链接下载
magnet:?xt=urn:btih:0066d539c2e437f8832411ae847fce4c359ced82&dn=[FreeCourseSite.com] Udemy - Data Structures and Algorithms in C++ For Coding Interview
复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。
喜欢这个种子的人也喜欢
种子包含的文件
[FreeCourseSite.com] Udemy - Data Structures and Algorithms in C++ For Coding Interview.torrent
Lesson 1. Introduction to Course.mp48.48MB
Lesson 10. O(n) Solution Implementation.mp413.64MB
Lesson 11. Problem Statement.mp44.37MB
Lesson 12. O(n^3) Naive Solution.mp411.49MB
Lesson 13. O(nlogn) Improved Solution.mp416.15MB
Lesson 14. Implementation of O(nlogn) solution.mp412.5MB
Lesson 15. Optimizing further and reaching O(n) Solution.mp428.24MB
Lesson 16. Implementation of O(n) Solution.mp418.28MB
Lesson 17. Problem Statement.mp45.46MB
Lesson 18. Incorrect ApproachesAlgorithms to the Problem.mp49.86MB
Lesson 19. Recursive Algorithm Solution That runs in O(n^2) Time.mp432.11MB
Lesson 2. Two Sum problem Statement and O(n^2) Solution.mp414.64MB
Lesson 20. Implementation of O(n^2) Recursive Algorithm.mp47.33MB
Lesson 21. Optimizing further With Stacks to get O(n) Solution Idea.mp415.36MB
Lesson 22. O(n) Solution Implementation.mp415.25MB
Lesson 23. Problem Statement and Example.mp413.24MB
Lesson 24. Naive O(n^2) Solution with additional boolean array.mp425.14MB
Lesson 25. Implementation of O(n^2) Solution.mp438.63MB
Lesson 26. Optimizing on the last algorithm to an O(n) Solution.mp422.75MB
Lesson 27. Implementation of O(n) Solution.mp415.43MB
Lesson 28. Problem Statement.mp46.32MB
Lesson 29. Bruteforce Algorithm Idea O(nk) Solution.mp415.61MB
Lesson 3. Implementation of O(n^2) naive solution.mp47.66MB
Lesson 30. Bruteforce Implementation and Time Limit Exceeded.mp414.27MB
Lesson 31. Optimizing Using Hashmaps to get O(n) Solution on average.mp424.48MB
Lesson 32. Implementing the O(n) Solution.mp49.42MB
Lesson 33. Problem Statement.mp47.91MB
Lesson 34. O(n!) Brute force Solution.mp49.87MB
Lesson 35. O(n^2) Solution idea for Valid anagram.mp422.16MB
Lesson 36. O(n^2) Solution Implementation.mp419.6MB
Lesson 37. O(nlogn) Solution by Optimizing bottleneck.mp410.17MB
Lesson 38. O(nlogn) Solution Implementation.mp48.74MB
Lesson 39. O(n) Solution Idea, The final optimization with Hashtable.mp414.74MB
Lesson 4. Optimizing Further for O(nlogn) Solution.mp419.8MB
Lesson 40. O(n) Solution Implementation.mp420.32MB
Lesson 41. Problem Statement.mp42.18MB
Lesson 42. O(nlogn) Naive Solution Idea.mp47.04MB
Lesson 43. O(nlogn) Naive Solution Implementation.mp43.03MB
Lesson 44. O(nlogk) Optimized Solution Using a Heap.mp422.67MB
Lesson 45. Implementation of O(nlogk) Heap Solution.mp47.03MB
Lesson 46. Problem Statement.mp44.22MB
Lesson 47. Idea of O(n^2Logn) Naive Solution and O(n^2logk) Optimized Solution using Heap.mp426.98MB
Lesson 48. Implementation of O(n^2Logn) and O(n^2Logk) Solutions.mp446.63MB
Lesson 49. Problem Statement.mp42.75MB
Lesson 5. Implementing the O(nlogn) Solution.mp424.79MB
Lesson 50. O(n) Recursive Solution Idea.mp415.96MB
Lesson 51. O(n) Solution implementation.mp43.43MB
Lesson 52. Problem Statement.mp42.73MB
Lesson 53. O(n) Recursive Solution Idea.mp413.27MB
Lesson 54. O(n) Solution Implementation.mp46.94MB
Lesson 55. Problem Statement.mp43.49MB
Lesson 56. O(n) Recursive Solution Idea.mp410.95MB
Lesson 57. O(n) Solution Implementation.mp45.08MB
Lesson 6. Problem Statement.mp43.66MB
Lesson 7. O(n^2) Naive Solution.mp412.21MB
Lesson 8. O(n^2) Naive Solution Implementation.mp410.73MB
Lesson 9. O(n) Solution idea and optimizations.mp417.47MB