种子简介

种子名称： [CN] Python Foundation with Data Structures & Algorithms
文件类型： 视频
文件数目： 180个文件
文件大小： 25.42 GB
收录时间： 2023-10-10 18:24
已经下载： 3次
资源热度： 90
最近下载： 2024-6-8 11:32

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:c60126563d3d674fbadf4ee9c73761ebadf962dc&dn=[CN] Python Foundation with Data Structures & Algorithms 复制链接到迅雷、QQ旋风进行下载，或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[CN] Python Foundation with Data Structures & Algorithms.torrent

1. Recursion 1/1. intro to recursion.mp483.15MB

1. Recursion 1/10. First Index Of Number Code.mp4103.96MB

1. Recursion 1/11. Last Index Of Number.mp421.41MB

1. Recursion 1/12. Last Index Of Number Code.mp432.29MB

1. Recursion 1/2.Recurion and PMI.mp485.81MB

1. Recursion 1/3. Problem solving through Recursion.mp451.59MB

1. Recursion 1/4. Print first n natural number.mp4108.61MB

1. Recursion 1/5. Fibonacci number.mp492.13MB

1. Recursion 1/6. Python and Recursion.mp457.01MB

1. Recursion 1/7. Check if List is Sorted or not.mp489.94MB

1. Recursion 1/8. check If List Is Sorted Or Not 2.mp487.46MB

1. Recursion 1/9. First Index Of Number.mp440.19MB

10. Linked List 1/1. Intro to linked list.mp473.34MB

10. Linked List 1/10. Insert At ith Position Recursively (Code).mp462.69MB

10. Linked List 1/11. Complexity Of Insertion.mp447.02MB

10. Linked List 1/2. Linked list node.mp451.37MB

10. Linked List 1/3. Linked List input -1.mp4159.6MB

10. Linked List 1/4. Printer linked list.mp465.15MB

10. Linked List 1/5. Time Complexity Of Taking Input.mp449.72MB

10. Linked List 1/6. Linked List Input - 2.mp473.84MB

10. Linked List 1/7. insert At Ith Position - Iteratively.mp4121.85MB

10. Linked List 1/8. Insert At Ith Position Code - Iteratively.mp4127.14MB

10. Linked List 1/9. Insert At Ith Position - Recursively.mp4119.88MB

10. Linked List 1/AFTER 11 HINT Delete node (recursive).mp429.82MB

10. Linked List 1/after 6. HINT Print ith node.mp426.41MB

10. Linked List 1/after 7 hint Delete node.mp455.47MB

11. Linked List 2/1. Reverse LL - 1.mp498.28MB

11. Linked List 2/10. Merge Sort - LL.mp456.91MB

11. Linked List 2/11. Variations of linked list.mp467.46MB

11. Linked List 2/2. Reverse LL-1 Code.mp4112.7MB

11. Linked List 2/3. Time Complexity of Reverse LL.mp446.83MB

11. Linked List 2/4. Reverse LL - 2.mp493.21MB

11. Linked List 2/5. Reverse LL-2 Code.mp451.58MB

11. Linked List 2/6. Reverse LL-2 Code.mp482.41MB

11. Linked List 2/7. Reverse LL - Iteratively.mp481.9MB

11. Linked List 2/8. Mid Point Of Linked List.mp451.19MB

11. Linked List 2/9. Merge Two Sorted LL.mp459.23MB

12. Stack/1. intro to stack.mp437.45MB

12. Stack/10. Reverse Stack - Explain.mp463.26MB

12. Stack/11. Reverse Stack - Code.mp428.68MB

12. Stack/12. hint for Check redundant brackets.mp478.88MB

12. Stack/13 Hint Stock Span.mp4117.59MB

12. Stack/14. Hint Minimum bracket Reversal.mp448.04MB

12. Stack/2. Recursion Stack.mp420.36MB

12. Stack/3. Stack Using Array - Explain.mp449.17MB

12. Stack/4. Stack Using Array - Code.mp429.66MB

12. Stack/5. Stack Using LL.mp464.25MB

12. Stack/6. Stack Using LL - Code.mp442.57MB

12. Stack/7. Inbuillt Stacks and Queues.mp438.24MB

12. Stack/8. Balanced Paranthesis - Explain.mp449.64MB

12. Stack/9. Balanced Paranthesis - Code.mp453.72MB

13. Queue/1. Intro To Queues.mp445.74MB

13. Queue/2. Queue Using Array - Explain.mp443.31MB

13. Queue/3. Queue Using Array - Code.mp436.24MB

13. Queue/4. Queue Using LL - Explain.mp467.53MB

13. Queue/5. Queue Using LL - Code.mp445.13MB

13. Queue/6. Inbuilt Stacks and Queues.mp440.89MB

13. Queue/7. Queue Using Two Stacks.mp441.18MB

13. Queue/8. Queue Using Two- code Stacks.mp455.83MB

14. Binary tree 1/binary tree 1.mp41.22GB

15. Binary trees 2/Binary trees 2.mp41.59GB

16.BST 1/BST 1.mp4937.23MB

17. BST 2/BST 2.mp41.34GB

18. Generic trees/Generic trees.mp4865.26MB

19. Dictionaries Maps/Dictionaries.mp41.74GB

2. Recursion 2/1. Recursion With Strings.mp453.67MB

2. Recursion 2/2. Replace in pie.mp430.15MB

2. Recursion 2/3. Binary Search Using Recursion.mp475.35MB

2. Recursion 2/4. Merge sort.mp449.38MB

2. Recursion 2/5. Merge Sort -code.mp467.77MB

2. Recursion 2/6. Quick Sort.mp468.34MB

2. Recursion 2/7. Quick Sort Code.mp466.19MB

2. Recursion 2/8. Tower oh Hanoi.mp470.37MB

2. Recursion 2/9. Tower oh Hanoi Code.mp434.14MB

20. Priority Queue 1/1. Intro To Priority Queues.mp469.53MB

20. Priority Queue 1/10. Insert In Priority Queue(Code).mp483.86MB

20. Priority Queue 1/11. How To Implement Remove Minimum Function.mp451.43MB

20. Priority Queue 1/12. Remove Minimum From Priority Queue(Code).mp4115.7MB

20. Priority Queue 1/13. Testing Code Of Priority Queue.mp414.2MB

20. Priority Queue 1/2. Operations In Priority Queue.mp438.18MB

20. Priority Queue 1/3. Ways To Implement Priority Queue.mp4111.87MB

20. Priority Queue 1/4. intro to cbt.mp469.59MB

20. Priority Queue 1/5. Height Of CBT.mp470.34MB

20. Priority Queue 1/5. How To Store CBT.mp4102.27MB

20. Priority Queue 1/6. Heap Order Property.mp452.4MB

20. Priority Queue 1/7. How To Insert In Heap.mp440.16MB

20. Priority Queue 1/8. Remove Elements From Heap.mp4102.2MB

20. Priority Queue 1/9 .Implementation Of Priority Queue.mp443.54MB

21. Priority Queue 2/1. Heap Sort.mp441.82MB

21. Priority Queue 2/10. K Smallest Elements In List(Code).mp432.2MB

21. Priority Queue 2/2. Inplace Heap Sort - 1.mp486.45MB

21. Priority Queue 2/3. Inplace Heap Sort Process.mp465.78MB

21. Priority Queue 2/4. Inplace Heap Sort - 2.mp4144.19MB

21. Priority Queue 2/5. Build Heap In O(n).mp462.54MB

21. Priority Queue 2/6. Build Heap In O(n).mp475.41MB

21. Priority Queue 2/7. Inbuilt Min Heap.mp448.45MB

21. Priority Queue 2/8. Inbuilt Max Heap.mp472.81MB

21. Priority Queue 2/9. K Smallest Elements In List(Explain).mp471.88MB

22. huffman Coding/1. Intro To Huffman Coding.mp416.65MB

22. huffman Coding/10. Encoding Text.mp425.74MB

22. huffman Coding/11. Padding Encoding Text.mp477.4MB

22. huffman Coding/12. Convert Into Bytes.mp464.76MB

22. huffman Coding/13. Compressing File.mp454.63MB

22. huffman Coding/14. Decompressing Text.mp483.06MB

22. huffman Coding/15. Remove Padding.mp459.7MB

22. huffman Coding/16. Decoding Text.mp477.72MB

22. huffman Coding/17. Final Code.mp428.74MB

22. huffman Coding/2. Data Structures For Huffman Coding.mp434.66MB

22. huffman Coding/3. Data Structures For Huffman Coding.mp453.53MB

22. huffman Coding/4. Decompression In Huffman Coding.mp430.43MB

22. huffman Coding/5. Implementation Of Huffman Coding.mp442.3MB

22. huffman Coding/6. Making Frequency Dictionary.mp413.68MB

22. huffman Coding/7. Constructing Heap.mp459.36MB

22. huffman Coding/8. Constructing Binary Tree.mp441.01MB

22. huffman Coding/9. Build Codes.mp477.16MB

24. DP 1/DP 1.mp41.1GB

25. DP 2/DP 2.mp41.62GB

26. Backtracking/backtracking.mp4973.92MB

27. Graph 1/graph 1 part 1.mp41.69GB

27. Graph 1/graph 1 part 2.mp41.33GB

29. 2048 Project/2048 part 1/2048 part 1.mp4831MB

29. 2048 Project/2048 part 2/2048 part 2.mp4430.06MB

29. 2048 Project/2048 part 3/2048 part 3.mp41.1GB

3. OOPS 1/2. CLASSES AND OBJECTS.mp433.61MB

3. OOPS 1/3. Instance Attributes.mp484.29MB

3. OOPS 1/4. Init Method.mp474.51MB

3. OOPS 1/5. Instance Methods.mp456.42MB

3. OOPS 1/6. Fraction class.mp435.96MB

3. OOPS 1/7. Fraction class 2.mp495.26MB

3. OOPS 1/8. Fraction class 3.mp453.9MB

3. OOPS 1/9. Complex number class.mp420.26MB

4. OOPS 1/1. INTRO TO OOPS.mp473.08MB

4. OOPS 1/2. CLASSES AND OBJECTS.mp433.61MB

4. OOPS 1/3. INSTANCE ATTRIBUTES.mp464.78MB

4. OOPS 1/4.Class attributes and object attributes.mp436.53MB

4. OOPS 1/5. Self Parameter.mp439.44MB

4. OOPS 1/6. Static Method.mp423.39MB

4. OOPS 1/7. Init meathod.mp477.89MB

4. OOPS 1/8. Class methods.mp437.6MB

4. OOPS 1/9. Public and Private Access modifiers.mp452.42MB

5. OOPS 2/1. Inheritance.mp423.62MB

5. OOPS 2/10. Operator overloading.mp420.23MB

5. OOPS 2/2. Basics of inheritance.mp430.12MB

5. OOPS 2/3. Inheritance and private members.mp420.45MB

5. OOPS 2/4. Imheritance continue.mp411.07MB

5. OOPS 2/5. Polymorphism.mp425.57MB

5. OOPS 2/6. Protected data members.mp419.22MB

5. OOPS 2/7. Object class.mp411.94MB

5. OOPS 2/8. Multiple inheritance.mp427.59MB

5. OOPS 2/9. Method resolving order.mp431.79MB

6. OOPS 3/1. Abstract classes.mp416.3MB

6. OOPS 3/10. More about Finally.mp417.55MB

6. OOPS 3/2. Abstract Classes - Code.mp426.38MB

6. OOPS 3/3. Abstract classes - continue.mp413.64MB

6. OOPS 3/4. Error and exception.mp47.81MB

6. OOPS 3/5. Intro To Exception Handling.mp419.78MB

6. OOPS 3/6. Handling Multiple Exceptions.mp48.54MB

6. OOPS 3/7.Custom Exception.mp422.15MB

6. OOPS 3/8. Except Functionality.mp417.99MB

6. OOPS 3/9. Else and finally.mp415.44MB

7. Time Complexity Analysis/1. Complexity analysis.mp412.68MB

7. Time Complexity Analysis/2. Experimentl analysis.mp457.79MB

7. Time Complexity Analysis/3. Theoretical Analysis.mp451.33MB

7. Time Complexity Analysis/4. Big O notation.mp455.6MB

7. Time Complexity Analysis/6. Theoretical Analysis - Recursive.mp420.7MB

7. Time Complexity Analysis/7. Theoretical Analysis -- Binary Search.mp438.86MB

7. Time Complexity Analysis/8. Merge Sort Time complexity.mp443.51MB

7. Time Complexity Analysis/9. Fibonacci Time Complexity Analysis.mp434.52MB

8. Space complexity analysis/1. Space complexity.mp445.19MB

8. Space complexity analysis/2. More Examples Of Space Complexity.mp429.15MB

8. Space complexity analysis/3. Merge Sort Space Complexity Analysis.mp423.01MB

8. Space complexity analysis/4. Analysis Of Quick Sort.mp459.41MB

9. Time Complexity Improvement/1. Power Intro.mp436.98MB

9. Time Complexity Improvement/2. Power Solution.mp438.75MB

9. Time Complexity Improvement/3. Array intersection Intro.mp450.22MB

9. Time Complexity Improvement/4. Array intersection Optimal Solution.mp443.01MB

9. Time Complexity Improvement/5. Equilibrium Index Intro.mp423.48MB

9. Time Complexity Improvement/6. Equilibrium Index Optimal Solution.mp468.8MB

9. Time Complexity Improvement/assignment hint 1.mp424.39MB

9. Time Complexity Improvement/rest all remaining assignment help.mp481.84MB