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