UdemyCourseDownloader-Da-1TaC8
02. Introduction to algorithms\\/10. Rate of growth.mp472.64MB
01. Introduction\\/1. Welcome to the course.mp48.50MB
01. Introduction\\/2. A quick note.mp418.18MB
01. Introduction\\/3. What are data structures.mp418.10MB
02. Introduction to algorithms\\/1. 1.Introduction.mp421.53MB
02. Introduction to algorithms\\/2. Characteristics of an algorithm.mp424.20MB
02. Introduction to algorithms\\/3. Why to analyse an algorithm.mp430.00MB
02. Introduction to algorithms\\/4. What is O(1) constant time.mp425.77MB
02. Introduction to algorithms\\/5. What is O(n) linear time.mp437.18MB
02. Introduction to algorithms\\/6. What is O(log n) logarithmic time.mp413.13MB
02. Introduction to algorithms\\/7. What is O(n^2) quadratic time.mp419.92MB
02. Introduction to algorithms\\/8. What is O(n^3) cubic time.mp415.99MB
02. Introduction to algorithms\\/9. Best caseworst case and erage case of an algorithm.mp445.99MB
03. Recursion\\/1. Introduction to recursion.mp458.84MB
03. Recursion\\/2. Recursion example 1- factorial of a given number.mp450.56MB
04. Arrays\\/1. A breif about PHP arrays.mp441.12MB
04. Arrays\\/2. SplFixedArray in PHP.mp426.47MB
05. Problems on arrays\\/1. 1.Sum of the array - Two pointer approach.mp48.62MB
05. Problems on arrays\\/2. 2.Sum of ximum sub array - Naive approach.mp424.92MB
05. Problems on arrays\\/3. 3.Sum of ximum sub array - Kadanes algorithm.mp421.70MB
06. to li<x>nked list.mp45.70MB
06. li<x>nked list\\/2. 2.Why to use li<x>nked list.mp413.35MB
06. li<x>nked list\\/3. Implementing li<x>nked list.mp45.66MB
06. li<x>nked list\\/4. Inserting an element to the li<x>nked list.mp430.92MB
06. li<x>nked list\\/5. Inserting at front of the list.mp436.87MB
06. li<x>nked list\\/6. Inserting at given position.mp431.09MB
06. li<x>nked list\\/7. Displaying the elements of the list.mp416.06MB
06. li<x>nked list\\/8. Deleting the head node.mp430.90MB
06. li<x>nked list\\/9. Deleting the last node.mp419.70MB
06. li<x>nked list\\/10. Deleting the given node.mp420.50MB
07. Doubly li<x>nked list\\/1. Introduction to doubly li<x>nked list.mp416.89MB
07. Doubly li<x>nked list\\/2. ba<x>se condition for doubly li<x>nked list operations.mp44.75MB
07. Doubly li<x>nked list\\/3. Inserting the element at front.mp434.73MB
07. Doubly li<x>nked list\\/4. Inserting at given position.mp442.59MB
07. Doubly li<x>nked list\\/5. Insert at last.mp46.06MB
07. Doubly li<x>nked list\\/6. Deleting the head node.mp415.52MB
07. Doubly li<x>nked list\\/7. Deleting the tail node.mp424.23MB
07. Doubly li<x>nked list\\/8. Deleting the given node.mp422.66MB
08. Circular li<x>nked list\\/1. Introduction to circular li<x>nked list.mp411.17MB
08. Circular li<x>nked list\\/2. Inserting at front of the circular list.mp435.81MB
08. Circular li<x>nked list\\/3. Inserting at last of the circular list.mp419.69MB
08. Circular li<x>nked list\\/4. Inserting at given position in the circular list.mp420.69MB
08. Circular li<x>nked list\\/5. Deleting the first node of the circular list.mp415.63MB
08. Circular li<x>nked list\\/6. Deleting the last node of the circular list.mp415.60MB
09. Problems on li<x>nked list\\/1. 1.Printing the elements of the li<x>nked list using recursion.mp420.65MB
09. Problems on li<x>nked list\\/2. 2.Reversing the li<x>nked list - Iterative approach.mp420.15MB
09. Problems on li<x>nked list\\/3. 4.1.Removing duplicates in unsorted li<x>nked list.mp434.92MB
09. Problems on li<x>nked list\\/4. 4.2. Removing duplicates in sorted li<x>nked list.mp411.65MB
09. Problems on li<x>nked list\\/5. 5.Detecting cycle in the li<x>nked list - Approach 1.mp435.43MB
09. Problems on li<x>nked list\\/6. 6.Detecting cycle in the li<x>nked list - Approach 2.mp430.02MB
10. Stacks\\/1. Introduction to Stack.mp47.33MB
10. Stacks\\/2. Implementing stack using array.mp441.19MB
10. Stacks\\/3. Implementing stack using li<x>nked list.mp435.77MB
11. Queues\\/1. Introduction to queue.mp44.29MB
11. Queues\\/2. Implementing queue using array.mp430.76MB
11. Queues\\/3. Implementing queue using li<x>nked list.mp417.75MB
12. Problems on stacks and queues\\/1. ex<x>pression evaluation.mp447.93MB
12. Problems on stacks and queues\\/2. Implement queue using stack.mp438.64MB
13. Next steps\\/1. Introduction to non-linear data structures.mp413.79MB
13. Next steps\\/2. Goodbye.mp43.86MB
- CreateTime2023-04-25
- UpdateTime2023-05-10
- FileTotalCount165
- TotalSize2.88GBHotTimes5ViewTimes10DMCA Report EmailmagnetLinkThunderTorrent DownBaiduYunLatest Search: 1.WED-044 2.MIBD-671 3.ALD-313 4.SVS-031 5.EMAZ-159 6.HODV-20874 7.PUD-03 8.DDK-09 9.EBOD-186 10.MSYG-005 11.CVDX-111 12.HERG-002 13.EMAZ-219 14.ONSD-456 15.MAMA-226 16.VSED-03 17.VNDS-2523 18.MDYD-735 19.IDBD-259 20.MIBD-572 21.TYWD-030 22.PSSD-202 23.DVDES-208 24.LHTG-006 25.ONSD-541 26.SOE-001 27.RKI-220 28.PSSD-240 29.GOD-137 30.MD-16 31.JUSD-365 32.TBKR-002 33.JUSD-364 34.LEZX-004 35.DVAA-098 36.AMG-003 37.IE-199 38.MIBD-461 39.MIBD-430 40.ONSD-736 41.IDBD-341 42.NWF-222 43.MVBD-042 44.DIV-128 45.CWM-096 46.DIV-116 47.IDOL-098 48.MIBD-653 49.MIBD-752 50.AAJB-008 51.DIV-145 52.JUC-844 53.AGR-06 54.RKI-261 55.HFD-087 56.EMCW-004 57.UURU-05 58.DJNE-75 59.GG-232 60.SBVD-0155 61.HYAZ-019 62.SD-627 63.AKA-019 64.GFOV-001 65.TTTB-129 66.HUNT-575 67.IBW-139 68.A-200011 69.USV-027 70.IMG-252 71.044 72.671 73.313 74.031 75.159 76.20874 77.03 78.09 79.186 80.005 81.111 82.002 83.219 84.456 85.226 86.03 87.2523 88.735 89.259 90.572 91.030 92.202 93.208 94.006 95.541 96.001 97.220 98.240 99.137 100.16 101.365 102.002 103.3 104.004 105.098 106.003 107.199 108.461 109.430 110.736 111.341 112.222 113.042 114.128 115.096 116.116 117.098 118.653 119.752 120.008 121.145 122.844 123.06 124.261 125.087 126.004 127.05 128.75 129.232 130.0155 131.019 132.627 133.019 134.001 135.129 136.575 137.139 138.200011 139.027 140.252