|
Обратите внимание, что наш сайт не размещает какие-либо файлы из списка. Вы не можете скачать
эти файлы или скачать torrent-файл.
|
| _120e875d62d8c0bc18a11e21fd818465_Programming-Assignment-3.pdf |
387.88Кб |
| _232418a57c83ad19339c24a22a56b9b1_Programming-Assignment-1.pdf |
482.81Кб |
| _286667e9d63065155e489921cf80602d_ProgrammingAssignment1.pdf |
369.74Кб |
| _332adc34d317de0b0cc790581a52df01_Programming-Assignment-2.pdf |
442.28Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_1_1_introduction.pdf |
158.88Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_1_2_LP.pdf |
187.11Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_2_1_Substitution.pdf |
130.25Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_2_2_GaussianElimination.pdf |
178.56Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_2_GaussianElimination.pdf |
235.85Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_3_Convexity.pdf |
322.29Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_4_1_Duality.pdf |
203.39Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_4_2_DualityProofs.pdf |
219.06Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_5_Formulations.pdf |
455.88Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_6_simplex.pdf |
257.14Кб |
| _340bad8411ad88ec6ef85b199d4a12ae_16_LP_7_ellipsoid.pdf |
275.27Кб |
| _62be31e124aadfcfb9d5a53a3d6fd27a_ProgrammingAssignment5.pdf |
398.59Кб |
| 6b7344c41a872c3c77cebba06f3ebb51 18 coping with np completeness 2 special cases pdf |
283.40Кб |
| 72d29db2f2280185e66f0a77ada6d61f 05 4 dynamic arrays and amortized analysis pdf |
440.08Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_1_transporting_goods.pdf |
456.35Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_2_network_flows.pdf |
410.69Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_3_residual_networks.pdf |
350.25Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_4_maxflow_mincut.pdf |
358.64Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_5_ford_fulkerson.pdf |
412.95Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_6_example.pdf |
706.41Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_7_edmonds_karp.pdf |
655.70Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_8_bipartite_matching.pdf |
674.29Кб |
| _7e0f33e77d6b81677a7d725ed0ae9911_15_flows_9_image_segmentation.pdf |
255.21Кб |
| _8601ac9c05f6275f91bf168291ec49bc_AssemblerChallengeDec10Release.pdf |
3.40Мб |
| _b421923226f8319c58d2f9d039973d64_Programming-Assignment-1.pdf |
2.86Мб |
| b57e7abe8a58b4b8732d6965d865ce70 14 algorithmic challenges 1 knuth morris pratt pdf |
552.72Кб |
| _c1223813227b2ecec3e60224e6f070e4_dataset1.txt |
3.24Мб |
| _c1223813227b2ecec3e60224e6f070e4_genome1.txt |
109.41Кб |
| c2cbb71f70dc4e1ac82e98896eedda88 18 coping with np completeness 1 introduction pdf |
119.00Кб |
| c2cbb71f70dc4e1ac82e98896eedda88 18 coping with np completeness 3 exact algorithms pdf |
428.74Кб |
| c2cbb71f70dc4e1ac82e98896eedda88 18 coping with np completeness 4 approximation algorithms pdf |
281.82Кб |
| _eef54e2a950f8a5fecba5bf23e656dbf_ProgrammingAssignment2.pdf |
173.87Кб |
| [CourseClub.Me].url |
122б |
| [CourseClub.Me].url |
66б |
| [CourseClub.Me].url |
66б |
| [CourseClub.Me].url |
122б |
| [GigaCourse.Com].url |
49б |
| [GigaCourse.Com].url |
49б |
| 01 |
4б |
| 01 |
14б |
| 01 |
5б |
| 01 |
123б |
| 01 |
29б |
| 01 |
47б |
| 01 |
29б |
| 01 |
31б |
| 01_intro_1_1_whystudyalgorithms.pdf |
97.03Кб |
| 01_intro_1_2_comingup.pdf |
64.54Кб |
| 01_intro_2_fibonaccinumbers.pdf |
166.82Кб |
| 01_intro_2_fibonaccinumbers1.pdf |
122.45Кб |
| 01_intro_2_fibonaccinumbers2.pdf |
117.33Кб |
| 01_intro_2_fibonaccinumbers3.pdf |
99.77Кб |
| 01_intro_3_GCD1.pdf |
289.55Кб |
| 01_intro_3_GCD2.pdf |
82.49Кб |
| 01_intro_4_1_runtimes.pdf |
377.21Кб |
| 01_intro_4_2_asymptoticnotation1.pdf |
139.55Кб |
| 01_intro_4_2_asymptoticnotation2.pdf |
128.04Кб |
| 01_intro_4_2_asymptoticnotation3.pdf |
107.84Кб |
| 01_intro_5_courseoverview.pdf |
101.72Кб |
| 01.a |
8б |
| 01.a |
2б |
| 01.a |
0б |
| 01.a |
49б |
| 01.a |
7б |
| 01.a |
2б |
| 01.a |
2б |
| 01.a |
60б |
| 02 |
4б |
| 02 |
14б |
| 02 |
9б |
| 02 |
996б |
| 02 |
19.54Кб |
| 02 |
51б |
| 02 |
23б |
| 02 |
24б |
| 02_greedy_1_intro.pdf |
1.37Мб |
| 02_greedy_2_groupingchildren.pdf |
317.33Кб |
| 02_greedy_3_fractionalknapsack.pdf |
236.18Кб |
| 02_greedy_4_review.pdf |
44.62Кб |
| 02.a |
8б |
| 02.a |
2б |
| 02.a |
2б |
| 02.a |
1.17Кб |
| 02.a |
292б |
| 02.a |
6б |
| 02.a |
2б |
| 02.a |
12б |
| 03 |
4б |
| 03 |
25б |
| 03 |
9б |
| 03 |
19.54Кб |
| 03 |
5б |
| 03 |
25б |
| 03 |
19б |
| 03_divide_and_conquer_1_search_array.pdf |
981.18Кб |
| 03_divide_and_conquer_2_polynomial_mult.pdf |
319.94Кб |
| 03_divide_and_conquer_3_master_theorem.pdf |
208.43Кб |
| 03_divide_and_conquer_4_sorting.pdf |
184.73Кб |
| 03_divide_and_conquer_5_quicksort.pdf |
190.68Кб |
| 03.a |
8б |
| 03.a |
2б |
| 03.a |
2б |
| 03.a |
300б |
| 03.a |
2б |
| 03.a |
2б |
| 03.a |
9б |
| 04 |
6б |
| 04 |
25б |
| 04 |
9б |
| 04 |
965.62Кб |
| 04 |
124б |
| 04 |
19.54Кб |
| 04 |
43б |
| 04 |
12б |
| 04 |
16б |
| 04_dynamic_programming_1_changeproblem.pdf |
1017.10Кб |
| 04_dynamic_programming_2_editdistance.pdf |
1.03Мб |
| 04_dynamic_programming_3_knapsack.pdf |
396.63Кб |
| 04_dynamic_programming_4_maxarith.pdf |
125.09Кб |
| 04.a |
8б |
| 04.a |
2б |
| 04.a |
2б |
| 04.a |
1.11Мб |
| 04.a |
56б |
| 04.a |
292б |
| 04.a |
4б |
| 04.a |
2б |
| 04.a |
40б |
| 05 |
6б |
| 05 |
293б |
| 05 |
9б |
| 05 |
162б |
| 05 |
19.54Кб |
| 05 |
15б |
| 05 |
33б |
| 05 |
16б |
| 05.a |
8б |
| 05.a |
2б |
| 05.a |
2б |
| 05.a |
24б |
| 05.a |
292б |
| 05.a |
6б |
| 05.a |
2б |
| 05.a |
40б |
| 06 |
6б |
| 06 |
296б |
| 06 |
13б |
| 06 |
1.07Кб |
| 06 |
620б |
| 06 |
19.54Кб |
| 06 |
11б |
| 06 |
89б |
| 06 |
17б |
| 06.a |
8б |
| 06.a |
3б |
| 06.a |
4б |
| 06.a |
152б |
| 06.a |
32б |
| 06.a |
293б |
| 06.a |
2б |
| 06.a |
2б |
| 06.a |
39б |
| 07 |
6б |
| 07 |
297б |
| 07 |
13б |
| 07 |
19.54Кб |
| 07 |
61б |
| 07 |
237б |
| 07.a |
8б |
| 07.a |
3б |
| 07.a |
4б |
| 07.a |
292б |
| 07.a |
6б |
| 07.a |
2б |
| 08 |
6б |
| 08 |
305б |
| 08 |
13б |
| 08 |
965.84Кб |
| 08 |
9.77Кб |
| 08 |
7б |
| 08 |
611б |
| 08.a |
8б |
| 08.a |
2б |
| 08.a |
5б |
| 08.a |
1.41Мб |
| 08.a |
142б |
| 08.a |
2б |
| 08.a |
3б |
| 09 |
6б |
| 09 |
305б |
| 09 |
13б |
| 09 |
9.77Кб |
| 09 |
2.14Кб |
| 09 |
1.46Кб |
| 09.a |
8б |
| 09.a |
2б |
| 09.a |
5б |
| 09.a |
291б |
| 09.a |
2б |
| 09.a |
3б |
| 1. 2011 European E. coli outbreak.mp4 |
26.03Мб |
| 1. 2011 European E. coli outbreak.srt |
8.18Кб |
| 1. Applications.mp4 |
23.82Мб |
| 1. Applications.mp4 |
8.79Мб |
| 1. Applications.srt |
15.88Кб |
| 1. Applications.srt |
6.06Кб |
| 1. Applications of Hashing.mp4 |
13.55Мб |
| 1. Applications of Hashing.pdf |
1.51Мб |
| 1. Applications of Hashing.srt |
5.79Кб |
| 1. Arrays.mp4 |
20.92Мб |
| 1. Arrays.pdf |
312.03Кб |
| 1. Arrays.srt |
11.67Кб |
| 1. Brute Force Search.mp4 |
20.84Мб |
| 1. Brute Force Search.srt |
7.94Кб |
| 1. Building a Network.mp4 |
23.32Мб |
| 1. Building a Network.srt |
12.58Кб |
| 1. Burrows-Wheeler Transform.mp4 |
17.79Мб |
| 1. Burrows-Wheeler Transform.srt |
5.37Кб |
| 1. Change Problem.mp4 |
28.39Мб |
| 1. Change Problem.pdf |
10.22Мб |
| 1. Change Problem.srt |
11.80Кб |
| 1. Directed Acyclic Graphs.mp4 |
21.44Мб |
| 1. Directed Acyclic Graphs.srt |
12.89Кб |
| 1. DNA arrays.mp4 |
12.78Мб |
| 1. DNA arrays.srt |
5.84Кб |
| 1. Dynamic Arrays.mp4 |
20.75Мб |
| 1. Dynamic Arrays.pdf |
440.08Кб |
| 1. Dynamic Arrays.srt |
13.17Кб |
| 1. Exact Pattern Matching.mp4 |
27.58Мб |
| 1. Exact Pattern Matching.srt |
13.17Кб |
| 1. Fastest Route.mp4 |
21.85Мб |
| 1. Fastest Route.srt |
13.63Кб |
| 1. Graph Basics.mp4 |
15.14Мб |
| 1. Graph Basics.srt |
7.58Кб |
| 1. Intro.mp4 |
9.15Мб |
| 1. Intro.pdf |
3.13Мб |
| 1. Intro.srt |
5.21Кб |
| 1. Introduction.mp4 |
30.77Мб |
| 1. Introduction.mp4 |
18.52Мб |
| 1. Introduction.mp4 |
9.57Мб |
| 1. Introduction.mp4 |
12.94Мб |
| 1. Introduction.mp4 |
18.42Мб |
| 1. Introduction.mp4 |
46.08Мб |
| 1. Introduction.pdf |
245.92Кб |
| 1. Introduction.pdf |
278.59Кб |
| 1. Introduction.srt |
8.31Кб |
| 1. Introduction.srt |
12.36Кб |
| 1. Introduction.srt |
5.15Кб |
| 1. Introduction.srt |
7.95Кб |
| 1. Introduction.srt |
6.09Кб |
| 1. Introduction.srt |
7.79Кб |
| 1. Problem Overview.mp4 |
18.55Мб |
| 1. Problem Overview.pdf |
512.55Кб |
| 1. Problem Overview.srt |
7.66Кб |
| 1. Programming Project Introduction.mp4 |
5.08Мб |
| 1. Programming Project Introduction.srt |
2.30Кб |
| 1. Splitting the genome into contigs.mp4 |
4.39Мб |
| 1. Splitting the genome into contigs.srt |
2.25Кб |
| 1. Suffix Array.mp4 |
25.03Мб |
| 1. Suffix Array.srt |
9.38Кб |
| 1. Welcome!.mp4 |
16.14Мб |
| 1. Welcome!.srt |
4.99Кб |
| 1. Welcome.mp4 |
16.34Мб |
| 1. Welcome.srt |
6.97Кб |
| 1. Why Study Algorithms.mp4 |
26.87Мб |
| 1. Why Study Algorithms.pdf |
121.62Кб |
| 1. Why Study Algorithms.srt |
11.77Кб |
| 10 |
6б |
| 10 |
296б |
| 10 |
13б |
| 10 |
4.68Кб |
| 10 |
4.25Кб |
| 10 |
237б |
| 10. (Optional) The Ellipsoid Algorithm.mp4 |
16.45Мб |
| 10. (Optional) The Ellipsoid Algorithm.srt |
10.11Кб |
| 10.a |
8б |
| 10.a |
4б |
| 10.a |
4б |
| 10.a |
165б |
| 10.a |
6б |
| 10.a |
2б |
| 10. Bellman-Ford Algorithm.mp4 |
15.40Мб |
| 10. Bellman-Ford Algorithm.srt |
10.38Кб |
| 10. Big-O Notation.mp4 |
27.44Мб |
| 10. Big-O Notation.pdf |
179.23Кб |
| 10. Big-O Notation.srt |
10.56Кб |
| 10. Computing the LCP Array.mp4 |
25.06Мб |
| 10. Computing the LCP Array.srt |
14.52Кб |
| 10. Hashing Phone Numbers.mp4 |
38.84Мб |
| 10. Hashing Phone Numbers.srt |
13.50Кб |
| 10. Metric TSP.mp4 |
37.56Мб |
| 10. Metric TSP.srt |
16.53Кб |
| 10. Naive Implementations.mp4 |
40.82Мб |
| 10. Naive Implementations.srt |
12.56Кб |
| 10. Potential Functions and Lower Bounds.mp4 |
25.99Мб |
| 10. Potential Functions and Lower Bounds.srt |
8.29Кб |
| 10. Problem Overview.mp4 |
12.40Мб |
| 10. Problem Overview.pdf |
299.86Кб |
| 10. Problem Overview.srt |
3.90Кб |
| 10. Proofs 2.mp4 |
54.69Мб |
| 10. Proofs 2.srt |
12.29Кб |
| 10. Showing NP-completeness.mp4 |
22.70Мб |
| 10. Showing NP-completeness.srt |
8.31Кб |
| 11 |
8б |
| 11 |
289б |
| 11 |
13б |
| 11 |
4.68Кб |
| 11 |
6.36Кб |
| 11 |
611б |
| 11 |
1.90Кб |
| 11.a |
8б |
| 11.a |
3б |
| 11.a |
4б |
| 11.a |
117б |
| 11.a |
6б |
| 11.a |
3б |
| 11.a |
9б |
| 11. Construct Suffix Tree from Suffix Array and LCP Array.mp4 |
25.07Мб |
| 11. Construct Suffix Tree from Suffix Array and LCP Array.srt |
9.20Кб |
| 11. Hashing Names.mp4 |
24.86Мб |
| 11. Hashing Names.srt |
10.73Кб |
| 11. Independent Set to Vertex Cover.mp4 |
21.10Мб |
| 11. Independent Set to Vertex Cover.srt |
7.11Кб |
| 11. Landmarks (Optional).mp4 |
48.12Мб |
| 11. Landmarks (Optional).srt |
13.08Кб |
| 11. Proof of Correctness.mp4 |
18.05Мб |
| 11. Proof of Correctness.srt |
9.95Кб |
| 11. Selection Sort.mp4 |
34.03Мб |
| 11. Selection Sort.srt |
10.90Кб |
| 11. Trees for Disjoint Sets.mp4 |
28.62Мб |
| 11. Trees for Disjoint Sets.pdf |
322.72Кб |
| 11. Trees for Disjoint Sets.srt |
10.32Кб |
| 11. TSP Local Search.mp4 |
28.20Мб |
| 11. TSP Local Search.srt |
8.50Кб |
| 11. Using Big-O.mp4 |
28.82Мб |
| 11. Using Big-O.pdf |
190.76Кб |
| 11. Using Big-O.srt |
15.50Кб |
| 116 |
1.58Мб |
| 116.a |
954.95Кб |
| 12 |
8б |
| 12 |
296б |
| 12 |
13б |
| 12 |
19.54Кб |
| 12 |
8.48Кб |
| 12 |
1.46Кб |
| 12 |
1.90Кб |
| 12. 3-SAT to Independent Set.mp4 |
51.14Мб |
| 12. 3-SAT to Independent Set.srt |
18.93Кб |
| 12.a |
8б |
| 12.a |
3б |
| 12.a |
4б |
| 12.a |
292б |
| 12.a |
6б |
| 12.a |
3б |
| 12.a |
9б |
| 12. Analysis of Polynomial Hashing.mp4 |
35.82Мб |
| 12. Analysis of Polynomial Hashing.srt |
15.17Кб |
| 12. Course Overview.mp4 |
33.04Мб |
| 12. Course Overview.pdf |
123.25Кб |
| 12. Course Overview.srt |
16.41Кб |
| 12. Highway Hierarchies and Node Importance.mp4 |
27.82Мб |
| 12. Highway Hierarchies and Node Importance.srt |
10.77Кб |
| 12. Merge Sort.mp4 |
49.25Мб |
| 12. Merge Sort.srt |
14.71Кб |
| 12. Negative Cycles.mp4 |
21.34Мб |
| 12. Negative Cycles.srt |
12.17Кб |
| 12. Union by Rank.mp4 |
29.10Мб |
| 12. Union by Rank.srt |
12.09Кб |
| 13 |
8б |
| 13 |
295б |
| 13 |
17б |
| 13 |
9.77Кб |
| 13 |
10.59Кб |
| 13 |
7.48Кб |
| 13.a |
8б |
| 13.a |
3б |
| 13.a |
7б |
| 13.a |
141б |
| 13.a |
7б |
| 13.a |
3б |
| 13. Find Substring in Text.mp4 |
25.13Мб |
| 13. Find Substring in Text.srt |
10.31Кб |
| 13. Infinite Arbitrage.mp4 |
26.49Мб |
| 13. Infinite Arbitrage.srt |
14.30Кб |
| 13. Lower Bound for Comparison Based Sorting.mp4 |
53.87Мб |
| 13. Lower Bound for Comparison Based Sorting.srt |
15.76Кб |
| 13. Path Compression.mp4 |
20.62Мб |
| 13. Path Compression.srt |
7.91Кб |
| 13. Preprocessing.mp4 |
29.89Мб |
| 13. Preprocessing.srt |
10.93Кб |
| 13. SAT to 3-SAT.mp4 |
20.98Мб |
| 13. SAT to 3-SAT.srt |
8.65Кб |
| 14 |
3б |
| 14 |
292б |
| 14 |
17б |
| 14 |
9.77Кб |
| 14 |
12.71Кб |
| 14 |
7.17Кб |
| 14.a |
2б |
| 14.a |
3б |
| 14.a |
6б |
| 14.a |
291б |
| 14.a |
6б |
| 14.a |
3б |
| 14. Analysis (Optional).mp4 |
60.49Мб |
| 14. Analysis (Optional).srt |
21.78Кб |
| 14. Circuit SAT to SAT.mp4 |
31.79Мб |
| 14. Circuit SAT to SAT.srt |
14.36Кб |
| 14. Non-Comparison Based Sorting Algorithms.mp4 |
34.22Мб |
| 14. Non-Comparison Based Sorting Algorithms.srt |
9.56Кб |
| 14. Rabin-Karp's Algorithm.mp4 |
30.54Мб |
| 14. Rabin-Karp's Algorithm.srt |
13.92Кб |
| 14. Witness Search.mp4 |
39.71Мб |
| 14. Witness Search.srt |
12.75Кб |
| 15 |
3б |
| 15 |
295б |
| 15 |
17б |
| 15 |
4.68Кб |
| 15 |
14.81Кб |
| 15 |
6.78Кб |
| 15.a |
2б |
| 15.a |
3б |
| 15.a |
7б |
| 15.a |
162б |
| 15.a |
7б |
| 15.a |
3б |
| 15. All of NP to Circuit SAT.mp4 |
15.22Мб |
| 15. All of NP to Circuit SAT.srt |
6.66Кб |
| 15. Overview.mp4 |
9.59Мб |
| 15. Overview.pdf |
284.95Кб |
| 15. Overview.srt |
3.24Кб |
| 15. Query.mp4 |
32.21Мб |
| 15. Query.srt |
11.89Кб |
| 15. Recurrence for Substring Hashes.mp4 |
45.55Мб |
| 15. Recurrence for Substring Hashes.srt |
15.44Кб |
| 16 |
3б |
| 16 |
575.11Кб |
| 16 |
17б |
| 16 |
4.68Кб |
| 16 |
16.93Кб |
| 16 |
6.44Кб |
| 16.a |
2б |
| 16.a |
3б |
| 16.a |
6б |
| 16.a |
117б |
| 16.a |
7б |
| 16.a |
3б |
| 16. Algorithm.mp4 |
40.00Мб |
| 16. Algorithm.srt |
11.72Кб |
| 16. Improving Running Time.mp4 |
32.81Мб |
| 16. Improving Running Time.srt |
14.80Кб |
| 16. Proof of Correctness.mp4 |
39.13Мб |
| 16. Proof of Correctness.srt |
11.94Кб |
| 16. Using SAT-solvers.mp4 |
40.32Мб |
| 16. Using SAT-solvers.srt |
17.71Кб |
| 17 |
3б |
| 17 |
574.91Кб |
| 17 |
29б |
| 17 |
19.54Кб |
| 17 |
19.07Кб |
| 17 |
6.08Кб |
| 17.a |
2б |
| 17.a |
3б |
| 17.a |
13б |
| 17.a |
292б |
| 17.a |
7б |
| 17.a |
3б |
| 17. Julia's Diary.mp4 |
24.87Мб |
| 17. Julia's Diary.pdf |
272.11Кб |
| 17. Julia's Diary.srt |
8.73Кб |
| 17. Node Ordering.mp4 |
54.81Мб |
| 17. Node Ordering.srt |
21.60Кб |
| 17. Random Pivot.mp4 |
59.72Мб |
| 17. Random Pivot.srt |
18.32Кб |
| 18 |
3б |
| 18 |
575.18Кб |
| 18 |
18б |
| 18 |
9.77Кб |
| 18 |
52.41Кб |
| 18 |
5.34Кб |
| 18.a |
2б |
| 18.a |
5б |
| 18.a |
7б |
| 18.a |
141б |
| 18.a |
7б |
| 18.a |
3б |
| 18. Julia's Bank.mp4 |
20.71Мб |
| 18. Julia's Bank.srt |
8.15Кб |
| 18. Running Time Analysis (optional).mp4 |
69.53Мб |
| 18. Running Time Analysis (optional).srt |
20.52Кб |
| 19 |
3б |
| 19 |
585.94Кб |
| 19 |
759.70Кб |
| 19 |
9.77Кб |
| 19 |
52.41Кб |
| 19 |
4.55Кб |
| 19.a |
2б |
| 19.a |
2б |
| 19.a |
292.97Кб |
| 19.a |
291б |
| 19.a |
7б |
| 19.a |
3б |
| 19. Blockchain.mp4 |
25.54Мб |
| 19. Blockchain.srt |
10.13Кб |
| 19. Equal Elements.mp4 |
24.57Мб |
| 19. Equal Elements.srt |
8.48Кб |
| 2. 2-SAT.mp4 |
24.77Мб |
| 2. 2-SAT.srt |
14.01Кб |
| 2. Amortized Analysis Aggregate Method.mp4 |
15.66Мб |
| 2. Amortized Analysis Aggregate Method.srt |
7.71Кб |
| 2. Analysing Service Access Logs.mp4 |
14.76Мб |
| 2. Analysing Service Access Logs.srt |
11.88Кб |
| 2. Assembling genomes from k-mers.mp4 |
15.45Мб |
| 2. Assembling genomes from k-mers.srt |
5.09Кб |
| 2. Assembling phage genome.mp4 |
13.14Мб |
| 2. Assembling phage genome.srt |
4.93Кб |
| 2. Bidirectional Search.mp4 |
34.25Мб |
| 2. Bidirectional Search.srt |
13.64Кб |
| 2. Binary Trees.mp4 |
6.99Мб |
| 2. Binary Trees.pdf |
527.65Кб |
| 2. Binary Trees.srt |
1.60Кб |
| 2. Coming Up.mp4 |
11.09Мб |
| 2. Coming Up.pdf |
78.80Кб |
| 2. Coming Up.srt |
4.80Кб |
| 2. From Genome Sequencing to Pattern Matching.mp4 |
34.95Мб |
| 2. From Genome Sequencing to Pattern Matching.srt |
10.45Кб |
| 2. From reads to read-pairs.mp4 |
9.43Мб |
| 2. From reads to read-pairs.srt |
3.90Кб |
| 2. General Strategy.mp4 |
23.69Мб |
| 2. General Strategy.srt |
8.53Кб |
| 2. Greedy Algorithms.mp4 |
15.41Мб |
| 2. Greedy Algorithms.srt |
5.01Кб |
| 2. Heavy Hitters Problem.mp4 |
73.42Мб |
| 2. Heavy Hitters Problem.srt |
11.30Кб |
| 2. Inverting Burrows-Wheeler Transform.mp4 |
27.17Мб |
| 2. Inverting Burrows-Wheeler Transform.srt |
8.24Кб |
| 2. Knapsack with Repetitions.mp4 |
31.95Мб |
| 2. Knapsack with Repetitions.srt |
12.09Кб |
| 2. Linear Programming.mp4 |
18.61Мб |
| 2. Linear Programming.srt |
13.54Кб |
| 2. Linear Search.mp4 |
18.49Мб |
| 2. Linear Search.srt |
12.22Кб |
| 2. Naive Algorithm.mp4 |
24.61Мб |
| 2. Naive Algorithm.srt |
12.41Кб |
| 2. Network Flows.mp4 |
21.82Мб |
| 2. Network Flows.srt |
13.91Кб |
| 2. Paths and Distances.mp4 |
19.85Мб |
| 2. Paths and Distances.srt |
13.58Кб |
| 2. Representing Graphs.mp4 |
33.43Мб |
| 2. Representing Graphs.srt |
15.85Кб |
| 2. Safe Shift.mp4 |
10.34Мб |
| 2. Safe Shift.srt |
3.95Кб |
| 2. Search Problems.mp4 |
30.18Мб |
| 2. Search Problems.srt |
12.30Кб |
| 2. Search Trees.mp4 |
12.40Мб |
| 2. Search Trees.pdf |
181.61Кб |
| 2. Search Trees.srt |
8.22Кб |
| 2. Singly-Linked Lists.mp4 |
24.96Мб |
| 2. Singly-Linked Lists.srt |
14.16Кб |
| 2. Solving the Sum of Two Digits Programming Challenge (screencast).mp4 |
12.84Мб |
| 2. Solving the Sum of Two Digits Programming Challenge (screencast).srt |
7.03Кб |
| 2. Splay Trees Introduction.mp4 |
17.08Мб |
| 2. Splay Trees Introduction.srt |
10.36Кб |
| 2. The Alignment Game.mp4 |
22.77Мб |
| 2. The Alignment Game.pdf |
2.71Мб |
| 2. The Alignment Game.srt |
10.34Кб |
| 2. Topological Sort.mp4 |
27.88Мб |
| 2. Topological Sort.srt |
14.63Кб |
| 20 |
5б |
| 20 |
585.94Кб |
| 20 |
759.91Кб |
| 20 |
1.43Кб |
| 20 |
4.68Кб |
| 20 |
52.41Кб |
| 20 |
3.76Кб |
| 20.a |
2б |
| 20.a |
2б |
| 20.a |
293.25Кб |
| 20.a |
471б |
| 20.a |
162б |
| 20.a |
7б |
| 20.a |
3б |
| 20. Final Remarks.mp4 |
36.82Мб |
| 20. Final Remarks.srt |
10.99Кб |
| 20. Merkle Tree.mp4 |
27.29Мб |
| 20. Merkle Tree.srt |
11.57Кб |
| 21 |
5б |
| 21 |
575.09Кб |
| 21 |
759.92Кб |
| 21 |
1.79Мб |
| 21 |
4.68Кб |
| 21 |
52.41Кб |
| 21 |
3.01Кб |
| 21.a |
2б |
| 21.a |
7б |
| 21.a |
296.65Кб |
| 21.a |
2.83Мб |
| 21.a |
117б |
| 21.a |
7б |
| 21.a |
3б |
| 22 |
5б |
| 22 |
575.08Кб |
| 22 |
759.60Кб |
| 22 |
19.54Кб |
| 22 |
52.41Кб |
| 22 |
2.25Кб |
| 22.a |
2б |
| 22.a |
6б |
| 22.a |
857.21Кб |
| 22.a |
292б |
| 22.a |
7б |
| 22.a |
3б |
| 23 |
7б |
| 23 |
575.08Кб |
| 23 |
9.77Кб |
| 23 |
1.93Кб |
| 23 |
1.45Кб |
| 23.a |
2б |
| 23.a |
6б |
| 23.a |
146б |
| 23.a |
6б |
| 23.a |
3б |
| 24 |
7б |
| 24 |
575.09Кб |
| 24 |
9.77Кб |
| 24 |
1.67Кб |
| 24 |
732б |
| 24.a |
2б |
| 24.a |
6б |
| 24.a |
295б |
| 24.a |
6б |
| 24.a |
2б |
| 25 |
7б |
| 25 |
4.68Кб |
| 25 |
1.80Кб |
| 25 |
7.48Кб |
| 25.a |
2б |
| 25.a |
165б |
| 25.a |
6б |
| 25.a |
3б |
| 26 |
7б |
| 26 |
4.68Кб |
| 26 |
1.96Кб |
| 26 |
16.85Кб |
| 26.a |
2б |
| 26.a |
120б |
| 26.a |
6б |
| 26.a |
4б |
| 27 |
7б |
| 27 |
19.54Кб |
| 27 |
1.68Кб |
| 27 |
12б |
| 27.a |
2б |
| 27.a |
296б |
| 27.a |
6б |
| 27.a |
2б |
| 28 |
7б |
| 28 |
9.77Кб |
| 28 |
1.79Кб |
| 28 |
4.20Кб |
| 28.a |
2б |
| 28.a |
147б |
| 28.a |
6б |
| 28.a |
3б |
| 29 |
7б |
| 29 |
9.77Кб |
| 29 |
1.95Кб |
| 29 |
7.08Кб |
| 29.a |
2б |
| 29.a |
292б |
| 29.a |
6б |
| 29.a |
4б |
| 3. 2-SAT Algorithm.mp4 |
28.18Мб |
| 3. 2-SAT Algorithm.srt |
16.44Кб |
| 3. Amortized Analysis Banker's Method.mp4 |
18.16Мб |
| 3. Amortized Analysis Banker's Method.srt |
8.85Кб |
| 3. Basic Operations.mp4 |
64.28Мб |
| 3. Basic Operations.mp4 |
19.51Мб |
| 3. Basic Operations.pdf |
447.33Кб |
| 3. Basic Operations.srt |
15.93Кб |
| 3. Basic Operations.srt |
16.59Кб |
| 3. Breadth-First Search.mp4 |
15.53Мб |
| 3. Breadth-First Search.srt |
11.29Кб |
| 3. Brute Force Approach to Pattern Matching.mp4 |
9.30Мб |
| 3. Brute Force Approach to Pattern Matching.srt |
2.82Кб |
| 3. Computing Edit Distance.mp4 |
13.52Мб |
| 3. Computing Edit Distance.srt |
6.56Кб |
| 3. Cut Property.mp4 |
39.72Мб |
| 3. Cut Property.srt |
10.94Кб |
| 3. De Bruijn graphs.mp4 |
8.74Мб |
| 3. De Bruijn graphs.srt |
4.31Кб |
| 3. Dijkstra's Algorithm.mp4 |
11.26Мб |
| 3. Dijkstra's Algorithm.srt |
6.86Кб |
| 3. Direct Addressing.mp4 |
14.96Мб |
| 3. Direct Addressing.srt |
9.90Кб |
| 3. Doubly-Linked Lists.mp4 |
13.70Мб |
| 3. Doubly-Linked Lists.srt |
7.07Кб |
| 3. Exploring Graphs.mp4 |
43.25Мб |
| 3. Exploring Graphs.srt |
24.28Кб |
| 3. Genome assembly faces real sequencing data.mp4 |
12.41Мб |
| 3. Genome assembly faces real sequencing data.srt |
7.03Кб |
| 3. Initialization.mp4 |
35.10Мб |
| 3. Initialization.srt |
12.67Кб |
| 3. Knapsack without Repetitions.mp4 |
62.21Мб |
| 3. Knapsack without Repetitions.srt |
21.78Кб |
| 3. Linear Algebra Method of Substitution.mp4 |
13.85Мб |
| 3. Linear Algebra Method of Substitution.srt |
7.72Кб |
| 3. Linear Search.mp4 |
19.02Мб |
| 3. Linear Search.srt |
10.77Кб |
| 3. Prefix Function.mp4 |
25.21Мб |
| 3. Prefix Function.srt |
10.44Кб |
| 3. Problem Overview.mp4 |
9.06Мб |
| 3. Problem Overview.pdf |
280.54Кб |
| 3. Problem Overview.srt |
5.13Кб |
| 3. Reduction 1.mp4 |
41.12Мб |
| 3. Reduction 1.srt |
6.52Кб |
| 3. Residual Networks.mp4 |
23.39Мб |
| 3. Residual Networks.srt |
14.47Кб |
| 3. Six Handshakes.mp4 |
26.65Мб |
| 3. Six Handshakes.srt |
9.40Кб |
| 3. Solving the Maximum Pairwise Product Programming Challenge Improving the Naive Solution, Testing, Debugging.mp4 |
24.05Мб |
| 3. Solving the Maximum Pairwise Product Programming Challenge Improving the Naive Solution, Testing, Debugging.srt |
14.97Кб |
| 3. Splay Trees Implementation.mp4 |
23.49Мб |
| 3. Splay Trees Implementation.srt |
12.37Кб |
| 3. Strongly Connected Components.mp4 |
20.55Мб |
| 3. Strongly Connected Components.srt |
12.67Кб |
| 3. Traveling Salesman Problem.mp4 |
24.45Мб |
| 3. Traveling Salesman Problem.srt |
11.02Кб |
| 3. Using BWT for Pattern Matching.mp4 |
27.52Мб |
| 3. Using BWT for Pattern Matching.srt |
7.73Кб |
| 30 |
9б |
| 30 |
4.68Кб |
| 30 |
1.68Кб |
| 30 |
5.13Кб |
| 30.a |
2б |
| 30.a |
168б |
| 30.a |
5б |
| 30.a |
4б |
| 31 |
9б |
| 31 |
4.68Кб |
| 31 |
1.78Кб |
| 31 |
4.89Кб |
| 31.a |
2б |
| 31.a |
122б |
| 31.a |
6б |
| 31.a |
4б |
| 32 |
9б |
| 32 |
11.49Кб |
| 32 |
4.89Кб |
| 32.a |
2б |
| 32.a |
7б |
| 32.a |
4б |
| 33 |
6б |
| 33 |
11.50Кб |
| 33 |
9.50Кб |
| 33.a |
2б |
| 33.a |
7б |
| 33.a |
4б |
| 34 |
6б |
| 34 |
11.49Кб |
| 34 |
11.95Кб |
| 34.a |
2б |
| 34.a |
7б |
| 34.a |
4б |
| 35 |
6б |
| 35 |
11.48Кб |
| 35 |
729б |
| 35.a |
2б |
| 35.a |
7б |
| 35.a |
3б |
| 36 |
6б |
| 36 |
13.91Кб |
| 36 |
11.49Кб |
| 36 |
7.09Кб |
| 36 |
37б |
| 36.a |
2б |
| 36.a |
4.25Кб |
| 36.a |
7б |
| 36.a |
4б |
| 36.a |
39б |
| 37 |
6б |
| 37.a |
2б |
| 38 |
6б |
| 38.a |
2б |
| 39 |
6б |
| 39.a |
2б |
| 4. (Optional) Splay Trees Analysis.mp4 |
29.15Мб |
| 4. (Optional) Splay Trees Analysis.srt |
15.77Кб |
| 4. Amortized Analysis Physicist's Method.mp4 |
18.00Мб |
| 4. Amortized Analysis Physicist's Method.srt |
10.21Кб |
| 4. Balance.mp4 |
9.12Мб |
| 4. Balance.pdf |
262.45Кб |
| 4. Balance.srt |
8.94Кб |
| 4. Bidirectional Dijkstra.mp4 |
20.70Мб |
| 4. Bidirectional Dijkstra.srt |
7.76Кб |
| 4. Binary Search Runtime.mp4 |
25.33Мб |
| 4. Binary Search Runtime.srt |
12.78Кб |
| 4. Breadth-First Search (continued).mp4 |
19.34Мб |
| 4. Breadth-First Search (continued).srt |
11.44Кб |
| 4. Bridges of Königsberg and universal strings.mp4 |
13.57Мб |
| 4. Bridges of Königsberg and universal strings.srt |
5.08Кб |
| 4. Complete Binary Trees.mp4 |
31.96Мб |
| 4. Complete Binary Trees.srt |
11.59Кб |
| 4. Computing Prefix Function.mp4 |
32.49Мб |
| 4. Computing Prefix Function.srt |
13.76Кб |
| 4. Computing Strongly Connected Components.mp4 |
32.64Мб |
| 4. Computing Strongly Connected Components.srt |
17.10Кб |
| 4. Connectivity.mp4 |
15.76Мб |
| 4. Connectivity.srt |
9.62Кб |
| 4. Dijkstra Example.mp4 |
11.90Мб |
| 4. Dijkstra Example.srt |
9.11Кб |
| 4. Final Remarks.mp4 |
25.78Мб |
| 4. Final Remarks.srt |
9.54Кб |
| 4. Hamiltonian Cycle Problem.mp4 |
19.07Мб |
| 4. Hamiltonian Cycle Problem.srt |
10.29Кб |
| 4. Hash Functions.mp4 |
13.84Мб |
| 4. Hash Functions.srt |
5.32Кб |
| 4. Herding Patterns into Trie.mp4 |
19.97Мб |
| 4. Herding Patterns into Trie.srt |
6.70Кб |
| 4. Independent Sets in Trees.mp4 |
36.38Мб |
| 4. Independent Sets in Trees.srt |
18.66Кб |
| 4. Kruskal's Algorithm.mp4 |
41.76Мб |
| 4. Kruskal's Algorithm.srt |
18.90Кб |
| 4. Linear Algebra Gaussian Elimination.mp4 |
18.78Мб |
| 4. Linear Algebra Gaussian Elimination.srt |
15.42Кб |
| 4. Maxflow-Mincut.mp4 |
15.06Мб |
| 4. Maxflow-Mincut.srt |
11.55Кб |
| 4. Naive Algorithm.mp4 |
11.82Мб |
| 4. Naive Algorithm.pdf |
164.57Кб |
| 4. Naive Algorithm.srt |
8.34Кб |
| 4. Reconstructing an Optimal Alignment.mp4 |
11.85Мб |
| 4. Reconstructing an Optimal Alignment.srt |
5.36Кб |
| 4. Reduction 2.mp4 |
58.63Мб |
| 4. Reduction 2.srt |
9.41Кб |
| 4. Sort Doubled Cyclic Shifts.mp4 |
30.82Мб |
| 4. Sort Doubled Cyclic Shifts.srt |
9.40Кб |
| 4. Stacks.mp4 |
28.32Мб |
| 4. Stacks.pdf |
475.91Кб |
| 4. Stacks.srt |
16.09Кб |
| 4. Stress Test - Implementation.mp4 |
17.18Мб |
| 4. Stress Test - Implementation.srt |
11.34Кб |
| 4. Suffix Arrays.mp4 |
19.40Мб |
| 4. Suffix Arrays.srt |
6.45Кб |
| 40 |
8б |
| 40.a |
2б |
| 41 |
21б |
| 41.a |
2б |
| 42 |
20б |
| 42.a |
3б |
| 43 |
1.96Кб |
| 43 |
63б |
| 43.a |
8б |
| 43.a |
12б |
| 44 |
1.96Кб |
| 44.a |
8б |
| 45 |
1.96Кб |
| 45.a |
8б |
| 46 |
1.96Кб |
| 46.a |
8б |
| 47 |
1.96Кб |
| 47.a |
8б |
| 48 |
1.96Кб |
| 48.a |
8б |
| 49 |
1.96Кб |
| 49.a |
4б |
| 5. 3-SAT Backtracking.mp4 |
37.94Мб |
| 5. 3-SAT Backtracking.srt |
15.18Кб |
| 5. Approximate Pattern Matching.mp4 |
26.86Мб |
| 5. Approximate Pattern Matching.srt |
7.87Кб |
| 5. AVL Trees.mp4 |
12.17Мб |
| 5. AVL Trees.pdf |
228.22Кб |
| 5. AVL Trees.srt |
9.08Кб |
| 5. Basic Estimate 1.mp4 |
72.03Мб |
| 5. Basic Estimate 1.srt |
11.42Кб |
| 5. Chaining.mp4 |
29.42Мб |
| 5. Chaining.srt |
12.57Кб |
| 5. Convexity.mp4 |
21.62Мб |
| 5. Convexity.srt |
13.38Кб |
| 5. Efficient Algorithm.mp4 |
10.13Мб |
| 5. Efficient Algorithm.pdf |
203.97Кб |
| 5. Efficient Algorithm.srt |
6.15Кб |
| 5. Euler theorem.mp4 |
12.79Мб |
| 5. Euler theorem.srt |
7.41Кб |
| 5. Finding Shortest Path after Meeting in the Middle.mp4 |
18.55Мб |
| 5. Finding Shortest Path after Meeting in the Middle.srt |
11.02Кб |
| 5. Herding Text into Suffix Trie.mp4 |
24.97Мб |
| 5. Herding Text into Suffix Trie.srt |
7.66Кб |
| 5. Implementation.mp4 |
18.01Мб |
| 5. Implementation.srt |
8.09Кб |
| 5. Implementation and Analysis.mp4 |
13.97Мб |
| 5. Implementation and Analysis.srt |
7.59Кб |
| 5. Knuth-Morris-Pratt Algorithm.mp4 |
21.95Мб |
| 5. Knuth-Morris-Pratt Algorithm.srt |
8.37Кб |
| 5. Longest Path Problem.mp4 |
8.21Мб |
| 5. Longest Path Problem.srt |
2.21Кб |
| 5. Previsit and Postvisit Orderings.mp4 |
19.55Мб |
| 5. Previsit and Postvisit Orderings.srt |
12.59Кб |
| 5. Prim's Algorithm.mp4 |
37.67Мб |
| 5. Prim's Algorithm.srt |
16.17Кб |
| 5. Problem Overview.mp4 |
25.30Мб |
| 5. Problem Overview.pdf |
221.76Кб |
| 5. Problem Overview.srt |
9.13Кб |
| 5. Problem Overview and Naïve Solution.mp4 |
17.54Мб |
| 5. Problem Overview and Naïve Solution.pdf |
443.00Кб |
| 5. Problem Overview and Naïve Solution.srt |
8.75Кб |
| 5. Pseudocode.mp4 |
27.71Мб |
| 5. Pseudocode.srt |
10.55Кб |
| 5. Queues.mp4 |
17.53Мб |
| 5. Queues.srt |
10.72Кб |
| 5. SortDouble Implementation.mp4 |
25.69Мб |
| 5. SortDouble Implementation.srt |
7.83Кб |
| 5. Stress Test - Find the Test and Debug.mp4 |
12.97Мб |
| 5. Stress Test - Find the Test and Debug.srt |
9.63Кб |
| 5. The Ford–Fulkerson Algorithm.mp4 |
12.41Мб |
| 5. The Ford–Fulkerson Algorithm.srt |
11.96Кб |
| 50 |
1.96Кб |
| 50.a |
3б |
| 51 |
1.96Кб |
| 51.a |
4б |
| 52 |
97.66Кб |
| 52 |
8.75Кб |
| 52.a |
8б |
| 52.a |
1.08Кб |
| 53 |
97.66Кб |
| 53.a |
8б |
| 54 |
97.66Кб |
| 54.a |
8б |
| 55 |
17.32Кб |
| 55.a |
9б |
| 6. 3-SAT Local Search.mp4 |
49.86Мб |
| 6. 3-SAT Local Search.srt |
17.24Кб |
| 6. AVL Tree Implementation.mp4 |
15.97Мб |
| 6. AVL Tree Implementation.pdf |
342.95Кб |
| 6. AVL Tree Implementation.srt |
12.65Кб |
| 6. Basic Estimate 2.mp4 |
60.66Мб |
| 6. Basic Estimate 2.srt |
10.24Кб |
| 6. BFS Properties.mp4 |
26.39Мб |
| 6. BFS Properties.srt |
13.50Кб |
| 6. Chaining Implementation and Analysis.mp4 |
25.75Мб |
| 6. Chaining Implementation and Analysis.srt |
8.79Кб |
| 6. Computing the Distance.mp4 |
9.44Мб |
| 6. Computing the Distance.srt |
3.30Кб |
| 6. Duality.mp4 |
25.91Мб |
| 6. Duality.srt |
18.69Кб |
| 6. Heap Sort.mp4 |
45.18Мб |
| 6. Heap Sort.srt |
14.62Кб |
| 6. Integer Linear Programming Problem.mp4 |
15.20Мб |
| 6. Integer Linear Programming Problem.srt |
4.08Кб |
| 6. Naïve Divide and Conquer Algorithm.mp4 |
17.78Мб |
| 6. Naïve Divide and Conquer Algorithm.srt |
9.72Кб |
| 6. Problem Overview and Naive Algorithm.mp4 |
9.95Мб |
| 6. Problem Overview and Naive Algorithm.pdf |
371.71Кб |
| 6. Problem Overview and Naive Algorithm.srt |
6.09Кб |
| 6. Proof of Correctness.mp4 |
19.37Мб |
| 6. Proof of Correctness.srt |
11.07Кб |
| 6. Slow Example.mp4 |
6.87Мб |
| 6. Slow Example.srt |
5.40Кб |
| 6. Stress Test - More Testing, Submit and Pass!.mp4 |
119.33Мб |
| 6. Stress Test - More Testing, Submit and Pass!.srt |
12.75Кб |
| 6. Subproblems.mp4 |
25.27Мб |
| 6. Subproblems.srt |
8.61Кб |
| 6. Suffix Trees.mp4 |
20.60Мб |
| 6. Suffix Trees.srt |
5.41Кб |
| 6. Trees.mp4 |
28.92Мб |
| 6. Trees.pdf |
484.34Кб |
| 6. Trees.srt |
16.02Кб |
| 6. Updating Classes.mp4 |
31.84Мб |
| 6. Updating Classes.srt |
11.46Кб |
| 65 |
8.71Кб |
| 65.a |
9б |
| 7. (Optional) Duality Proofs.mp4 |
18.45Мб |
| 7. (Optional) Duality Proofs.srt |
11.02Кб |
| 7. A Algorithm.mp4 |
39.78Мб |
| 7. A Algorithm.srt |
14.33Кб |
| 7. Algorithm.mp4 |
28.02Мб |
| 7. Algorithm.srt |
14.21Кб |
| 7. Analysis.mp4 |
12.62Мб |
| 7. Analysis.srt |
7.37Кб |
| 7. Building a Heap.mp4 |
30.47Мб |
| 7. Building a Heap.srt |
12.64Кб |
| 7. Correct Distances.mp4 |
10.85Мб |
| 7. Correct Distances.srt |
7.11Кб |
| 7. Efficient Algorithm.mp4 |
12.47Мб |
| 7. Efficient Algorithm.pdf |
160.80Кб |
| 7. Efficient Algorithm.srt |
7.94Кб |
| 7. Faster Divide and Conquer Algorithm.mp4 |
14.98Мб |
| 7. Faster Divide and Conquer Algorithm.srt |
9.56Кб |
| 7. Final Algorithm 1.mp4 |
49.74Мб |
| 7. Final Algorithm 1.srt |
7.71Кб |
| 7. Full Algorithm.mp4 |
14.56Мб |
| 7. Full Algorithm.srt |
5.12Кб |
| 7. Hash Tables.mp4 |
26.17Мб |
| 7. Hash Tables.srt |
11.24Кб |
| 7. Independent Set Problem.mp4 |
15.53Мб |
| 7. Independent Set Problem.srt |
4.36Кб |
| 7. Split and Merge.mp4 |
18.93Мб |
| 7. Split and Merge.pdf |
358.18Кб |
| 7. Split and Merge.srt |
15.43Кб |
| 7. The Edmonds–Karp Algorithm.mp4 |
27.75Мб |
| 7. The Edmonds–Karp Algorithm.srt |
16.81Кб |
| 7. Tree Traversal.mp4 |
26.51Мб |
| 7. Tree Traversal.srt |
15.93Кб |
| 7. TSP Dynamic Programming.mp4 |
48.17Мб |
| 7. TSP Dynamic Programming.srt |
18.83Кб |
| 8. Bipartite Matching.mp4 |
29.71Мб |
| 8. Bipartite Matching.srt |
16.79Кб |
| 8. Computing Runtimes.mp4 |
30.00Мб |
| 8. Computing Runtimes.pdf |
3.61Мб |
| 8. Computing Runtimes.srt |
14.91Кб |
| 8. Currency Exchange.mp4 |
16.15Мб |
| 8. Currency Exchange.srt |
7.27Кб |
| 8. Final Algorithm 2.mp4 |
114.45Мб |
| 8. Final Algorithm 2.srt |
17.34Кб |
| 8. Final Remarks.mp4 |
20.02Мб |
| 8. Final Remarks.srt |
4.83Кб |
| 8. Linear Programming Formulations.mp4 |
22.02Мб |
| 8. Linear Programming Formulations.srt |
14.18Кб |
| 8. P and NP.mp4 |
20.62Мб |
| 8. P and NP.srt |
5.09Кб |
| 8. Performance of A.mp4 |
8.93Мб |
| 8. Performance of A.srt |
2.78Кб |
| 8. Phone Book Data Structure.mp4 |
36.93Мб |
| 8. Phone Book Data Structure.pdf |
387.66Кб |
| 8. Phone Book Data Structure.srt |
16.30Кб |
| 8. Reconstructing a Solution.mp4 |
34.19Мб |
| 8. Reconstructing a Solution.srt |
9.99Кб |
| 8. Shortest Path Tree.mp4 |
27.93Мб |
| 8. Shortest Path Tree.srt |
18.01Кб |
| 8. Suffix Array and Suffix Tree.mp4 |
30.49Мб |
| 8. Suffix Array and Suffix Tree.srt |
11.69Кб |
| 8. TSP Branch and Bound.mp4 |
22.54Мб |
| 8. TSP Branch and Bound.srt |
12.75Кб |
| 8. What is the Master Theorem.mp4 |
11.53Мб |
| 8. What is the Master Theorem.pdf |
265.70Кб |
| 8. What is the Master Theorem.srt |
7.00Кб |
| 83 |
575.10Кб |
| 83.a |
488.28Кб |
| 9. Asymptotic Notation.mp4 |
23.23Мб |
| 9. Asymptotic Notation.pdf |
171.38Кб |
| 9. Asymptotic Notation.srt |
10.22Кб |
| 9. Bidirectional A.mp4 |
27.64Мб |
| 9. Bidirectional A.srt |
8.57Кб |
| 9. Image Segmentation.mp4 |
17.74Мб |
| 9. Image Segmentation.srt |
11.24Кб |
| 9. LCP Array.mp4 |
22.08Мб |
| 9. LCP Array.srt |
14.50Кб |
| 9. Overview.mp4 |
30.22Мб |
| 9. Overview.pdf |
362.70Кб |
| 9. Overview.srt |
9.09Кб |
| 9. Proof of the Master Theorem.mp4 |
21.63Мб |
| 9. Proof of the Master Theorem.srt |
13.41Кб |
| 9. Proofs 1.mp4 |
40.21Мб |
| 9. Proofs 1.srt |
8.36Кб |
| 9. Reductions.mp4 |
24.82Мб |
| 9. Reductions.srt |
6.01Кб |
| 9. Reduction to Shortest Paths.mp4 |
27.01Мб |
| 9. Reduction to Shortest Paths.srt |
15.31Кб |
| 9. The Simplex Algorithm.mp4 |
28.13Мб |
| 9. The Simplex Algorithm.srt |
15.25Кб |
| 9. Universal Family.mp4 |
40.61Мб |
| 9. Universal Family.srt |
17.25Кб |
| 9. Vertex Cover.mp4 |
38.00Мб |
| 9. Vertex Cover.srt |
12.79Кб |
| ad_allocation.cpp |
1.02Кб |
| ad_allocation.py |
555б |
| AdAllocation.java |
1.99Кб |
| airline_crews.cpp |
1.63Кб |
| airline_crews.py |
1.05Кб |
| AirlineCrews.java |
2.62Кб |
| APlusB.cpp |
260б |
| APlusB.cs |
334б |
| APlusB.hs |
156б |
| APlusB.java |
363б |
| APlusB.js |
394б |
| APlusB.kt |
153б |
| APlusB.py |
200б |
| APlusB.rb |
43б |
| APlusB.rs |
281б |
| APlusB.scala |
290б |
| binary_search.cpp |
714б |
| binary_search.cpp |
714б |
| binary_search.js |
878б |
| binary_search.js |
878б |
| binary_search.py |
415б |
| binary_search.py |
424б |
| binary_search.rb |
280б |
| binary_search.rb |
280б |
| BinarySearch.java |
1.65Кб |
| BinarySearch.java |
1.65Кб |
| BinarySearch.kt |
1.30Кб |
| BinarySearch.kt |
1.30Кб |
| budget_allocation.cpp |
940б |
| budget_allocation.py |
464б |
| BudgetAllocation.java |
2.81Кб |
| build_heap.cpp |
1.36Кб |
| build_heap.py |
935б |
| BuildHeap.java |
2.47Кб |
| BurrowsWheelerTransform.java |
1.09Кб |
| bwmatching.cpp |
2.28Кб |
| BWMatching.java |
3.19Кб |
| bwmatching.py |
1.53Кб |
| bwt.cpp |
355б |
| bwt.py |
139б |
| bwtinverse.cpp |
362б |
| bwtinverse.py |
178б |
| car_fueling.cpp |
484б |
| car_fueling.py |
241б |
| CarFueling.java |
564б |
| cGbCsxWPEemU7w7-EFnPcg 70c8df70158f11e98c9e2961410808ba Programming-Assignment-3 pdf |
1.12Мб |
| change_dp.cpp |
168б |
| change_dp.py |
173б |
| change.cpp |
164б |
| change.hs |
170б |
| Change.java |
329б |
| Change.kt |
220б |
| change.py |
168б |
| change.rb |
198б |
| ChangeDP.java |
335б |
| ChangeDP.kt |
224б |
| check_brackets.cpp |
988б |
| check_brackets.java |
1.31Кб |
| check_brackets.py |
636б |
| circuit_design.cpp |
2.01Кб |
| circuit_design.py |
1017б |
| CircuitDesign.java |
4.24Кб |
| cleaning_apartment.cpp |
898б |
| cleaning_apartment.py |
390б |
| CleaningApartment.java |
2.91Кб |
| closest.cpp |
554б |
| Closest.java |
1.58Кб |
| Closest.kt |
1.27Кб |
| closest.py |
316б |
| closest.rb |
363б |
| common_substring.cpp |
602б |
| common_substring.java |
1.24Кб |
| common_substring.kt |
710б |
| common_substring.py |
442б |
| covering_segments.cpp |
746б |
| covering_segments.hs |
407б |
| covering_segments.py |
541б |
| covering_segments.rb |
450б |
| CoveringSegments.java |
1.10Кб |
| CoveringSegments.kt |
774б |
| cpp_naive.cpp |
951б |
| diet.cpp |
1.03Кб |
| Diet.java |
1.97Кб |
| diet.py |
567б |
| different_summands.cpp |
385б |
| different_summands.hs |
254б |
| different_summands.py |
301б |
| different_summands.rb |
249б |
| DifferentSummands.java |
573б |
| DifferentSummands.kt |
359б |
| dot_product.cpp |
538б |
| dot_product.hs |
274б |
| dot_product.py |
361б |
| dot_rpoduct.rb |
244б |
| DotProduct.java |
713б |
| DotProduct.kt |
534б |
| edit_distance.cpp |
299б |
| edit_distance.py |
150б |
| edit_distance.rb |
170б |
| EditDistance.java |
337б |
| EditDistance.kt |
266б |
| energy_values.cpp |
2.75Кб |
| energy_values.py |
2.12Кб |
| EnergyValues.java |
3.35Кб |
| evacuation.cpp |
2.43Кб |
| Evacuation.java |
3.80Кб |
| evacuation.py |
2.16Кб |
| fib_partial_sum.rb |
192б |
| fibonacci_huge.cpp |
483б |
| fibonacci_huge.hs |
315б |
| fibonacci_huge.js |
551б |
| fibonacci_huge.py |
373б |
| fibonacci_huge.rb |
163б |
| fibonacci_last_digit.cpp |
449б |
| fibonacci_last_digit.hs |
275б |
| fibonacci_last_digit.js |
377б |
| fibonacci_last_digit.py |
363б |
| fibonacci_last_digit.rb |
151б |
| fibonacci_partial_sum.cpp |
581б |
| fibonacci_partial_sum.hs |
515б |
| fibonacci_partial_sum.py |
416б |
| fibonacci_sum_last_digit.cpp |
488б |
| fibonacci_sum_last_digit.hs |
292б |
| fibonacci_sum_last_digit.py |
380б |
| fibonacci_sum_last_digit.rb |
174б |
| fibonacci_sum_squares.cpp |
514б |
| fibonacci_sum_squares.py |
392б |
| fibonacci.cpp |
1.48Кб |
| fibonacci.hs |
1.55Кб |
| Fibonacci.java |
330б |
| fibonacci.js |
377б |
| Fibonacci.kt |
242б |
| fibonacci.py |
149б |
| fibonacci.rb |
202б |
| FibonacciHuge.java |
660б |
| FibonacciHuge.kt |
484б |
| FibonacciLastDigit.java |
639б |
| FibonacciLastDigit.kt |
459б |
| FibonacciPartialSum.java |
724б |
| FibonacciPartialSum.kt |
543б |
| FibonacciSumLastDigit.java |
690б |
| FibonacciSumLastDigit.kt |
503б |
| FibonacciSumSquares.java |
712б |
| fractional_knapsack.cpp |
562б |
| fractional_knapsack.hs |
519б |
| fractional_knapsack.js |
917б |
| fractional_knapsack.py |
417б |
| fractional_knapsack.rb |
408б |
| FractionalKnapsack.java |
694б |
| FractionalKnapsack.kt |
511б |
| gcd.cpp |
356б |
| gcd.hs |
232б |
| GCD.java |
505б |
| gcd.js |
532б |
| GCD.kt |
458б |
| gcd.py |
351б |
| gcd.rb |
157б |
| gsm_network.cpp |
957б |
| gsm_network.py |
390б |
| GSMNetwork.java |
2.93Кб |
| hash_chains.cpp |
2.17Кб |
| hash_chains.py |
1.73Кб |
| hash_substring.cpp |
823б |
| hash_substring.py |
398б |
| HashChains.java |
3.43Кб |
| HashSubstring.java |
2.13Кб |
| InverseBWT.java |
1.07Кб |
| inversions.cpp |
711б |
| Inversions.java |
861б |
| Inversions.kt |
701б |
| inversions.py |
549б |
| inversions.rb |
641б |
| is_bst_hard.cpp |
750б |
| is_bst_hard.java |
1.86Кб |
| is_bst_hard.py |
536б |
| is_bst.cpp |
750б |
| is_bst.java |
1.85Кб |
| is_bst.py |
536б |
| java_naive.java |
876б |
| job_queue.cpp |
1.33Кб |
| job_queue.py |
795б |
| JobQueue.java |
2.25Кб |
| KD7TTY 2R1e-002P9rdXqw d2a08ff5428f4043b63ab0f12b48ae81 ProgrammingAssignment3 pdf |
493.88Кб |
| kmp.cpp |
675б |
| kmp.py |
462б |
| knapsack.cpp |
480б |
| Knapsack.java |
656б |
| Knapsack.kt |
541б |
| knapsack.py |
323б |
| knapsack.rb |
300б |
| KnuthMorrisPratt.java |
1.53Кб |
| largest_number.cpp |
511б |
| largest_number.hs |
232б |
| largest_number.py |
270б |
| largest_number.rb |
186б |
| LargestNumber.java |
580б |
| LargestNumber.kt |
347б |
| lcm.cpp |
293б |
| lcm.hs |
316б |
| LCM.java |
417б |
| LCM.kt |
342б |
| lcm.py |
275б |
| lcm.rb |
196б |
| lcs2.cpp |
466б |
| LCS2.java |
621б |
| LCS2.kt |
484б |
| lcs2.py |
349б |
| lcs3.cpp |
605б |
| LCS3.java |
811б |
| LCS3.kt |
640б |
| lcs3.py |
441б |
| lcs3.rb |
296б |
| majority_element.cpp |
456б |
| majority_element.py |
385б |
| majority_element.rb |
323б |
| MajorityElement.java |
1.44Кб |
| MajorityElement.kt |
1.07Кб |
| matching_with_mismatches.cpp |
384б |
| matching_with_mismatches.java |
1.02Кб |
| matching_with_mismatches.kt |
434б |
| matching_with_mismatches.py |
173б |
| max_pairwise_product.cpp |
642б |
| max_pairwise_product.js |
454б |
| max_pairwise_product.py |
420б |
| max_pairwise_product.rb |
407б |
| max_sliding_window.cpp |
621б |
| max_sliding_window.py |
424б |
| MaxPairwiseProduct.java |
1.52Кб |
| MaxPairwiseProduct.kt |
1.15Кб |
| merging_tables.cpp |
1.35Кб |
| merging_tables.py |
1.03Кб |
| MergingTables.java |
3.11Кб |
| non_shared_substring.cpp |
265б |
| non_shared_substring.py |
189б |
| NonSharedSubstring.java |
603б |
| pajHD6EJEemRkw79YeZlmg fdce28b486dd4126b96241b2c0a7655b Programming-Assignment-4 pdf |
1.56Мб |
| partition3.cpp |
299б |
| Partition3.java |
464б |
| Partition3.kt |
333б |
| partition3.py |
456б |
| phone_book.cpp |
2.08Кб |
| phone_book.py |
1.41Кб |
| PhoneBook.java |
3.34Кб |
| placing_parentheses.cpp |
535б |
| placing_parentheses.py |
327б |
| placing_parentheses.rb |
597б |
| PlacingParentheses.java |
659б |
| PlacingParentheses.kt |
398б |
| plan_party.cpp |
1.88Кб |
| plan_party.py |
1.26Кб |
| PlanParty.java |
2.33Кб |
| - PleaseRead -.pdf |
49.44Кб |
| points_and_segments.cpp |
988б |
| points_and_segments.py |
735б |
| points_and_segments.rb |
663б |
| PointsAndSegments.java |
1.30Кб |
| PointsAndSegments.kt |
1.04Кб |
| primitive_calculator.cpp |
605б |
| primitive_calculator.py |
419б |
| primitive_calculator.rb |
389б |
| PrimitiveCalculator.java |
811б |
| PrimitiveCalculator.kt |
551б |
| process_packages.cpp |
1.68Кб |
| process_packages.java |
2.35Кб |
| process_packages.py |
1014б |
| py_naive.py |
634б |
| reschedule_exams.cpp |
1.21Кб |
| reschedule_exams.py |
1005б |
| RescheduleExams.java |
1.60Кб |
| rope.cpp |
767б |
| rope.py |
386б |
| RopeProblem.java |
1.28Кб |
| sample1 |
5б |
| sample1 |
4б |
| sample1 |
7б |
| sample1 |
10б |
| sample1 |
10б |
| sample1 |
14б |
| sample1 |
5б |
| sample1 |
6б |
| sample1 |
6б |
| sample1 |
9б |
| sample1 |
6б |
| sample1 |
9б |
| sample1 |
10б |
| sample1.a |
3б |
| sample1.a |
7б |
| sample1.a |
22б |
| sample1.a |
3б |
| sample1.a |
3б |
| sample1.a |
1б |
| sample1.a |
3б |
| sample1.a |
4б |
| sample1.a |
7б |
| sample1.a |
0б |
| sample1.a |
7б |
| sample1.a |
5б |
| sample1.a |
8б |
| sample2 |
43б |
| sample2 |
6б |
| sample2 |
12б |
| sample2 |
8б |
| sample2 |
17б |
| sample2 |
16б |
| sample2 |
11б |
| sample2 |
9б |
| sample2 |
11б |
| sample2 |
11б |
| sample2 |
6б |
| sample2 |
13б |
| sample2 |
20б |
| sample2.a |
1б |
| sample2.a |
19б |
| sample2.a |
30б |
| sample2.a |
0б |
| sample2.a |
5б |
| sample2.a |
3б |
| sample2.a |
9б |
| sample2.a |
7б |
| sample2.a |
17б |
| sample2.a |
3б |
| sample2.a |
7б |
| sample2.a |
0б |
| sample2.a |
28б |
| sample3 |
33б |
| sample3 |
10б |
| sample3 |
17б |
| sample3 |
33б |
| sample3 |
22б |
| sample3 |
10б |
| sample3 |
18б |
| sample3 |
24б |
| sample3 |
11б |
| sample3 |
23б |
| sample3 |
30б |
| sample3.a |
2б |
| sample3.a |
54б |
| sample3.a |
70б |
| sample3.a |
9б |
| sample3.a |
3б |
| sample3.a |
8б |
| sample3.a |
37б |
| sample3.a |
5б |
| sample3.a |
17б |
| sample3.a |
7б |
| sample3.a |
38б |
| sample4 |
39б |
| sample4 |
18б |
| sample4.a |
5б |
| sample4.a |
37б |
| school_bus.cpp |
1.97Кб |
| school_bus.py |
1.26Кб |
| SchoolBus.java |
4.04Кб |
| set_range_sum.cpp |
4.83Кб |
| set_range_sum.py |
3.87Кб |
| SetRangeSum.java |
7.44Кб |
| sorting.cpp |
818б |
| Sorting.java |
2.13Кб |
| Sorting.kt |
1.63Кб |
| sorting.py |
736б |
| sorting.rb |
625б |
| stack_with_max_naive.cpp |
1.01Кб |
| stack_with_max_naive.py |
720б |
| StackWithMax.java |
1.28Кб |
| stock_charts.cpp |
1.98Кб |
| stock_charts.py |
1.45Кб |
| StockCharts.java |
3.05Кб |
| substring_equality.cpp |
464б |
| substring_equality.java |
1.15Кб |
| substring_equality.kt |
540б |
| substring_equality.py |
320б |
| suffix_array_long.cpp |
809б |
| suffix_array_long.py |
483б |
| suffix_array_matching.cpp |
1.08Кб |
| suffix_array_matching.py |
376б |
| suffix_array.cpp |
809б |
| suffix_array.py |
483б |
| suffix_tree_from_array.cpp |
3.67Кб |
| suffix_tree_from_array.py |
2.72Кб |
| suffix_tree.cpp |
671б |
| suffix_tree.py |
416б |
| SuffixArray.java |
1.77Кб |
| SuffixArrayLong.java |
1.85Кб |
| SuffixArrayMatching.java |
1.97Кб |
| SuffixTree.java |
1.39Кб |
| SuffixTreeFromArray.java |
5.14Кб |
| tree_height.java |
1.53Кб |
| tree_height.py |
861б |
| tree_orders.java |
2.26Кб |
| tree-height.cpp |
1.70Кб |
| tree-height.py |
918б |
| tree-orders.cpp |
1.92Кб |
| tree-orders.py |
1.25Кб |
| trie_matching_extended.cpp |
1.01Кб |
| trie_matching_extended.py |
447б |
| trie_matching.cpp |
1.10Кб |
| trie_matching.cs |
871б |
| trie_matching.py |
421б |
| trie.cpp |
652б |
| trie.cs |
982б |
| Trie.java |
1.66Кб |
| trie.py |
726б |
| TrieMatching.java |
1.31Кб |
| TrieMatchingExtended.java |
1.37Кб |
| week1_basic_data_structures.pdf |
258.99Кб |
| week1_programming_challenges.pdf |
615.29Кб |
| week2_algorithmic_warmup.pdf |
322.15Кб |
| week2_priority_queues_and_disjoint_sets.pdf |
242.26Кб |
| week3_greedy_algorithms.pdf |
2.99Мб |
| week3_hash_tables.pdf |
281.86Кб |
| week4_binary_search_trees.pdf |
260.47Кб |
| week4_divide_and_conquer.pdf |
522.73Кб |
| week5_dynamic_programming1.pdf |
411.65Кб |
| week6_dynamic_programming2.pdf |
410.26Кб |
| YDVyejmMEei2YRIlkZUGUg 60f31c30398c11e89865dd18147b3b43 Programming-Assignment-2 pdf |
922.27Кб |
| YY4a1RUGEeiphxJNEByLzA 6207de30150611e89226412850c98e76 14 algorithmic challenges 3 from suffix array to suffix tree pdf |
177.18Кб |