Archived
files |
01-Introduction\01-welcome_to_the_course.mp4
[fd3973c1523a0e5e]
|
52,362,073 |
394BCB5F |
01-Introduction\02-full_course_resources_instructions.html |
1,460 |
E6FE8771 |
01-Introduction\03-course_structure.mp4
[964d565333e6e626]
|
60,083,816 |
36D01FEB |
01-Introduction\04-dsa_the_what_why.mp4
[5f83e7582d4baa47]
|
84,268,678 |
E536A146 |
01-Introduction\05-tools_basic_setup.mp4
[a6a592d856945491]
|
60,993,833 |
6258BC37 |
01-Introduction\06-sandbox_environment_setup.mp4
[520beec5c3609db4]
|
48,750,138 |
4B98C96A |
02-Basic_Challenges_Part_1\01-hello_world_starter_challenge.mp4
[83e20520c139ece8]
|
14,726,947 |
E278FA4C |
02-Basic_Challenges_Part_1\02-get_sum_starter_challenge.mp4
[32226bb781093a5a]
|
16,125,328 |
38F49BFE |
02-Basic_Challenges_Part_1\03-calculator.mp4
[d683a81227e911d1]
|
49,087,626 |
8E870441 |
02-Basic_Challenges_Part_1\04-count_occurrences.mp4
[625b660be5d2124a]
|
62,203,397 |
DDAA1EB9 |
02-Basic_Challenges_Part_1\05-find_max_number.mp4
[2441c2a5f6b6a4f7]
|
29,927,228 |
5957933E |
02-Basic_Challenges_Part_1\06-title_case.mp4
[395bb321437688b4]
|
43,096,228 |
10C2BA57 |
02-Basic_Challenges_Part_1\07-reverse_string.mp4
[d890f852e4b0b1d]
|
58,246,081 |
C283774E |
02-Basic_Challenges_Part_1\08-palindrome.mp4
[2a34bc9247b19ab0]
|
140,332,046 |
F254E9F0 |
02-Basic_Challenges_Part_1\09-count_vowels.mp4
[f7c227c4a522814b]
|
24,544,252 |
23FB1959 |
02-Basic_Challenges_Part_1\10-remove_duplicates.mp4
[688ec71203d70546]
|
45,185,935 |
1A0F135E |
03-Basic_Challenges_Part_2\01-fizzbuzz_array.mp4
[a8be5d6af7e53d8e]
|
46,794,376 |
2BB3115D |
03-Basic_Challenges_Part_2\02-array_intersection.mp4
[387ee8ec24eabc8f]
|
51,171,149 |
790B43C6 |
03-Basic_Challenges_Part_2\03-display_likes.mp4
[4379518a061ae077]
|
42,245,466 |
7F2BCD13 |
03-Basic_Challenges_Part_2\04-find_missing_number.mp4
[157464873b4a6e88]
|
53,462,949 |
92AA7C89 |
03-Basic_Challenges_Part_2\05-find_missing_letter.mp4
[c8062f261577e71e]
|
68,956,872 |
81E4A4BF |
03-Basic_Challenges_Part_2\06-are_all_chars_unique.mp4
[83f43ce7e8cd8273]
|
62,662,741 |
6A6CF89F |
03-Basic_Challenges_Part_2\07-first_non_repeating_character.mp4
[b4e93797fe40a424]
|
83,343,072 |
406163B1 |
03-Basic_Challenges_Part_2\08-dice_game_simulation.mp4
[6fcd0f97b9340811]
|
56,650,992 |
6061820D |
03-Basic_Challenges_Part_2\09-format_phone_number.mp4
[b3e325c0d510139a]
|
84,367,919 |
8B82D3D4 |
03-Basic_Challenges_Part_2\10-validate_email.mp4
[eb8224042a36128f]
|
80,905,722 |
B29D6521 |
04-Higher_Order_Array_Methods\01-simple_examples.mp4
[77d553fb20825f62]
|
123,504,666 |
88B05256 |
04-Higher_Order_Array_Methods\02-sum_of_even_squares.mp4
[60880fb05244f2dd]
|
41,671,135 |
A552130C |
04-Higher_Order_Array_Methods\03-calculate_total_sales.mp4
[24ab10da059fecf]
|
54,485,524 |
2FD2A468 |
04-Higher_Order_Array_Methods\04-highest_scoring_word.mp4
[5817a58173d15ea0]
|
98,831,147 |
504A3718 |
04-Higher_Order_Array_Methods\05-valid_anagrams.mp4
[f0f9c93cf4b371f5]
|
63,216,883 |
D46D3B40 |
04-Higher_Order_Array_Methods\06-hashtag_generator.mp4
[a62d9321755e5aa9]
|
96,643,710 |
6EF71533 |
04-Higher_Order_Array_Methods\07-valid_ipv4.mp4
[f5647e1dea9465ff]
|
39,846,090 |
4692B26D |
04-Higher_Order_Array_Methods\08-analyze_car_mileage.mp4
[b44a84ccafe6f999]
|
76,317,165 |
48A3C2D5 |
04-Higher_Order_Array_Methods\09-password_validator.mp4
[9c14728e4de39cfa]
|
59,372,436 |
075E985C |
04-Higher_Order_Array_Methods\10-find_missing_letter_refactor.mp4
[3d30ac917fe2c83c]
|
99,768,801 |
6AAFFCB1 |
05-Recursion\01-recursion_intro_countdown.mp4
[7ad2773af720ce52]
|
40,652,382 |
6F30DF3B |
05-Recursion\02-recursive_unwinding.mp4
[4797321f46cd8922]
|
36,048,342 |
C89B7303 |
05-Recursion\03-reverse_string_using_recursion.mp4
[51ee7a63620bd58c]
|
64,513,060 |
27A584D9 |
05-Recursion\04-fibonacci_sequence.mp4
[db815bff9f4a1700]
|
79,766,715 |
450C944D |
05-Recursion\05-factorial.mp4
[2d6efdc572f40bab]
|
39,224,251 |
A96D5867 |
05-Recursion\06-power.mp4
[333de7ad1586cadc]
|
44,157,966 |
E3A1C03E |
05-Recursion\07-array_sum.mp4
[2439ffe65ef917c6]
|
48,260,970 |
9E6F19B2 |
05-Recursion\08-number_range.mp4
[74ddfcfffa4c8226]
|
40,240,168 |
7D6E3399 |
05-Recursion\09-flatten_array.mp4
[42eee3e77c36a4ba]
|
31,949,712 |
755DF1A5 |
05-Recursion\10-permutations.mp4
[6aaf96d2926efed0]
|
60,919,917 |
646EB4E2 |
06-Time_And_Space_Complexity\01-what_is_time_complexity.mp4
[9b05f8f36bdd6e2a]
|
26,296,584 |
12931FC9 |
06-Time_And_Space_Complexity\02-big_o_notation.mp4
[f6f59254953b170f]
|
27,941,393 |
0BA8AFF3 |
06-Time_And_Space_Complexity\03-constant_time_complexity_o_1.mp4
[7d6727cc3e7e13f0]
|
44,119,784 |
6BF5BB40 |
06-Time_And_Space_Complexity\04-linear_time_complexity_o_n.mp4
[ba98556bbd9cc4c7]
|
43,958,877 |
650E8641 |
06-Time_And_Space_Complexity\05-quadratic_time_complexity_o_n_2.mp4
[8cee3fae38fbfd88]
|
35,294,461 |
1FEB92EC |
06-Time_And_Space_Complexity\06-logarithmic_time_complexity_o_log_n.mp4
[b1ae6bd10a1c7ac8]
|
40,429,483 |
8230B62C |
06-Time_And_Space_Complexity\07-space_complexity.mp4
[275f08b008843ea2]
|
42,739,269 |
1B7C0541 |
06-Time_And_Space_Complexity\08-max_subarray_quadratic.mp4
[2ca12dfc593d24bc]
|
69,454,071 |
05CF11B4 |
06-Time_And_Space_Complexity\09-sliding_window_technique.mp4
[2a518f6228b38d89]
|
14,369,015 |
A7E0B099 |
06-Time_And_Space_Complexity\10-max_subarray_linear.mp4
[8802be7790310804]
|
57,840,165 |
051D0130 |
07-Hash_Tables_Maps_And_Sets\01-hash_table_intro.mp4
[3d132902460f20ed]
|
15,833,228 |
E98F2B67 |
07-Hash_Tables_Maps_And_Sets\02-maps.mp4
[691d0f2f47fa1201]
|
79,563,155 |
65D25109 |
07-Hash_Tables_Maps_And_Sets\03-word_frequency_counter.mp4
[8a67a606587e8c92]
|
49,298,503 |
D8DFA9CA |
07-Hash_Tables_Maps_And_Sets\04-phone_number_directory.mp4
[9478b9fcd963ca7e]
|
23,538,871 |
2A3E9D51 |
07-Hash_Tables_Maps_And_Sets\05-anagram_grouping.mp4
[78b87e677c9e9d]
|
48,100,749 |
B0B5D851 |
07-Hash_Tables_Maps_And_Sets\06-sets.mp4
[9bb9eaf8ef46264f]
|
42,354,167 |
57C095FE |
07-Hash_Tables_Maps_And_Sets\07-symmetric_difference.mp4
[8ac208a4f8ce085b]
|
42,444,081 |
7C66177B |
07-Hash_Tables_Maps_And_Sets\08-two_sum.mp4
[f7c00142c39679cb]
|
45,272,870 |
23F3BD51 |
07-Hash_Tables_Maps_And_Sets\09-longest_consecutive.mp4
[aa9a684d1cf72136]
|
55,136,510 |
3021182E |
07-Hash_Tables_Maps_And_Sets\10-custom_hash_table_part_1.mp4
[f58d87b38234b97a]
|
160,175,922 |
63935B6E |
07-Hash_Tables_Maps_And_Sets\11-custom_hash_table_part_2.mp4
[54322d49c1e4bed9]
|
109,939,811 |
DB974E32 |
07-Hash_Tables_Maps_And_Sets\12-word_instance_counter_using_custom_hash_table.mp4
[6ae5fe0a64b3159d]
|
50,872,338 |
4E4130F8 |
07-Hash_Tables_Maps_And_Sets\13-add_getvalues_method.mp4
[b811a3f8bab05953]
|
30,162,012 |
6A88C92B |
07-Hash_Tables_Maps_And_Sets\14-anagram_grouping_with_custom_hash_table.mp4
[b5fd564c5e756eaa]
|
52,181,604 |
DF3D6443 |
08-Stacks_Queues_And_Linked_Lists\01-what_is_a_stack.mp4
[f94987a8ee3011b0]
|
7,272,703 |
259F985E |
08-Stacks_Queues_And_Linked_Lists\02-stack_implementation.mp4
[aac03ff770dd29a6]
|
88,270,768 |
44B32B90 |
08-Stacks_Queues_And_Linked_Lists\03-reverse_string_using_a_stack.mp4
[8e334ff1db5bae93]
|
34,572,706 |
5E851ADE |
08-Stacks_Queues_And_Linked_Lists\04-balanced_parenthesis.mp4
[f05be1d8f428b636]
|
38,794,403 |
33C947A0 |
08-Stacks_Queues_And_Linked_Lists\05-what_is_a_queue.mp4
[12cf4888049801d9]
|
6,864,360 |
6149DC01 |
08-Stacks_Queues_And_Linked_Lists\06-queue_implementation.mp4
[6b5a5f74a3d0d122]
|
64,148,699 |
51D88B0F |
08-Stacks_Queues_And_Linked_Lists\07-reverse_string_with_a_queue.mp4
[31990ffb171c253f]
|
38,447,579 |
18D37A92 |
08-Stacks_Queues_And_Linked_Lists\08-palindrome_with_a_queue_stack.mp4
[a5c7e08c68d7c0af]
|
71,029,962 |
87E651B4 |
08-Stacks_Queues_And_Linked_Lists\09-what_is_a_linked_list.mp4
[9a09ba314c9145d]
|
18,807,134 |
35A0824B |
08-Stacks_Queues_And_Linked_Lists\10-linked_list_implementation.mp4
[d9cc9526882f7da3]
|
126,214,569 |
EC4572E1 |
08-Stacks_Queues_And_Linked_Lists\11-reverse_string_with_a_linked_list.mp4
[e0c937426ebaa2fa]
|
36,566,290 |
4D56DC08 |
08-Stacks_Queues_And_Linked_Lists\12-fast_slow_pointers.mp4
[19eba60d241a7be6]
|
47,106,731 |
B9AF61CD |
08-Stacks_Queues_And_Linked_Lists\13-find_middle.mp4
[4b5665f5c77c6f18]
|
62,003,321 |
E35D792D |
08-Stacks_Queues_And_Linked_Lists\14-what_is_a_doubly_linked_list.mp4
[b85be3e1e1d81c85]
|
14,863,242 |
521FADB3 |
08-Stacks_Queues_And_Linked_Lists\15-doubly_linked_list_implementation_part_1.mp4
[c3a9c942e709888b]
|
141,221,404 |
BF8E9D8D |
08-Stacks_Queues_And_Linked_Lists\16-doubly_linked_list_implementation_part_2.mp4
[db42a8660f24a69c]
|
98,519,992 |
947E1F36 |
08-Stacks_Queues_And_Linked_Lists\17-find_pair_sum.mp4
[6a0d444daedc79b3]
|
35,637,001 |
C2D12B13 |
09-Binary_Trees_Bst_And_Graphs\01-what_is_a_tree_binary_tree.mp4
[da3da3f5e8b551f2]
|
27,597,839 |
5F1C30A5 |
09-Binary_Trees_Bst_And_Graphs\02-tree_node_class.mp4
[7585b6227d267d00]
|
40,277,145 |
A7F57AC6 |
09-Binary_Trees_Bst_And_Graphs\03-depth_first_traversal.mp4
[8368d795ebf9b940]
|
112,444,288 |
734A0DD6 |
09-Binary_Trees_Bst_And_Graphs\04-depth_first_traversal_using_recursion.mp4
[6e26a007ee5d28c3]
|
37,623,974 |
D39F4DE0 |
09-Binary_Trees_Bst_And_Graphs\05-breadth_first_traversal.mp4
[dd026671c3d2e26f]
|
72,096,327 |
3D48E9B3 |
09-Binary_Trees_Bst_And_Graphs\06-maximum_depth.mp4
[b98f368d21769d7]
|
59,162,651 |
A5A84EF1 |
09-Binary_Trees_Bst_And_Graphs\07-what_is_a_binary_search_tree.mp4
[fc177a400c17d2e9]
|
34,224,695 |
D92B6399 |
09-Binary_Trees_Bst_And_Graphs\08-binary_search_tree_implementation_part_1.mp4
[f402ff44259235c]
|
91,270,946 |
AD08E67F |
09-Binary_Trees_Bst_And_Graphs\09-binary_search_tree_implementation_part_2.mp4
[13670456a25f13a4]
|
128,203,922 |
7B96FBF2 |
09-Binary_Trees_Bst_And_Graphs\10-validate_bst.mp4
[404ae970573c0a83]
|
97,225,685 |
BDBB3F66 |
09-Binary_Trees_Bst_And_Graphs\11-what_is_a_graph.mp4
[7730c62a5aa7ba15]
|
17,773,749 |
724A4413 |
09-Binary_Trees_Bst_And_Graphs\12-adjacency_matrix_adjacency_list.mp4
[14e1fd17d5a003d3]
|
13,815,911 |
73E5496B |
09-Binary_Trees_Bst_And_Graphs\13-graph_implementation.mp4
[f191da9ef8575d22]
|
97,773,183 |
15287178 |
09-Binary_Trees_Bst_And_Graphs\14-graph_traversal_visualization.mp4
[9b2f06193cc0dd12]
|
15,345,964 |
C6CD81AE |
09-Binary_Trees_Bst_And_Graphs\15-graph_depth_first_traversal.mp4
[8c2f72d474f9ab4e]
|
85,683,013 |
70D88422 |
09-Binary_Trees_Bst_And_Graphs\16-graph_breadth_first_traversal.mp4
[a0f2e042c64cfa61]
|
54,754,578 |
A96EAD4C |
10-Sorting_Algorithms\01-what_are_sorting_algorithms.mp4
[584d3a609955a066]
|
13,446,196 |
8600049A |
10-Sorting_Algorithms\02-bubble_sort_algorithm.mp4
[7a314d5186e46fcd]
|
9,139,010 |
DE12F612 |
10-Sorting_Algorithms\03-bubble_sort_implementation.mp4
[5ff8887ca1cee46f]
|
70,891,812 |
091FD8CA |
10-Sorting_Algorithms\04-insertion_sort_algorithm.mp4
[6cd42d9a67a3d903]
|
8,983,953 |
59BAA846 |
10-Sorting_Algorithms\05-insertion_sort_implementation.mp4
[c3ac96cc806e8cc9]
|
51,039,561 |
158E767E |
10-Sorting_Algorithms\06-selection_sort_algorithm.mp4
[2ba3a07798f07cea]
|
16,269,182 |
5B485E11 |
10-Sorting_Algorithms\07-selection_sort_implementation.mp4
[c6c9b205ecff052d]
|
54,485,642 |
97E4C86B |
10-Sorting_Algorithms\08-merge_sort_algorithm.mp4
[83a5895f20ce2c03]
|
8,295,346 |
4676025F |
10-Sorting_Algorithms\09-merge_sort_implementation.mp4
[fc7b75576c2060ed]
|
73,909,887 |
8D15FD4E |
10-Sorting_Algorithms\10-quick_sort_algorithm.mp4
[bab7c781092e76ba]
|
13,216,107 |
8A053016 |
10-Sorting_Algorithms\11-quick_sort_implementation.mp4
[8aea5e16f41b31d8]
|
47,229,910 |
774B0E69 |
11-Wrap_Up\01-wrap_up.mp4
[a6641810dabaa70c]
|
24,412,257 |
A0969E74 |
LERNSTUF\lernstuf.nfo |
1,819 |
F3BC8590 |
LERNSTUF\lernstuf_introduction_2025.rar |
662,425 |
D97798A6 |
|
Total size: |
6,174,802,128 |
|
|