srrDB

754
Uploads today
89% Bitcoin logo
Completed daily pres
There is no glory in what used to be the 'scene' - download for fun, don't fuck with it. ―krazy8

NAVIGATION

INFORMATION

  • U: Anonymous
  • D: 2021-01-28 23:42:28
  • C: Unknown

RELEASE >

ReScene version pyReScene Auto 0.7 XQZT File size CRC
Download
42,353
Stored files
608 A64DFDD8
24,710 1BF02D24
810 5A8D728A
RAR-files
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.rar 250,000,000 B38E1945
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r00 250,000,000 B382301D
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r01 250,000,000 23C63BEE
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r02 250,000,000 60B72588
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r03 250,000,000 AAE6C3E4
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r04 250,000,000 28A4BC85
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r05 250,000,000 3023AF44
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r06 250,000,000 270E758F
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r07 250,000,000 5737F2E2
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt.r08 245,998,272 10E31FBF
Total size: 2,495,998,272
Archived files
01.01-course_introduction.mkv [435d4372deee17ff] 361,801,301 CD001CDA
01.02-curriculum_walkthrough.mkv [2ae9745ce4e097ae] 38,482,992 0796D5AF
02.01-section_introduction.mkv [4fbabcbae8354fc9] 2,598,392 41B2B7DE
02.02-complexity_analysis.mkv [126a7b74aaca6bf1] 17,599,472 0834B21C
02.03-why_we_need_big_o_notation.mkv [d13ec1fa397de4f0] 16,730,469 DC592F80
02.04-big_o(n)_complexity.mkv [8dbc64ef15b74525] 13,708,130 80697F8C
02.05-big_o(1)_complexity.mkv [7d4c7f0847367f6e] 6,365,127 1B9DDC0B
02.06-counting_operations.mkv [59f1a3b0afa9d1c2] 6,022,821 6ECE391F
02.07-simplifying_big_o-part_1.mkv [9648492136ebccfa] 13,502,781 CE97A525
02.08-big_o(n2)_complexity.mkv [10b85b76c8304fe1] 6,603,558 D9BA4FBE
02.09-simplifying_big_o-part_2.mkv [29ac846848cbeed] 4,832,197 FCAB4655
02.10-big_o(n)_complexity.mkv [69fdb2d9effa4b0b] 2,369,958 86D70817
02.11-space_complexity-part_1.mkv [67f781a1865aa97f] 14,183,852 EA0BC921
02.12-space_complexity-part_2.mkv [21d727197e032ef9] 5,428,853 74D2EC77
02.13-section_summary.mkv [2b94b201c800f5] 3,318,761 B5E4820B
03.01-memory.mkv [a80604d9673a969a] 18,912,233 23E3A693
03.02-logarithm.mkv [f35165d4f4b8da6e] 19,365,435 85BA761C
04.01-introduction_to_data_structures.mkv [1f15b4f1f9589121] 13,219,467 6EEAA6B9
05.01-array_introduction.mkv [8fdf9de9ace96803] 7,896,946 12A4222C
05.02-array-common_operations-part_1.mkv [96dd0c962bc7fbd8] 13,680,478 FB0830F7
05.03-array-common_operations-part_2.mkv [c0adc11a9446d21d] 14,619,833 902C15DF
05.04-static_versus_dynamic_array-common_operations-part_3.mkv [94cf2f948f1bc537] 12,860,391 65738949
06.01-linked_lists.mkv [2cd5ed16b82e1ade] 41,733,572 18E34DC1
06.02-linked_list_complexities.mkv [df3c7fdb58374a69] 31,788,472 D27704F3
06.03-doubly_linked_list.mkv [82ce79d7276aa019] 12,308,494 FE239BE2
06.04-circular_linked_list_and_implementing_a_linked_list.mkv [45a7f17777e28072] 35,445,855 C7A6862D
07.01-stack_and_queue.mkv [5f325e7f57b5dcb0] 40,098,425 556EA7A8
08.01-hash_tables.mkv [877e96cc06daf1c9] 53,581,690 0E982D88
09.01-trees-part_1.mkv [8cfa517485285a19] 31,850,672 48845C06
09.02-trees-part_2.mkv [e74dd610878fb52a] 8,747,332 A1E80320
09.03-binary_tree.mkv [426486d910858608] 24,966,256 73E3462D
09.04-binary_search_tree.mkv [c99d01ad93be20cd] 41,860,921 61EB6C7C
09.05-adelson-vekskii_landis_(avl)_trees_versus_red_black_trees.mkv [d24c28262da3da53] 14,649,317 C8C6C1CB
10.01-heaps.mkv [c9dd8c8812e2ffc7] 43,785,411 32DD9774
10.02-heap_sort_and_priority_queues.mkv [a4b8565616e2ae3e] 23,040,618 71299421
11.01-trie-i.mkv [b7bc8e222610a3c0] 19,656,663 D692D0E8
11.02-trie-ii.mkv [53711695a8cfa69c] 34,965,736 D5ED576C
11.03-why_are_tries_important.mkv [30eace2bfdc8e3ae] 5,930,930 FD1F184D
12.01-graphs.mkv [4829813910208afa] 63,833,839 83743CE7
13.01-what_is_recursion.mkv [5aec85c704e417d8] 11,380,358 77CA1B44
13.02-recursion_control_of_a_function-part_1.mkv [201bc38cbc3eee93] 10,628,868 EF7C6C02
13.03-recursion_tracing_tree-part_2.mkv [82f5ae94aa91d8ab] 26,678,633 E1F308A3
13.04-recursion_understanding_a_call_stack-part_3.mkv [2a63722b07cfa728] 22,929,212 3001B02D
13.05-recursion_tree_recursion-part_4.mkv [fc4a7b6798822950] 28,516,950 008C7A47
13.06-recursion_example-factorial_of_a_number.mkv [e69dee82e353e99b] 10,726,398 00797023
14.01-linear_search.mkv [ff9a8e7d03926773] 10,360,112 EDCF027B
14.02-binary_search.mkv [d1a5cbe687583fd3] 15,734,229 F37BAFA6
14.03-binary_search_complexity.mkv [625b82875fd615c0] 7,311,665 A2358480
14.04-implementing_binary_search-part_1.mkv [42ed0ea9bc69f3c4] 8,187,711 CC558A26
14.05-implementing_binary_search_implementation-recursion-part_2.mkv [fc1e47e32cc605e] 48,412,213 89E41538
15.01-sorting_algorithm-introduction.mkv [55bf86c36df6681c] 4,499,278 7BE5981A
15.02-bubble_sort.mkv [631a22507f553858] 6,809,819 2E51211F
15.03-bubble_sort_visualization.mkv [fd9f3fb5e58f8644] 3,247,482 FAB933DA
15.04-implementing_bubble_sort.mkv [632e51600e84bebc] 11,317,306 4EDA8E97
15.05-bubble_sort_complexity.mkv [6996b427d4e4ad4] 5,379,139 6EFCD9F0
15.06-selection_sort.mkv [f7ae56fed1a5fdb8] 6,177,331 0DA96752
15.07-selection_sort_visualization.mkv [d3664264832a6a4f] 4,539,844 41120E6E
15.08-implementing_selection_sort.mkv [de434403562c617b] 11,918,182 60751EAF
15.09-selection_sort_complexity.mkv [af0fde813a89d294] 5,009,529 91268717
15.10-insertion_sort.mkv [134c954d1d9f002a] 5,781,091 321FF536
15.11-implementing_insertion_sort.mkv [e0650f853fb5909a] 12,243,657 D547F10B
15.12-insertion_sort_complexity.mkv [5476f9ab9348b85c] 4,319,476 3694D728
15.13-performance_analysis.mkv [339bf86da48dbc1f] 6,357,304 E90BB95F
16.01-quick_sort.mkv [e8694cae40dc6628] 30,970,622 25F0CDB7
16.02-quick_sort_complexity.mkv [d7ebb5be4e82b300] 18,768,243 77627534
16.03-implementing_quicksort.mkv [e7decc9146696339] 18,215,726 E14DF5E3
16.04-merge_sort.mkv [d102d733f87999e2] 19,884,892 E47FB376
16.05-merge_sort_complexity.mkv [f2125a820f3a4f14] 8,515,451 09D70C9C
16.06-implementing_merge_sort.mkv [65fdfb5923d4f3f3] 38,459,726 1321783B
17.01-tree_traversal.mkv [330fb6bd994d2943] 26,938,791 453A817B
17.02-depth-first_search-(preorder_inorder_and_postorder).mkv [f0bd15969df853cb] 15,877,843 EF5B34C7
17.03-implementing_a_binary_tree.mkv [5b38ec78cf5c705c] 14,879,929 FA76DBDD
17.04-implementing_depth-first_search.mkv [8a9a9cb2eb09c32d] 37,606,115 02E50C8D
17.05-depth-first_search_complexity.mkv [7869052c06d91003] 6,074,025 949ECE8D
17.06-breadth-first_search-level_order.mkv [7ed8fdf97aa8bffb] 14,573,715 7BBD9EF1
17.07-implementing_breadth-first_search.mkv [a9dc875bdc53060b] 25,065,501 768F8B0F
17.08-breadth-first_search_complexity.mkv [88213a6c57c6a5e3] 3,856,909 D169C6B1
18.01-graph_traversal.mkv [11c785affb907ef8] 8,955,320 0F8D8C6E
18.02-implementing_graph_animation.mkv [ab9e9b95948ef56b] 12,708,844 3EAC6256
18.03-implementing_breadth-first_search.mkv [bcc83785a40df4e0] 25,540,380 5EB23CA3
18.04-implementing_depth-first_search.mkv [ce057a78c673a92f] 15,069,140 24D8D723
18.05-graph_traversal_complexity.mkv [37351cbe073405e3] 4,764,604 49B279F1
19.01-implementing_data_structures.mkv [5ecedfeab77c12e8] 17,120,571 5751E571
19.02-problem_solving_approach.mkv [714e33ccdf703fe] 28,052,606 671B943D
20.01-two_sum.mkv [d737d10c4c386cf5] 27,218,208 60ACD494
21.01-min_stacks.mkv [f534f48ae4f3d38a] 23,075,401 10DC2BBD
21.02-implementing_a_min_stack.mkv [f84d39e1ef55f108] 11,936,588 63A2FED0
22.01-max_stacks.mkv [1de57599bc83b480] 8,930,118 45CFA0AA
23.01-designing_a_linked_list-part_i.mkv [9013e94321abf845] 16,648,471 D863A7C5
23.02-designing_a_linked_list-part_2.mkv [716f6a1667d6e52b] 52,824,526 FBAD6069
23.03-designing_a_linked_list-part_3.mkv [6ef3d1040cdf5a3c] 20,770,450 71710F34
23.04-designing_a_linked_list-part_4.mkv [ed4f2eeb0064b63f] 27,251,922 4119E230
24.01-reversing_linked_list-i.mkv [8075a9fe1b22778e] 48,328,379 A13C2669
24.02-reversing_linked_list-ii.mkv [3f90a8f98f0f5751] 9,972,534 7A1A18B4
25.01-traversal_(preorder_inorder_and_postorder).mkv [18f2490413383d5a] 24,814,059 2A9B45AB
25.02-constructing_a_binary_tree_from_preorder_and_inorder_traversal-part_1.mkv [5bf31073730e6d92] 78,069,611 D30C5198
25.03-constructing_a_binary_tree_from_preorder_and_inorder_traversal-part_2.mkv [590a07b70046be04] 47,478,331 38ED46E8
26.01-invert_binary_tree-part_1.mkv [a163c160162ee74c] 43,828,230 EDD4005C
26.02-invert_binary_tree-part_2.mkv [f8f93e516f0f746] 22,324,103 EEBCBDF3
27.01-constructing_a_binary_search_tree_from_preorder_traversal-part_1.mkv [b6e2d36a81dcfb1b] 67,545,781 BCABEF37
27.02-constructing_a_binary_search_tree_from_preorder_traversal-part_2.mkv [962629a6e6679f3e] 2,549,348 BA95B25C
28.01-detect_capital.mkv [fc63b3011e1ca3cb] 31,576,894 939D09A2
29.01-reverse_strings.mkv [245b5d570364f03b] 28,944,022 A9764BAF
30.01-longest_palindromic_substring-part_1.mkv [1b5bed8c4534492b] 39,332,673 5BBD10C5
30.02-longest_palindromic_substring-part_2.mkv [828851fda409dc4c] 28,946,770 5DEA0529
31.01-thank_you_for_being_here.mkv [d6c853590e8488ee] 10,890,254 1FE830FA
9781801078504_Code.zip 20,448 A5CDF905
Total size: 2,495,989,511
Video files
Sample
packt.data.structures.and.algorithms.the.complete.masterclass-xqzt-sample.mkv 2,061,846 03C2641E
RAR Recovery
Not Present
Labels UNKNOWN
RSS | IRC | API | Wiki | Help | Contact | srrDB © 2011-2024 (1668)
Execution time: 0.0552 - Memory usage: 0.77MB
Design and development: srrDB Team
srrDB is an historical record of the warez scene. We do not offer illegal downloads nor links to these works. All meta data gets added by our awesome users. Photographs or pictures can be part of these historical records, deemed fair use (news reporting and research) and are only a part of the complete work, but copyrights are owned by their respective creators or right holders.