CINXE.COM
GitHub - jwasham/coding-interview-university: A complete computer science study plan to become a software engineer.
<!DOCTYPE html> <html lang="en" data-color-mode="auto" data-light-theme="light" data-dark-theme="dark" data-a11y-animated-images="system" data-a11y-link-underlines="true" > <head> <meta charset="utf-8"> <link rel="dns-prefetch" href="https://github.githubassets.com"> <link rel="dns-prefetch" href="https://avatars.githubusercontent.com"> <link rel="dns-prefetch" href="https://github-cloud.s3.amazonaws.com"> <link rel="dns-prefetch" href="https://user-images.githubusercontent.com/"> <link rel="preconnect" href="https://github.githubassets.com" crossorigin> <link rel="preconnect" href="https://avatars.githubusercontent.com"> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/light-7aa84bb7e11e.css" /><link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/dark-f65db3e8d171.css" /><link data-color-theme="dark_dimmed" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/dark_dimmed-a8258e3c6dda.css" /><link data-color-theme="dark_high_contrast" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/dark_high_contrast-7e97d834719c.css" /><link data-color-theme="dark_colorblind" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/dark_colorblind-01d869f460be.css" /><link data-color-theme="light_colorblind" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/light_colorblind-534f3e971240.css" /><link data-color-theme="light_high_contrast" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/light_high_contrast-a8cc7d138001.css" /><link data-color-theme="light_tritanopia" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/light_tritanopia-35e9dfdc4f9f.css" /><link data-color-theme="dark_tritanopia" crossorigin="anonymous" media="all" rel="stylesheet" data-href="https://github.githubassets.com/assets/dark_tritanopia-cf4cc5f62dfe.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/primer-primitives-d9abecd14f1e.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/primer-93aded0ee8a1.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/global-8bed0685a4b5.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/github-a954a02d9269.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/repository-4fce88777fa8.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/code-0210be90f4d3.css" /> <script type="application/json" id="client-env">{"locale":"en","featureFlags":["bypass_copilot_indexing_quota","copilot_immersive_file_preview","copilot_new_references_ui","copilot_bing_skill_ga","copilot_attach_folder_reference","copilot_personal_instructions","copilot_personal_instructions_templates","copilot_chat_repo_custom_instructions_preview","copilot_chat_retry_on_error","copilot_chat_persist_submitted_input","copilot_conversational_ux_history_refs","copilot_chat_shared_chat_input","copilot_chat_shared_topic_indicator","copilot_chat_shared_repo_sso_banner","copilot_editor_upsells","copilot_dotcom_chat_reduce_telemetry","copilot_implicit_context","copilot_no_floating_button","copilot_smell_icebreaker_ux","copilot_read_shared_conversation","dotcom_chat_client_side_skills","copilot_new_markdown_renderer","experimentation_azure_variant_endpoint","failbot_handle_non_errors","geojson_azure_maps","ghost_pilot_confidence_truncation_25","ghost_pilot_confidence_truncation_40","github_models_o3_mini_streaming","hovercard_accessibility","issues_react_remove_placeholders","issues_react_blur_item_picker_on_close","issues_react_include_bots_in_pickers","marketing_pages_search_explore_provider","remove_child_patch","sample_network_conn_type","swp_enterprise_contact_form","site_copilot_vscode_link_update","site_proxima_australia_update","issues_react_create_milestone","issues_react_cache_fix_workaround","lifecycle_label_name_updates"]}</script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/wp-runtime-8f98335c0ff3.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_oddbird_popover-polyfill_dist_popover_js-9da652f58479.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_arianotify-polyfill_ariaNotify-polyfill_js-node_modules_github_mi-3abb8f-d7e6bc799724.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_failbot_failbot_ts-4600dbf2d60a.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/environment-f04cb2a9fc8c.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_primer_behaviors_dist_esm_index_mjs-0dbb79f97f8f.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_selector-observer_dist_index_esm_js-f690fd9ae3d5.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_relative-time-element_dist_index_js-f6da4b3fa34c.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_auto-complete-element_dist_index_js-node_modules_github_catalyst_-8e9f78-a74b4e0a8a6b.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_text-expander-element_dist_index_js-78748950cb0c.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_filter-input-element_dist_index_js-node_modules_github_remote-inp-b5f1d7-a1760ffda83d.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_markdown-toolbar-element_dist_index_js-ceef33f593fa.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_file-attachment-element_dist_index_js-node_modules_primer_view-co-c44a69-f0c8a795d1fd.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/github-elements-44d18ad044b3.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/element-registry-b7096f9a808d.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_braintree_browser-detection_dist_browser-detection_js-node_modules_githu-2906d7-2a07a295af40.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_lit-html_lit-html_js-be8cb88f481b.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_mini-throttle_dist_index_js-node_modules_morphdom_dist_morphdom-e-7c534c-a4a1922eb55f.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_turbo_dist_turbo_es2017-esm_js-e3cbe28f1638.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_remote-form_dist_index_js-node_modules_delegated-events_dist_inde-893f9f-6cf3320416b8.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_color-convert_index_js-e3180fe3bcb3.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_quote-selection_dist_index_js-node_modules_github_session-resume_-947061-205cd97df772.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_updatable-content_updatable-content_ts-a1563f62660e.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/app_assets_modules_github_behaviors_task-list_ts-app_assets_modules_github_sso_ts-ui_packages-900dde-f48a418a99d4.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/app_assets_modules_github_sticky-scroll-into-view_ts-8fa27fd7fbb6.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/app_assets_modules_github_behaviors_ajax-error_ts-app_assets_modules_github_behaviors_include-87a4ae-e2caa5390f5a.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/app_assets_modules_github_behaviors_commenting_edit_ts-app_assets_modules_github_behaviors_ht-83c235-783fc7e142e5.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/behaviors-854fa1987fb5.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_delegated-events_dist_index_js-node_modules_github_catalyst_lib_index_js-f6223d90c7ba.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/notifications-global-e12489347ccf.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_virtualized-list_es_index_js-node_modules_github_template-parts_lib_index_js-96453a51f920.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_remote-form_dist_index_js-node_modules_delegated-events_dist_inde-70450e-eecf0d50276f.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/app_assets_modules_github_ref-selector_ts-0a7bffd2f129.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/codespaces-fe2c516230f3.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_filter-input-element_dist_index_js-node_modules_github_remote-inp-3eebbd-0763620ad7bf.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_mini-throttle_dist_decorators_js-node_modules_delegated-events_di-e161aa-9d41fb1b6c9e.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_file-attachment-element_dist_index_js-node_modules_github_remote--3c9c82-7238cfcdaa51.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/repositories-a4509a8583cd.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_mini-throttle_dist_index_js-node_modules_github_catalyst_lib_inde-dbbea9-26cce2010167.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/code-menu-6a5f60eab447.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/primer-react-8e38c0ecf8b7.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/react-core-218ef2d63cca.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/react-lib-f1bca44e0926.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/octicons-react-611691cca2f6.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_emotion_is-prop-valid_dist_emotion-is-prop-valid_esm_js-node_modules_emo-62da9f-2df2f32ec596.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_mini-throttle_dist_index_js-node_modules_stacktrace-parser_dist_s-e7dcdd-f7cc96ebae76.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_oddbird_popover-polyfill_dist_popover-fn_js-55fea94174bf.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/notifications-subscriptions-menu-eff84ecbf2b6.js"></script> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/primer-react.f5cae0c610a2c4c470c2.module.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/notifications-subscriptions-menu.1bcff9205c241e99cff2.module.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/primer-react.f5cae0c610a2c4c470c2.module.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/notifications-subscriptions-menu.1bcff9205c241e99cff2.module.css" /> <title>GitHub - jwasham/coding-interview-university: A complete computer science study plan to become a software engineer.</title> <meta name="route-pattern" content="/:user_id/:repository" data-turbo-transient> <meta name="route-controller" content="files" data-turbo-transient> <meta name="route-action" content="disambiguate" data-turbo-transient> <meta name="current-catalog-service-hash" content="f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb"> <meta name="request-id" content="927C:376434:6F7D2:80CB7:67B31520" data-pjax-transient="true"/><meta name="html-safe-nonce" content="a13795b34c3fb82798e283f354106ab7b93a59d6967ea0e98bd2fb8bd4acfb20" data-pjax-transient="true"/><meta name="visitor-payload" content="eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5MjdDOjM3NjQzNDo2RjdEMjo4MENCNzo2N0IzMTUyMCIsInZpc2l0b3JfaWQiOiI2MzQ3MTgxNzE5MjI5NzI4IiwicmVnaW9uX2VkZ2UiOiJzb3V0aGVhc3Rhc2lhIiwicmVnaW9uX3JlbmRlciI6InNvdXRoZWFzdGFzaWEifQ==" data-pjax-transient="true"/><meta name="visitor-hmac" content="53f5abcd55f4a8965b7b19b3a86af2f10281022744e2f707e36451f1df0562af" data-pjax-transient="true"/> <meta name="hovercard-subject-tag" content="repository:60493101" data-turbo-transient> <meta name="github-keyboard-shortcuts" content="repository,copilot" data-turbo-transient="true" /> <meta name="selected-link" value="repo_source" data-turbo-transient> <link rel="assets" href="https://github.githubassets.com/"> <meta name="google-site-verification" content="Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I"> <meta name="octolytics-url" content="https://collector.github.com/github/collect" /> <meta name="analytics-location" content="/<user-name>/<repo-name>" data-turbo-transient="true" /> <meta name="user-login" content=""> <meta name="viewport" content="width=device-width"> <meta name="description" content="A complete computer science study plan to become a software engineer. - jwasham/coding-interview-university"> <link rel="search" type="application/opensearchdescription+xml" href="/opensearch.xml" title="GitHub"> <link rel="fluid-icon" href="https://github.com/fluidicon.png" title="GitHub"> <meta property="fb:app_id" content="1401488693436528"> <meta name="apple-itunes-app" content="app-id=1477376905, app-argument=https://github.com/jwasham/coding-interview-university" /> <meta name="twitter:image" content="https://repository-images.githubusercontent.com/60493101/4ed59900-87ab-11ea-9e39-99741f040a83" /><meta name="twitter:site" content="@github" /><meta name="twitter:card" content="summary_large_image" /><meta name="twitter:title" content="GitHub - jwasham/coding-interview-university: A complete computer science study plan to become a software engineer." /><meta name="twitter:description" content="A complete computer science study plan to become a software engineer. - jwasham/coding-interview-university" /> <meta property="og:image" content="https://repository-images.githubusercontent.com/60493101/4ed59900-87ab-11ea-9e39-99741f040a83" /><meta property="og:image:alt" content="A complete computer science study plan to become a software engineer. - jwasham/coding-interview-university" /><meta property="og:site_name" content="GitHub" /><meta property="og:type" content="object" /><meta property="og:title" content="GitHub - jwasham/coding-interview-university: A complete computer science study plan to become a software engineer." /><meta property="og:url" content="https://github.com/jwasham/coding-interview-university" /><meta property="og:description" content="A complete computer science study plan to become a software engineer. - jwasham/coding-interview-university" /> <meta name="hostname" content="github.com"> <meta name="expected-hostname" content="github.com"> <meta http-equiv="x-pjax-version" content="7285c1d48b26dbf4a947aa96973b0576ccc264b2eed60ad331fecccb5cc407f9" data-turbo-track="reload"> <meta http-equiv="x-pjax-csp-version" content="ace39c3b6632770952207593607e6e0be0db363435a8b877b1f96abe6430f345" data-turbo-track="reload"> <meta http-equiv="x-pjax-css-version" content="1c71206221e00a0a8e77d94d48d954f34ddbd711c4a0ced954fd49cd786cfa61" data-turbo-track="reload"> <meta http-equiv="x-pjax-js-version" content="e957203196628458a3ddb1546cfef8b3b07cafa937f5a0542f0fb75f6273f835" data-turbo-track="reload"> <meta name="turbo-cache-control" content="no-preview" data-turbo-transient=""> <meta data-hydrostats="publish"> <meta name="go-import" content="github.com/jwasham/coding-interview-university git https://github.com/jwasham/coding-interview-university.git"> <meta name="octolytics-dimension-user_id" content="3771963" /><meta name="octolytics-dimension-user_login" content="jwasham" /><meta name="octolytics-dimension-repository_id" content="60493101" /><meta name="octolytics-dimension-repository_nwo" content="jwasham/coding-interview-university" /><meta name="octolytics-dimension-repository_public" content="true" /><meta name="octolytics-dimension-repository_is_fork" content="false" /><meta name="octolytics-dimension-repository_network_root_id" content="60493101" /><meta name="octolytics-dimension-repository_network_root_nwo" content="jwasham/coding-interview-university" /> <link rel="canonical" href="https://github.com/jwasham/coding-interview-university" data-turbo-transient> <meta name="turbo-body-classes" content="logged-out env-production page-responsive"> <meta name="browser-stats-url" content="https://api.github.com/_private/browser/stats"> <meta name="browser-errors-url" content="https://api.github.com/_private/browser/errors"> <link rel="mask-icon" href="https://github.githubassets.com/assets/pinned-octocat-093da3e6fa40.svg" color="#000000"> <link rel="alternate icon" class="js-site-favicon" type="image/png" href="https://github.githubassets.com/favicons/favicon.png"> <link rel="icon" class="js-site-favicon" type="image/svg+xml" href="https://github.githubassets.com/favicons/favicon.svg" data-base-href="https://github.githubassets.com/favicons/favicon"> <meta name="theme-color" content="#1e2327"> <meta name="color-scheme" content="light dark" /> <link rel="manifest" href="/manifest.json" crossOrigin="use-credentials"> </head> <body class="logged-out env-production page-responsive" style="word-wrap: break-word;"> <div data-turbo-body class="logged-out env-production page-responsive" style="word-wrap: break-word;"> <div class="position-relative header-wrapper js-header-wrapper "> <a href="#start-of-content" data-skip-target-assigned="false" class="px-2 py-4 color-bg-accent-emphasis color-fg-on-emphasis show-on-focus js-skip-to-content">Skip to content</a> <span data-view-component="true" class="progress-pjax-loader Progress position-fixed width-full"> <span style="width: 0%;" data-view-component="true" class="Progress-item progress-pjax-loader-bar left-0 top-0 color-bg-accent-emphasis"></span> </span> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_ui-commands_ui-commands_ts-e571874765ef.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/keyboard-shortcuts-dialog-765cf28766da.js"></script> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/primer-react.f5cae0c610a2c4c470c2.module.css" /> <react-partial partial-name="keyboard-shortcuts-dialog" data-ssr="false" data-attempted-ssr="false" > <script type="application/json" data-target="react-partial.embeddedData">{"props":{"docsUrl":"https://docs.github.com/get-started/accessibility/keyboard-shortcuts"}}</script> <div data-target="react-partial.reactRoot"></div> </react-partial> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_remote-form_dist_index_js-node_modules_delegated-events_dist_inde-94fd67-73b675cf164a.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/sessions-2d195d11c56b.js"></script> <header class="HeaderMktg header-logged-out js-details-container js-header Details f4 py-3" role="banner" data-is-top="true" data-color-mode=light data-light-theme=light data-dark-theme=dark> <h2 class="sr-only">Navigation Menu</h2> <button type="button" class="HeaderMktg-backdrop d-lg-none border-0 position-fixed top-0 left-0 width-full height-full js-details-target" aria-label="Toggle navigation"> <span class="d-none">Toggle navigation</span> </button> <div class="d-flex flex-column flex-lg-row flex-items-center px-3 px-md-4 px-lg-5 height-full position-relative z-1"> <div class="d-flex flex-justify-between flex-items-center width-full width-lg-auto"> <div class="flex-1"> <button aria-label="Toggle navigation" aria-expanded="false" type="button" data-view-component="true" class="js-details-target js-nav-padding-recalculate js-header-menu-toggle Button--link Button--medium Button d-lg-none color-fg-inherit p-1"> <span class="Button-content"> <span class="Button-label"><div class="HeaderMenu-toggle-bar rounded my-1"></div> <div class="HeaderMenu-toggle-bar rounded my-1"></div> <div class="HeaderMenu-toggle-bar rounded my-1"></div></span> </span> </button> </div> <a class="mr-lg-3 color-fg-inherit flex-order-2 js-prevent-focus-on-mobile-nav" href="/" aria-label="Homepage" data-analytics-event="{"category":"Marketing nav","action":"click to go to homepage","label":"ref_page:Marketing;ref_cta:Logomark;ref_loc:Header"}"> <svg height="32" aria-hidden="true" viewBox="0 0 24 24" version="1.1" width="32" data-view-component="true" class="octicon octicon-mark-github"> <path d="M12.5.75C6.146.75 1 5.896 1 12.25c0 5.089 3.292 9.387 7.863 10.91.575.101.79-.244.79-.546 0-.273-.014-1.178-.014-2.142-2.889.532-3.636-.704-3.866-1.35-.13-.331-.69-1.352-1.18-1.625-.402-.216-.977-.748-.014-.762.906-.014 1.553.834 1.769 1.179 1.035 1.74 2.688 1.25 3.349.948.1-.747.402-1.25.733-1.538-2.559-.287-5.232-1.279-5.232-5.678 0-1.25.445-2.285 1.178-3.09-.115-.288-.517-1.467.115-3.048 0 0 .963-.302 3.163 1.179.92-.259 1.897-.388 2.875-.388.977 0 1.955.13 2.875.388 2.2-1.495 3.162-1.179 3.162-1.179.633 1.581.23 2.76.115 3.048.733.805 1.179 1.825 1.179 3.09 0 4.413-2.688 5.39-5.247 5.678.417.36.776 1.05.776 2.128 0 1.538-.014 2.774-.014 3.162 0 .302.216.662.79.547C20.709 21.637 24 17.324 24 12.25 24 5.896 18.854.75 12.5.75Z"></path> </svg> </a> <div class="flex-1 flex-order-2 text-right"> <a href="/login?return_to=https%3A%2F%2Fgithub.com%2Fjwasham%2Fcoding-interview-university" class="HeaderMenu-link HeaderMenu-button d-inline-flex d-lg-none flex-order-1 f5 no-underline border color-border-default rounded-2 px-2 py-1 color-fg-inherit js-prevent-focus-on-mobile-nav" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"site header menu","repository_id":null,"auth_type":"SIGN_UP","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="5ff38f5702d44f732ac5f7348719a1dd875d6e03f7b3cadfdfc22446d493f0ef" data-analytics-event="{"category":"Marketing nav","action":"click to Sign in","label":"ref_page:Marketing;ref_cta:Sign in;ref_loc:Header"}" > Sign in </a> </div> </div> <div class="HeaderMenu js-header-menu height-fit position-lg-relative d-lg-flex flex-column flex-auto top-0"> <div class="HeaderMenu-wrapper d-flex flex-column flex-self-start flex-lg-row flex-auto rounded rounded-lg-0"> <nav class="HeaderMenu-nav" aria-label="Global"> <ul class="d-lg-flex list-style-none"> <li class="HeaderMenu-item position-relative flex-wrap flex-justify-between flex-items-center d-block d-lg-flex flex-lg-nowrap flex-lg-items-center js-details-container js-header-menu-item"> <button type="button" class="HeaderMenu-link border-0 width-full width-lg-auto px-0 px-lg-2 py-lg-2 no-wrap d-flex flex-items-center flex-justify-between js-details-target" aria-expanded="false"> Product <svg opacity="0.5" aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-chevron-down HeaderMenu-icon ml-1"> <path d="M12.78 5.22a.749.749 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.06 0L3.22 6.28a.749.749 0 1 1 1.06-1.06L8 8.939l3.72-3.719a.749.749 0 0 1 1.06 0Z"></path> </svg> </button> <div class="HeaderMenu-dropdown dropdown-menu rounded m-0 p-0 pt-2 pt-lg-4 position-relative position-lg-absolute left-0 left-lg-n3 pb-2 pb-lg-4 d-lg-flex flex-wrap dropdown-menu-wide"> <div class="HeaderMenu-column px-lg-4 border-lg-right mb-4 mb-lg-0 pr-lg-7"> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0"> <ul class="list-style-none f5" > <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"github_copilot","context":"product","tag":"link","label":"github_copilot_link_product_navbar"}" href="https://github.com/features/copilot"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-copilot color-fg-subtle mr-3"> <path d="M23.922 16.992c-.861 1.495-5.859 5.023-11.922 5.023-6.063 0-11.061-3.528-11.922-5.023A.641.641 0 0 1 0 16.736v-2.869a.841.841 0 0 1 .053-.22c.372-.935 1.347-2.292 2.605-2.656.167-.429.414-1.055.644-1.517a10.195 10.195 0 0 1-.052-1.086c0-1.331.282-2.499 1.132-3.368.397-.406.89-.717 1.474-.952 1.399-1.136 3.392-2.093 6.122-2.093 2.731 0 4.767.957 6.166 2.093.584.235 1.077.546 1.474.952.85.869 1.132 2.037 1.132 3.368 0 .368-.014.733-.052 1.086.23.462.477 1.088.644 1.517 1.258.364 2.233 1.721 2.605 2.656a.832.832 0 0 1 .053.22v2.869a.641.641 0 0 1-.078.256ZM12.172 11h-.344a4.323 4.323 0 0 1-.355.508C10.703 12.455 9.555 13 7.965 13c-1.725 0-2.989-.359-3.782-1.259a2.005 2.005 0 0 1-.085-.104L4 11.741v6.585c1.435.779 4.514 2.179 8 2.179 3.486 0 6.565-1.4 8-2.179v-6.585l-.098-.104s-.033.045-.085.104c-.793.9-2.057 1.259-3.782 1.259-1.59 0-2.738-.545-3.508-1.492a4.323 4.323 0 0 1-.355-.508h-.016.016Zm.641-2.935c.136 1.057.403 1.913.878 2.497.442.544 1.134.938 2.344.938 1.573 0 2.292-.337 2.657-.751.384-.435.558-1.15.558-2.361 0-1.14-.243-1.847-.705-2.319-.477-.488-1.319-.862-2.824-1.025-1.487-.161-2.192.138-2.533.529-.269.307-.437.808-.438 1.578v.021c0 .265.021.562.063.893Zm-1.626 0c.042-.331.063-.628.063-.894v-.02c-.001-.77-.169-1.271-.438-1.578-.341-.391-1.046-.69-2.533-.529-1.505.163-2.347.537-2.824 1.025-.462.472-.705 1.179-.705 2.319 0 1.211.175 1.926.558 2.361.365.414 1.084.751 2.657.751 1.21 0 1.902-.394 2.344-.938.475-.584.742-1.44.878-2.497Z"></path><path d="M14.5 14.25a1 1 0 0 1 1 1v2a1 1 0 0 1-2 0v-2a1 1 0 0 1 1-1Zm-5 0a1 1 0 0 1 1 1v2a1 1 0 0 1-2 0v-2a1 1 0 0 1 1-1Z"></path> </svg> <div> <div class="color-fg-default h4">GitHub Copilot</div> Write better code with AI </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"security","context":"product","tag":"link","label":"security_link_product_navbar"}" href="https://github.com/features/security"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-shield-check color-fg-subtle mr-3"> <path d="M16.53 9.78a.75.75 0 0 0-1.06-1.06L11 13.19l-1.97-1.97a.75.75 0 0 0-1.06 1.06l2.5 2.5a.75.75 0 0 0 1.06 0l5-5Z"></path><path d="m12.54.637 8.25 2.675A1.75 1.75 0 0 1 22 4.976V10c0 6.19-3.771 10.704-9.401 12.83a1.704 1.704 0 0 1-1.198 0C5.77 20.705 2 16.19 2 10V4.976c0-.758.489-1.43 1.21-1.664L11.46.637a1.748 1.748 0 0 1 1.08 0Zm-.617 1.426-8.25 2.676a.249.249 0 0 0-.173.237V10c0 5.46 3.28 9.483 8.43 11.426a.199.199 0 0 0 .14 0C17.22 19.483 20.5 15.461 20.5 10V4.976a.25.25 0 0 0-.173-.237l-8.25-2.676a.253.253 0 0 0-.154 0Z"></path> </svg> <div> <div class="color-fg-default h4">Security</div> Find and fix vulnerabilities </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"actions","context":"product","tag":"link","label":"actions_link_product_navbar"}" href="https://github.com/features/actions"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-workflow color-fg-subtle mr-3"> <path d="M1 3a2 2 0 0 1 2-2h6.5a2 2 0 0 1 2 2v6.5a2 2 0 0 1-2 2H7v4.063C7 16.355 7.644 17 8.438 17H12.5v-2.5a2 2 0 0 1 2-2H21a2 2 0 0 1 2 2V21a2 2 0 0 1-2 2h-6.5a2 2 0 0 1-2-2v-2.5H8.437A2.939 2.939 0 0 1 5.5 15.562V11.5H3a2 2 0 0 1-2-2Zm2-.5a.5.5 0 0 0-.5.5v6.5a.5.5 0 0 0 .5.5h6.5a.5.5 0 0 0 .5-.5V3a.5.5 0 0 0-.5-.5ZM14.5 14a.5.5 0 0 0-.5.5V21a.5.5 0 0 0 .5.5H21a.5.5 0 0 0 .5-.5v-6.5a.5.5 0 0 0-.5-.5Z"></path> </svg> <div> <div class="color-fg-default h4">Actions</div> Automate any workflow </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"codespaces","context":"product","tag":"link","label":"codespaces_link_product_navbar"}" href="https://github.com/features/codespaces"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-codespaces color-fg-subtle mr-3"> <path d="M3.5 3.75C3.5 2.784 4.284 2 5.25 2h13.5c.966 0 1.75.784 1.75 1.75v7.5A1.75 1.75 0 0 1 18.75 13H5.25a1.75 1.75 0 0 1-1.75-1.75Zm-2 12c0-.966.784-1.75 1.75-1.75h17.5c.966 0 1.75.784 1.75 1.75v4a1.75 1.75 0 0 1-1.75 1.75H3.25a1.75 1.75 0 0 1-1.75-1.75ZM5.25 3.5a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h13.5a.25.25 0 0 0 .25-.25v-7.5a.25.25 0 0 0-.25-.25Zm-2 12a.25.25 0 0 0-.25.25v4c0 .138.112.25.25.25h17.5a.25.25 0 0 0 .25-.25v-4a.25.25 0 0 0-.25-.25Z"></path><path d="M10 17.75a.75.75 0 0 1 .75-.75h6.5a.75.75 0 0 1 0 1.5h-6.5a.75.75 0 0 1-.75-.75Zm-4 0a.75.75 0 0 1 .75-.75h.5a.75.75 0 0 1 0 1.5h-.5a.75.75 0 0 1-.75-.75Z"></path> </svg> <div> <div class="color-fg-default h4">Codespaces</div> Instant dev environments </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"issues","context":"product","tag":"link","label":"issues_link_product_navbar"}" href="https://github.com/features/issues"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-issue-opened color-fg-subtle mr-3"> <path d="M12 1c6.075 0 11 4.925 11 11s-4.925 11-11 11S1 18.075 1 12 5.925 1 12 1ZM2.5 12a9.5 9.5 0 0 0 9.5 9.5 9.5 9.5 0 0 0 9.5-9.5A9.5 9.5 0 0 0 12 2.5 9.5 9.5 0 0 0 2.5 12Zm9.5 2a2 2 0 1 1-.001-3.999A2 2 0 0 1 12 14Z"></path> </svg> <div> <div class="color-fg-default h4">Issues</div> Plan and track work </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"code_review","context":"product","tag":"link","label":"code_review_link_product_navbar"}" href="https://github.com/features/code-review"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-code-review color-fg-subtle mr-3"> <path d="M10.3 6.74a.75.75 0 0 1-.04 1.06l-2.908 2.7 2.908 2.7a.75.75 0 1 1-1.02 1.1l-3.5-3.25a.75.75 0 0 1 0-1.1l3.5-3.25a.75.75 0 0 1 1.06.04Zm3.44 1.06a.75.75 0 1 1 1.02-1.1l3.5 3.25a.75.75 0 0 1 0 1.1l-3.5 3.25a.75.75 0 1 1-1.02-1.1l2.908-2.7-2.908-2.7Z"></path><path d="M1.5 4.25c0-.966.784-1.75 1.75-1.75h17.5c.966 0 1.75.784 1.75 1.75v12.5a1.75 1.75 0 0 1-1.75 1.75h-9.69l-3.573 3.573A1.458 1.458 0 0 1 5 21.043V18.5H3.25a1.75 1.75 0 0 1-1.75-1.75ZM3.25 4a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h2.5a.75.75 0 0 1 .75.75v3.19l3.72-3.72a.749.749 0 0 1 .53-.22h10a.25.25 0 0 0 .25-.25V4.25a.25.25 0 0 0-.25-.25Z"></path> </svg> <div> <div class="color-fg-default h4">Code Review</div> Manage code changes </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"discussions","context":"product","tag":"link","label":"discussions_link_product_navbar"}" href="https://github.com/features/discussions"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-comment-discussion color-fg-subtle mr-3"> <path d="M1.75 1h12.5c.966 0 1.75.784 1.75 1.75v9.5A1.75 1.75 0 0 1 14.25 14H8.061l-2.574 2.573A1.458 1.458 0 0 1 3 15.543V14H1.75A1.75 1.75 0 0 1 0 12.25v-9.5C0 1.784.784 1 1.75 1ZM1.5 2.75v9.5c0 .138.112.25.25.25h2a.75.75 0 0 1 .75.75v2.19l2.72-2.72a.749.749 0 0 1 .53-.22h6.5a.25.25 0 0 0 .25-.25v-9.5a.25.25 0 0 0-.25-.25H1.75a.25.25 0 0 0-.25.25Z"></path><path d="M22.5 8.75a.25.25 0 0 0-.25-.25h-3.5a.75.75 0 0 1 0-1.5h3.5c.966 0 1.75.784 1.75 1.75v9.5A1.75 1.75 0 0 1 22.25 20H21v1.543a1.457 1.457 0 0 1-2.487 1.03L15.939 20H10.75A1.75 1.75 0 0 1 9 18.25v-1.465a.75.75 0 0 1 1.5 0v1.465c0 .138.112.25.25.25h5.5a.75.75 0 0 1 .53.22l2.72 2.72v-2.19a.75.75 0 0 1 .75-.75h2a.25.25 0 0 0 .25-.25v-9.5Z"></path> </svg> <div> <div class="color-fg-default h4">Discussions</div> Collaborate outside of code </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description" data-analytics-event="{"location":"navbar","action":"code_search","context":"product","tag":"link","label":"code_search_link_product_navbar"}" href="https://github.com/features/code-search"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-code-square color-fg-subtle mr-3"> <path d="M10.3 8.24a.75.75 0 0 1-.04 1.06L7.352 12l2.908 2.7a.75.75 0 1 1-1.02 1.1l-3.5-3.25a.75.75 0 0 1 0-1.1l3.5-3.25a.75.75 0 0 1 1.06.04Zm3.44 1.06a.75.75 0 1 1 1.02-1.1l3.5 3.25a.75.75 0 0 1 0 1.1l-3.5 3.25a.75.75 0 1 1-1.02-1.1l2.908-2.7-2.908-2.7Z"></path><path d="M2 3.75C2 2.784 2.784 2 3.75 2h16.5c.966 0 1.75.784 1.75 1.75v16.5A1.75 1.75 0 0 1 20.25 22H3.75A1.75 1.75 0 0 1 2 20.25Zm1.75-.25a.25.25 0 0 0-.25.25v16.5c0 .138.112.25.25.25h16.5a.25.25 0 0 0 .25-.25V3.75a.25.25 0 0 0-.25-.25Z"></path> </svg> <div> <div class="color-fg-default h4">Code Search</div> Find more, search less </div> </a></li> </ul> </div> </div> <div class="HeaderMenu-column px-lg-4"> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0 border-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="product-explore-heading">Explore</span> <ul class="list-style-none f5" aria-labelledby="product-explore-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"all_features","context":"product","tag":"link","label":"all_features_link_product_navbar"}" href="https://github.com/features"> All features </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary Link--external" target="_blank" data-analytics-event="{"location":"navbar","action":"documentation","context":"product","tag":"link","label":"documentation_link_product_navbar"}" href="https://docs.github.com"> Documentation <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-link-external HeaderMenu-external-icon color-fg-subtle"> <path d="M3.75 2h3.5a.75.75 0 0 1 0 1.5h-3.5a.25.25 0 0 0-.25.25v8.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-3.5a.75.75 0 0 1 1.5 0v3.5A1.75 1.75 0 0 1 12.25 14h-8.5A1.75 1.75 0 0 1 2 12.25v-8.5C2 2.784 2.784 2 3.75 2Zm6.854-1h4.146a.25.25 0 0 1 .25.25v4.146a.25.25 0 0 1-.427.177L13.03 4.03 9.28 7.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.75-3.75-1.543-1.543A.25.25 0 0 1 10.604 1Z"></path> </svg> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary Link--external" target="_blank" data-analytics-event="{"location":"navbar","action":"github_skills","context":"product","tag":"link","label":"github_skills_link_product_navbar"}" href="https://skills.github.com"> GitHub Skills <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-link-external HeaderMenu-external-icon color-fg-subtle"> <path d="M3.75 2h3.5a.75.75 0 0 1 0 1.5h-3.5a.25.25 0 0 0-.25.25v8.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-3.5a.75.75 0 0 1 1.5 0v3.5A1.75 1.75 0 0 1 12.25 14h-8.5A1.75 1.75 0 0 1 2 12.25v-8.5C2 2.784 2.784 2 3.75 2Zm6.854-1h4.146a.25.25 0 0 1 .25.25v4.146a.25.25 0 0 1-.427.177L13.03 4.03 9.28 7.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.75-3.75-1.543-1.543A.25.25 0 0 1 10.604 1Z"></path> </svg> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary Link--external" target="_blank" data-analytics-event="{"location":"navbar","action":"blog","context":"product","tag":"link","label":"blog_link_product_navbar"}" href="https://github.blog"> Blog <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-link-external HeaderMenu-external-icon color-fg-subtle"> <path d="M3.75 2h3.5a.75.75 0 0 1 0 1.5h-3.5a.25.25 0 0 0-.25.25v8.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-3.5a.75.75 0 0 1 1.5 0v3.5A1.75 1.75 0 0 1 12.25 14h-8.5A1.75 1.75 0 0 1 2 12.25v-8.5C2 2.784 2.784 2 3.75 2Zm6.854-1h4.146a.25.25 0 0 1 .25.25v4.146a.25.25 0 0 1-.427.177L13.03 4.03 9.28 7.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.75-3.75-1.543-1.543A.25.25 0 0 1 10.604 1Z"></path> </svg> </a></li> </ul> </div> </div> </div> </li> <li class="HeaderMenu-item position-relative flex-wrap flex-justify-between flex-items-center d-block d-lg-flex flex-lg-nowrap flex-lg-items-center js-details-container js-header-menu-item"> <button type="button" class="HeaderMenu-link border-0 width-full width-lg-auto px-0 px-lg-2 py-lg-2 no-wrap d-flex flex-items-center flex-justify-between js-details-target" aria-expanded="false"> Solutions <svg opacity="0.5" aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-chevron-down HeaderMenu-icon ml-1"> <path d="M12.78 5.22a.749.749 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.06 0L3.22 6.28a.749.749 0 1 1 1.06-1.06L8 8.939l3.72-3.719a.749.749 0 0 1 1.06 0Z"></path> </svg> </button> <div class="HeaderMenu-dropdown dropdown-menu rounded m-0 p-0 pt-2 pt-lg-4 position-relative position-lg-absolute left-0 left-lg-n3 d-lg-flex flex-wrap dropdown-menu-wide"> <div class="HeaderMenu-column px-lg-4 border-lg-right mb-4 mb-lg-0 pr-lg-7"> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0 pb-lg-3 mb-3 mb-lg-0"> <span class="d-block h4 color-fg-default my-1" id="solutions-by-company-size-heading">By company size</span> <ul class="list-style-none f5" aria-labelledby="solutions-by-company-size-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"enterprises","context":"solutions","tag":"link","label":"enterprises_link_solutions_navbar"}" href="https://github.com/enterprise"> Enterprises </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"small_and_medium_teams","context":"solutions","tag":"link","label":"small_and_medium_teams_link_solutions_navbar"}" href="https://github.com/team"> Small and medium teams </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"startups","context":"solutions","tag":"link","label":"startups_link_solutions_navbar"}" href="https://github.com/enterprise/startups"> Startups </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"nonprofits","context":"solutions","tag":"link","label":"nonprofits_link_solutions_navbar"}" href="/solutions/industry/nonprofits"> Nonprofits </a></li> </ul> </div> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="solutions-by-use-case-heading">By use case</span> <ul class="list-style-none f5" aria-labelledby="solutions-by-use-case-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"devsecops","context":"solutions","tag":"link","label":"devsecops_link_solutions_navbar"}" href="/solutions/use-case/devsecops"> DevSecOps </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"devops","context":"solutions","tag":"link","label":"devops_link_solutions_navbar"}" href="/solutions/use-case/devops"> DevOps </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"ci_cd","context":"solutions","tag":"link","label":"ci_cd_link_solutions_navbar"}" href="/solutions/use-case/ci-cd"> CI/CD </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"view_all_use_cases","context":"solutions","tag":"link","label":"view_all_use_cases_link_solutions_navbar"}" href="/solutions/use-case"> View all use cases </a></li> </ul> </div> </div> <div class="HeaderMenu-column px-lg-4"> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="solutions-by-industry-heading">By industry</span> <ul class="list-style-none f5" aria-labelledby="solutions-by-industry-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"healthcare","context":"solutions","tag":"link","label":"healthcare_link_solutions_navbar"}" href="/solutions/industry/healthcare"> Healthcare </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"financial_services","context":"solutions","tag":"link","label":"financial_services_link_solutions_navbar"}" href="/solutions/industry/financial-services"> Financial services </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"manufacturing","context":"solutions","tag":"link","label":"manufacturing_link_solutions_navbar"}" href="/solutions/industry/manufacturing"> Manufacturing </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"government","context":"solutions","tag":"link","label":"government_link_solutions_navbar"}" href="/solutions/industry/government"> Government </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"view_all_industries","context":"solutions","tag":"link","label":"view_all_industries_link_solutions_navbar"}" href="/solutions/industry"> View all industries </a></li> </ul> </div> </div> <div class="HeaderMenu-trailing-link rounded-bottom-2 flex-shrink-0 mt-lg-4 px-lg-4 py-4 py-lg-3 f5 text-semibold"> <a href="/solutions"> View all solutions <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-chevron-right HeaderMenu-trailing-link-icon"> <path d="M6.22 3.22a.75.75 0 0 1 1.06 0l4.25 4.25a.75.75 0 0 1 0 1.06l-4.25 4.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L9.94 8 6.22 4.28a.75.75 0 0 1 0-1.06Z"></path> </svg> </a> </div> </div> </li> <li class="HeaderMenu-item position-relative flex-wrap flex-justify-between flex-items-center d-block d-lg-flex flex-lg-nowrap flex-lg-items-center js-details-container js-header-menu-item"> <button type="button" class="HeaderMenu-link border-0 width-full width-lg-auto px-0 px-lg-2 py-lg-2 no-wrap d-flex flex-items-center flex-justify-between js-details-target" aria-expanded="false"> Resources <svg opacity="0.5" aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-chevron-down HeaderMenu-icon ml-1"> <path d="M12.78 5.22a.749.749 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.06 0L3.22 6.28a.749.749 0 1 1 1.06-1.06L8 8.939l3.72-3.719a.749.749 0 0 1 1.06 0Z"></path> </svg> </button> <div class="HeaderMenu-dropdown dropdown-menu rounded m-0 p-0 pt-2 pt-lg-4 position-relative position-lg-absolute left-0 left-lg-n3 pb-2 pb-lg-4 d-lg-flex flex-wrap dropdown-menu-wide"> <div class="HeaderMenu-column px-lg-4 border-lg-right mb-4 mb-lg-0 pr-lg-7"> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="resources-topics-heading">Topics</span> <ul class="list-style-none f5" aria-labelledby="resources-topics-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"ai","context":"resources","tag":"link","label":"ai_link_resources_navbar"}" href="/resources/articles/ai"> AI </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"devops","context":"resources","tag":"link","label":"devops_link_resources_navbar"}" href="/resources/articles/devops"> DevOps </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"security","context":"resources","tag":"link","label":"security_link_resources_navbar"}" href="/resources/articles/security"> Security </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"software_development","context":"resources","tag":"link","label":"software_development_link_resources_navbar"}" href="/resources/articles/software-development"> Software Development </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"view_all","context":"resources","tag":"link","label":"view_all_link_resources_navbar"}" href="/resources/articles"> View all </a></li> </ul> </div> </div> <div class="HeaderMenu-column px-lg-4"> <div class="border-bottom pb-3 pb-lg-0 border-lg-bottom-0 border-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="resources-explore-heading">Explore</span> <ul class="list-style-none f5" aria-labelledby="resources-explore-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary Link--external" target="_blank" data-analytics-event="{"location":"navbar","action":"learning_pathways","context":"resources","tag":"link","label":"learning_pathways_link_resources_navbar"}" href="https://resources.github.com/learn/pathways"> Learning Pathways <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-link-external HeaderMenu-external-icon color-fg-subtle"> <path d="M3.75 2h3.5a.75.75 0 0 1 0 1.5h-3.5a.25.25 0 0 0-.25.25v8.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-3.5a.75.75 0 0 1 1.5 0v3.5A1.75 1.75 0 0 1 12.25 14h-8.5A1.75 1.75 0 0 1 2 12.25v-8.5C2 2.784 2.784 2 3.75 2Zm6.854-1h4.146a.25.25 0 0 1 .25.25v4.146a.25.25 0 0 1-.427.177L13.03 4.03 9.28 7.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.75-3.75-1.543-1.543A.25.25 0 0 1 10.604 1Z"></path> </svg> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary Link--external" target="_blank" data-analytics-event="{"location":"navbar","action":"white_papers_ebooks_webinars","context":"resources","tag":"link","label":"white_papers_ebooks_webinars_link_resources_navbar"}" href="https://resources.github.com"> White papers, Ebooks, Webinars <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-link-external HeaderMenu-external-icon color-fg-subtle"> <path d="M3.75 2h3.5a.75.75 0 0 1 0 1.5h-3.5a.25.25 0 0 0-.25.25v8.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-3.5a.75.75 0 0 1 1.5 0v3.5A1.75 1.75 0 0 1 12.25 14h-8.5A1.75 1.75 0 0 1 2 12.25v-8.5C2 2.784 2.784 2 3.75 2Zm6.854-1h4.146a.25.25 0 0 1 .25.25v4.146a.25.25 0 0 1-.427.177L13.03 4.03 9.28 7.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.75-3.75-1.543-1.543A.25.25 0 0 1 10.604 1Z"></path> </svg> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"customer_stories","context":"resources","tag":"link","label":"customer_stories_link_resources_navbar"}" href="https://github.com/customer-stories"> Customer Stories </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary Link--external" target="_blank" data-analytics-event="{"location":"navbar","action":"partners","context":"resources","tag":"link","label":"partners_link_resources_navbar"}" href="https://partner.github.com"> Partners <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-link-external HeaderMenu-external-icon color-fg-subtle"> <path d="M3.75 2h3.5a.75.75 0 0 1 0 1.5h-3.5a.25.25 0 0 0-.25.25v8.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-3.5a.75.75 0 0 1 1.5 0v3.5A1.75 1.75 0 0 1 12.25 14h-8.5A1.75 1.75 0 0 1 2 12.25v-8.5C2 2.784 2.784 2 3.75 2Zm6.854-1h4.146a.25.25 0 0 1 .25.25v4.146a.25.25 0 0 1-.427.177L13.03 4.03 9.28 7.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.75-3.75-1.543-1.543A.25.25 0 0 1 10.604 1Z"></path> </svg> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"executive_insights","context":"resources","tag":"link","label":"executive_insights_link_resources_navbar"}" href="https://github.com/solutions/executive-insights"> Executive Insights </a></li> </ul> </div> </div> </div> </li> <li class="HeaderMenu-item position-relative flex-wrap flex-justify-between flex-items-center d-block d-lg-flex flex-lg-nowrap flex-lg-items-center js-details-container js-header-menu-item"> <button type="button" class="HeaderMenu-link border-0 width-full width-lg-auto px-0 px-lg-2 py-lg-2 no-wrap d-flex flex-items-center flex-justify-between js-details-target" aria-expanded="false"> Open Source <svg opacity="0.5" aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-chevron-down HeaderMenu-icon ml-1"> <path d="M12.78 5.22a.749.749 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.06 0L3.22 6.28a.749.749 0 1 1 1.06-1.06L8 8.939l3.72-3.719a.749.749 0 0 1 1.06 0Z"></path> </svg> </button> <div class="HeaderMenu-dropdown dropdown-menu rounded m-0 p-0 pt-2 pt-lg-4 position-relative position-lg-absolute left-0 left-lg-n3 pb-2 pb-lg-4 px-lg-4"> <div class="HeaderMenu-column"> <div class="border-bottom pb-3 pb-lg-0 pb-lg-3 mb-3 mb-lg-0 mb-lg-3"> <ul class="list-style-none f5" > <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description" data-analytics-event="{"location":"navbar","action":"github_sponsors","context":"open_source","tag":"link","label":"github_sponsors_link_open_source_navbar"}" href="/sponsors"> <div> <div class="color-fg-default h4">GitHub Sponsors</div> Fund open source developers </div> </a></li> </ul> </div> <div class="border-bottom pb-3 pb-lg-0 pb-lg-3 mb-3 mb-lg-0 mb-lg-3"> <ul class="list-style-none f5" > <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description" data-analytics-event="{"location":"navbar","action":"the_readme_project","context":"open_source","tag":"link","label":"the_readme_project_link_open_source_navbar"}" href="https://github.com/readme"> <div> <div class="color-fg-default h4">The ReadME Project</div> GitHub community articles </div> </a></li> </ul> </div> <div class="border-bottom pb-3 pb-lg-0 border-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="open-source-repositories-heading">Repositories</span> <ul class="list-style-none f5" aria-labelledby="open-source-repositories-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"topics","context":"open_source","tag":"link","label":"topics_link_open_source_navbar"}" href="https://github.com/topics"> Topics </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"trending","context":"open_source","tag":"link","label":"trending_link_open_source_navbar"}" href="https://github.com/trending"> Trending </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary" data-analytics-event="{"location":"navbar","action":"collections","context":"open_source","tag":"link","label":"collections_link_open_source_navbar"}" href="https://github.com/collections"> Collections </a></li> </ul> </div> </div> </div> </li> <li class="HeaderMenu-item position-relative flex-wrap flex-justify-between flex-items-center d-block d-lg-flex flex-lg-nowrap flex-lg-items-center js-details-container js-header-menu-item"> <button type="button" class="HeaderMenu-link border-0 width-full width-lg-auto px-0 px-lg-2 py-lg-2 no-wrap d-flex flex-items-center flex-justify-between js-details-target" aria-expanded="false"> Enterprise <svg opacity="0.5" aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-chevron-down HeaderMenu-icon ml-1"> <path d="M12.78 5.22a.749.749 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.06 0L3.22 6.28a.749.749 0 1 1 1.06-1.06L8 8.939l3.72-3.719a.749.749 0 0 1 1.06 0Z"></path> </svg> </button> <div class="HeaderMenu-dropdown dropdown-menu rounded m-0 p-0 pt-2 pt-lg-4 position-relative position-lg-absolute left-0 left-lg-n3 pb-2 pb-lg-4 px-lg-4"> <div class="HeaderMenu-column"> <div class="border-bottom pb-3 pb-lg-0 pb-lg-3 mb-3 mb-lg-0 mb-lg-3"> <ul class="list-style-none f5" > <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description" data-analytics-event="{"location":"navbar","action":"enterprise_platform","context":"enterprise","tag":"link","label":"enterprise_platform_link_enterprise_navbar"}" href="/enterprise"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-stack color-fg-subtle mr-3"> <path d="M11.063 1.456a1.749 1.749 0 0 1 1.874 0l8.383 5.316a1.751 1.751 0 0 1 0 2.956l-8.383 5.316a1.749 1.749 0 0 1-1.874 0L2.68 9.728a1.751 1.751 0 0 1 0-2.956Zm1.071 1.267a.25.25 0 0 0-.268 0L3.483 8.039a.25.25 0 0 0 0 .422l8.383 5.316a.25.25 0 0 0 .268 0l8.383-5.316a.25.25 0 0 0 0-.422Z"></path><path d="M1.867 12.324a.75.75 0 0 1 1.035-.232l8.964 5.685a.25.25 0 0 0 .268 0l8.964-5.685a.75.75 0 0 1 .804 1.267l-8.965 5.685a1.749 1.749 0 0 1-1.874 0l-8.965-5.685a.75.75 0 0 1-.231-1.035Z"></path><path d="M1.867 16.324a.75.75 0 0 1 1.035-.232l8.964 5.685a.25.25 0 0 0 .268 0l8.964-5.685a.75.75 0 0 1 .804 1.267l-8.965 5.685a1.749 1.749 0 0 1-1.874 0l-8.965-5.685a.75.75 0 0 1-.231-1.035Z"></path> </svg> <div> <div class="color-fg-default h4">Enterprise platform</div> AI-powered developer platform </div> </a></li> </ul> </div> <div class="border-bottom pb-3 pb-lg-0 border-bottom-0"> <span class="d-block h4 color-fg-default my-1" id="enterprise-available-add-ons-heading">Available add-ons</span> <ul class="list-style-none f5" aria-labelledby="enterprise-available-add-ons-heading"> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"advanced_security","context":"enterprise","tag":"link","label":"advanced_security_link_enterprise_navbar"}" href="https://github.com/enterprise/advanced-security"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-shield-check color-fg-subtle mr-3"> <path d="M16.53 9.78a.75.75 0 0 0-1.06-1.06L11 13.19l-1.97-1.97a.75.75 0 0 0-1.06 1.06l2.5 2.5a.75.75 0 0 0 1.06 0l5-5Z"></path><path d="m12.54.637 8.25 2.675A1.75 1.75 0 0 1 22 4.976V10c0 6.19-3.771 10.704-9.401 12.83a1.704 1.704 0 0 1-1.198 0C5.77 20.705 2 16.19 2 10V4.976c0-.758.489-1.43 1.21-1.664L11.46.637a1.748 1.748 0 0 1 1.08 0Zm-.617 1.426-8.25 2.676a.249.249 0 0 0-.173.237V10c0 5.46 3.28 9.483 8.43 11.426a.199.199 0 0 0 .14 0C17.22 19.483 20.5 15.461 20.5 10V4.976a.25.25 0 0 0-.173-.237l-8.25-2.676a.253.253 0 0 0-.154 0Z"></path> </svg> <div> <div class="color-fg-default h4">Advanced Security</div> Enterprise-grade security features </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description pb-lg-3" data-analytics-event="{"location":"navbar","action":"github_copilot","context":"enterprise","tag":"link","label":"github_copilot_link_enterprise_navbar"}" href="/features/copilot#enterprise"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-copilot color-fg-subtle mr-3"> <path d="M23.922 16.992c-.861 1.495-5.859 5.023-11.922 5.023-6.063 0-11.061-3.528-11.922-5.023A.641.641 0 0 1 0 16.736v-2.869a.841.841 0 0 1 .053-.22c.372-.935 1.347-2.292 2.605-2.656.167-.429.414-1.055.644-1.517a10.195 10.195 0 0 1-.052-1.086c0-1.331.282-2.499 1.132-3.368.397-.406.89-.717 1.474-.952 1.399-1.136 3.392-2.093 6.122-2.093 2.731 0 4.767.957 6.166 2.093.584.235 1.077.546 1.474.952.85.869 1.132 2.037 1.132 3.368 0 .368-.014.733-.052 1.086.23.462.477 1.088.644 1.517 1.258.364 2.233 1.721 2.605 2.656a.832.832 0 0 1 .053.22v2.869a.641.641 0 0 1-.078.256ZM12.172 11h-.344a4.323 4.323 0 0 1-.355.508C10.703 12.455 9.555 13 7.965 13c-1.725 0-2.989-.359-3.782-1.259a2.005 2.005 0 0 1-.085-.104L4 11.741v6.585c1.435.779 4.514 2.179 8 2.179 3.486 0 6.565-1.4 8-2.179v-6.585l-.098-.104s-.033.045-.085.104c-.793.9-2.057 1.259-3.782 1.259-1.59 0-2.738-.545-3.508-1.492a4.323 4.323 0 0 1-.355-.508h-.016.016Zm.641-2.935c.136 1.057.403 1.913.878 2.497.442.544 1.134.938 2.344.938 1.573 0 2.292-.337 2.657-.751.384-.435.558-1.15.558-2.361 0-1.14-.243-1.847-.705-2.319-.477-.488-1.319-.862-2.824-1.025-1.487-.161-2.192.138-2.533.529-.269.307-.437.808-.438 1.578v.021c0 .265.021.562.063.893Zm-1.626 0c.042-.331.063-.628.063-.894v-.02c-.001-.77-.169-1.271-.438-1.578-.341-.391-1.046-.69-2.533-.529-1.505.163-2.347.537-2.824 1.025-.462.472-.705 1.179-.705 2.319 0 1.211.175 1.926.558 2.361.365.414 1.084.751 2.657.751 1.21 0 1.902-.394 2.344-.938.475-.584.742-1.44.878-2.497Z"></path><path d="M14.5 14.25a1 1 0 0 1 1 1v2a1 1 0 0 1-2 0v-2a1 1 0 0 1 1-1Zm-5 0a1 1 0 0 1 1 1v2a1 1 0 0 1-2 0v-2a1 1 0 0 1 1-1Z"></path> </svg> <div> <div class="color-fg-default h4">GitHub Copilot</div> Enterprise-grade AI features </div> </a></li> <li> <a class="HeaderMenu-dropdown-link d-block no-underline position-relative py-2 Link--secondary d-flex flex-items-center Link--has-description" data-analytics-event="{"location":"navbar","action":"premium_support","context":"enterprise","tag":"link","label":"premium_support_link_enterprise_navbar"}" href="/premium-support"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-comment-discussion color-fg-subtle mr-3"> <path d="M1.75 1h12.5c.966 0 1.75.784 1.75 1.75v9.5A1.75 1.75 0 0 1 14.25 14H8.061l-2.574 2.573A1.458 1.458 0 0 1 3 15.543V14H1.75A1.75 1.75 0 0 1 0 12.25v-9.5C0 1.784.784 1 1.75 1ZM1.5 2.75v9.5c0 .138.112.25.25.25h2a.75.75 0 0 1 .75.75v2.19l2.72-2.72a.749.749 0 0 1 .53-.22h6.5a.25.25 0 0 0 .25-.25v-9.5a.25.25 0 0 0-.25-.25H1.75a.25.25 0 0 0-.25.25Z"></path><path d="M22.5 8.75a.25.25 0 0 0-.25-.25h-3.5a.75.75 0 0 1 0-1.5h3.5c.966 0 1.75.784 1.75 1.75v9.5A1.75 1.75 0 0 1 22.25 20H21v1.543a1.457 1.457 0 0 1-2.487 1.03L15.939 20H10.75A1.75 1.75 0 0 1 9 18.25v-1.465a.75.75 0 0 1 1.5 0v1.465c0 .138.112.25.25.25h5.5a.75.75 0 0 1 .53.22l2.72 2.72v-2.19a.75.75 0 0 1 .75-.75h2a.25.25 0 0 0 .25-.25v-9.5Z"></path> </svg> <div> <div class="color-fg-default h4">Premium Support</div> Enterprise-grade 24/7 support </div> </a></li> </ul> </div> </div> </div> </li> <li class="HeaderMenu-item position-relative flex-wrap flex-justify-between flex-items-center d-block d-lg-flex flex-lg-nowrap flex-lg-items-center js-details-container js-header-menu-item"> <a class="HeaderMenu-link no-underline px-0 px-lg-2 py-3 py-lg-2 d-block d-lg-inline-block" data-analytics-event="{"location":"navbar","action":"pricing","context":"global","tag":"link","label":"pricing_link_global_navbar"}" href="https://github.com/pricing">Pricing</a> </li> </ul> </nav> <div class="d-flex flex-column flex-lg-row width-full flex-justify-end flex-lg-items-center text-center mt-3 mt-lg-0 text-lg-left ml-lg-3"> <qbsearch-input class="search-input" data-scope="repo:jwasham/coding-interview-university" data-custom-scopes-path="/search/custom_scopes" data-delete-custom-scopes-csrf="K-gVKsomEd2rGUEbgAEw3JabsRZMKYZ07c9WMnsh13FPobeauTfW7q7dGbM7-4FpShXiEi3UFy0wWPoWVFranw" data-max-custom-scopes="10" data-header-redesign-enabled="false" data-initial-value="" data-blackbird-suggestions-path="/search/suggestions" data-jump-to-suggestions-path="/_graphql/GetSuggestedNavigationDestinations" data-current-repository="jwasham/coding-interview-university" data-current-org="" data-current-owner="jwasham" data-logged-in="false" data-copilot-chat-enabled="false" data-nl-search-enabled="false" data-retain-scroll-position="true"> <div class="search-input-container search-with-dialog position-relative d-flex flex-row flex-items-center mr-4 rounded" data-action="click:qbsearch-input#searchInputContainerClicked" > <button type="button" class="header-search-button placeholder input-button form-control d-flex flex-1 flex-self-stretch flex-items-center no-wrap width-full py-0 pl-2 pr-0 text-left border-0 box-shadow-none" data-target="qbsearch-input.inputButton" aria-label="Search or jump to…" aria-haspopup="dialog" placeholder="Search or jump to..." data-hotkey=s,/ autocapitalize="off" data-analytics-event="{"location":"navbar","action":"searchbar","context":"global","tag":"input","label":"searchbar_input_global_navbar"}" data-action="click:qbsearch-input#handleExpand" > <div class="mr-2 color-fg-muted"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-search"> <path d="M10.68 11.74a6 6 0 0 1-7.922-8.982 6 6 0 0 1 8.982 7.922l3.04 3.04a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215ZM11.5 7a4.499 4.499 0 1 0-8.997 0A4.499 4.499 0 0 0 11.5 7Z"></path> </svg> </div> <span class="flex-1" data-target="qbsearch-input.inputButtonText">Search or jump to...</span> <div class="d-flex" data-target="qbsearch-input.hotkeyIndicator"> <svg xmlns="http://www.w3.org/2000/svg" width="22" height="20" aria-hidden="true" class="mr-1"><path fill="none" stroke="#979A9C" opacity=".4" d="M3.5.5h12c1.7 0 3 1.3 3 3v13c0 1.7-1.3 3-3 3h-12c-1.7 0-3-1.3-3-3v-13c0-1.7 1.3-3 3-3z"></path><path fill="#979A9C" d="M11.8 6L8 15.1h-.9L10.8 6h1z"></path></svg> </div> </button> <input type="hidden" name="type" class="js-site-search-type-field"> <div class="Overlay--hidden " data-modal-dialog-overlay> <modal-dialog data-action="close:qbsearch-input#handleClose cancel:qbsearch-input#handleClose" data-target="qbsearch-input.searchSuggestionsDialog" role="dialog" id="search-suggestions-dialog" aria-modal="true" aria-labelledby="search-suggestions-dialog-header" data-view-component="true" class="Overlay Overlay--width-large Overlay--height-auto"> <h1 id="search-suggestions-dialog-header" class="sr-only">Search code, repositories, users, issues, pull requests...</h1> <div class="Overlay-body Overlay-body--paddingNone"> <div data-view-component="true"> <div class="search-suggestions position-fixed width-full color-shadow-large border color-fg-default color-bg-default overflow-hidden d-flex flex-column query-builder-container" style="border-radius: 12px;" data-target="qbsearch-input.queryBuilderContainer" hidden > <!-- '"` --><!-- </textarea></xmp> --></option></form><form id="query-builder-test-form" action="" accept-charset="UTF-8" method="get"> <query-builder data-target="qbsearch-input.queryBuilder" id="query-builder-query-builder-test" data-filter-key=":" data-view-component="true" class="QueryBuilder search-query-builder"> <div class="FormControl FormControl--fullWidth"> <label id="query-builder-test-label" for="query-builder-test" class="FormControl-label sr-only"> Search </label> <div class="QueryBuilder-StyledInput width-fit " data-target="query-builder.styledInput" > <span id="query-builder-test-leadingvisual-wrap" class="FormControl-input-leadingVisualWrap QueryBuilder-leadingVisualWrap"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-search FormControl-input-leadingVisual"> <path d="M10.68 11.74a6 6 0 0 1-7.922-8.982 6 6 0 0 1 8.982 7.922l3.04 3.04a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215ZM11.5 7a4.499 4.499 0 1 0-8.997 0A4.499 4.499 0 0 0 11.5 7Z"></path> </svg> </span> <div data-target="query-builder.styledInputContainer" class="QueryBuilder-StyledInputContainer"> <div aria-hidden="true" class="QueryBuilder-StyledInputContent" data-target="query-builder.styledInputContent" ></div> <div class="QueryBuilder-InputWrapper"> <div aria-hidden="true" class="QueryBuilder-Sizer" data-target="query-builder.sizer"></div> <input id="query-builder-test" name="query-builder-test" value="" autocomplete="off" type="text" role="combobox" spellcheck="false" aria-expanded="false" aria-describedby="validation-e6db0230-6479-4914-b4a2-757b1b6f331e" data-target="query-builder.input" data-action=" input:query-builder#inputChange blur:query-builder#inputBlur keydown:query-builder#inputKeydown focus:query-builder#inputFocus " data-view-component="true" class="FormControl-input QueryBuilder-Input FormControl-medium" /> </div> </div> <span class="sr-only" id="query-builder-test-clear">Clear</span> <button role="button" id="query-builder-test-clear-button" aria-labelledby="query-builder-test-clear query-builder-test-label" data-target="query-builder.clearButton" data-action=" click:query-builder#clear focus:query-builder#clearButtonFocus blur:query-builder#clearButtonBlur " variant="small" hidden="hidden" type="button" data-view-component="true" class="Button Button--iconOnly Button--invisible Button--medium mr-1 px-2 py-0 d-flex flex-items-center rounded-1 color-fg-muted"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x-circle-fill Button-visual"> <path d="M2.343 13.657A8 8 0 1 1 13.658 2.343 8 8 0 0 1 2.343 13.657ZM6.03 4.97a.751.751 0 0 0-1.042.018.751.751 0 0 0-.018 1.042L6.94 8 4.97 9.97a.749.749 0 0 0 .326 1.275.749.749 0 0 0 .734-.215L8 9.06l1.97 1.97a.749.749 0 0 0 1.275-.326.749.749 0 0 0-.215-.734L9.06 8l1.97-1.97a.749.749 0 0 0-.326-1.275.749.749 0 0 0-.734.215L8 6.94Z"></path> </svg> </button> </div> <template id="search-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-search"> <path d="M10.68 11.74a6 6 0 0 1-7.922-8.982 6 6 0 0 1 8.982 7.922l3.04 3.04a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215ZM11.5 7a4.499 4.499 0 1 0-8.997 0A4.499 4.499 0 0 0 11.5 7Z"></path> </svg> </template> <template id="code-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-code"> <path d="m11.28 3.22 4.25 4.25a.75.75 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.275-.326.749.749 0 0 1 .215-.734L13.94 8l-3.72-3.72a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215Zm-6.56 0a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042L2.06 8l3.72 3.72a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L.47 8.53a.75.75 0 0 1 0-1.06Z"></path> </svg> </template> <template id="file-code-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-file-code"> <path d="M4 1.75C4 .784 4.784 0 5.75 0h5.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v8.586A1.75 1.75 0 0 1 14.25 15h-9a.75.75 0 0 1 0-1.5h9a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 10 4.25V1.5H5.75a.25.25 0 0 0-.25.25v2.5a.75.75 0 0 1-1.5 0Zm1.72 4.97a.75.75 0 0 1 1.06 0l2 2a.75.75 0 0 1 0 1.06l-2 2a.749.749 0 0 1-1.275-.326.749.749 0 0 1 .215-.734l1.47-1.47-1.47-1.47a.75.75 0 0 1 0-1.06ZM3.28 7.78 1.81 9.25l1.47 1.47a.751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018l-2-2a.75.75 0 0 1 0-1.06l2-2a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042Zm8.22-6.218V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path> </svg> </template> <template id="history-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-history"> <path d="m.427 1.927 1.215 1.215a8.002 8.002 0 1 1-1.6 5.685.75.75 0 1 1 1.493-.154 6.5 6.5 0 1 0 1.18-4.458l1.358 1.358A.25.25 0 0 1 3.896 6H.25A.25.25 0 0 1 0 5.75V2.104a.25.25 0 0 1 .427-.177ZM7.75 4a.75.75 0 0 1 .75.75v2.992l2.028.812a.75.75 0 0 1-.557 1.392l-2.5-1A.751.751 0 0 1 7 8.25v-3.5A.75.75 0 0 1 7.75 4Z"></path> </svg> </template> <template id="repo-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-repo"> <path d="M2 2.5A2.5 2.5 0 0 1 4.5 0h8.75a.75.75 0 0 1 .75.75v12.5a.75.75 0 0 1-.75.75h-2.5a.75.75 0 0 1 0-1.5h1.75v-2h-8a1 1 0 0 0-.714 1.7.75.75 0 1 1-1.072 1.05A2.495 2.495 0 0 1 2 11.5Zm10.5-1h-8a1 1 0 0 0-1 1v6.708A2.486 2.486 0 0 1 4.5 9h8ZM5 12.25a.25.25 0 0 1 .25-.25h3.5a.25.25 0 0 1 .25.25v3.25a.25.25 0 0 1-.4.2l-1.45-1.087a.249.249 0 0 0-.3 0L5.4 15.7a.25.25 0 0 1-.4-.2Z"></path> </svg> </template> <template id="bookmark-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-bookmark"> <path d="M3 2.75C3 1.784 3.784 1 4.75 1h6.5c.966 0 1.75.784 1.75 1.75v11.5a.75.75 0 0 1-1.227.579L8 11.722l-3.773 3.107A.751.751 0 0 1 3 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v9.91l3.023-2.489a.75.75 0 0 1 .954 0l3.023 2.49V2.75a.25.25 0 0 0-.25-.25Z"></path> </svg> </template> <template id="plus-circle-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-plus-circle"> <path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Zm7.25-3.25v2.5h2.5a.75.75 0 0 1 0 1.5h-2.5v2.5a.75.75 0 0 1-1.5 0v-2.5h-2.5a.75.75 0 0 1 0-1.5h2.5v-2.5a.75.75 0 0 1 1.5 0Z"></path> </svg> </template> <template id="circle-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-dot-fill"> <path d="M8 4a4 4 0 1 1 0 8 4 4 0 0 1 0-8Z"></path> </svg> </template> <template id="trash-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-trash"> <path d="M11 1.75V3h2.25a.75.75 0 0 1 0 1.5H2.75a.75.75 0 0 1 0-1.5H5V1.75C5 .784 5.784 0 6.75 0h2.5C10.216 0 11 .784 11 1.75ZM4.496 6.675l.66 6.6a.25.25 0 0 0 .249.225h5.19a.25.25 0 0 0 .249-.225l.66-6.6a.75.75 0 0 1 1.492.149l-.66 6.6A1.748 1.748 0 0 1 10.595 15h-5.19a1.75 1.75 0 0 1-1.741-1.575l-.66-6.6a.75.75 0 1 1 1.492-.15ZM6.5 1.75V3h3V1.75a.25.25 0 0 0-.25-.25h-2.5a.25.25 0 0 0-.25.25Z"></path> </svg> </template> <template id="team-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-people"> <path d="M2 5.5a3.5 3.5 0 1 1 5.898 2.549 5.508 5.508 0 0 1 3.034 4.084.75.75 0 1 1-1.482.235 4 4 0 0 0-7.9 0 .75.75 0 0 1-1.482-.236A5.507 5.507 0 0 1 3.102 8.05 3.493 3.493 0 0 1 2 5.5ZM11 4a3.001 3.001 0 0 1 2.22 5.018 5.01 5.01 0 0 1 2.56 3.012.749.749 0 0 1-.885.954.752.752 0 0 1-.549-.514 3.507 3.507 0 0 0-2.522-2.372.75.75 0 0 1-.574-.73v-.352a.75.75 0 0 1 .416-.672A1.5 1.5 0 0 0 11 5.5.75.75 0 0 1 11 4Zm-5.5-.5a2 2 0 1 0-.001 3.999A2 2 0 0 0 5.5 3.5Z"></path> </svg> </template> <template id="project-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-project"> <path d="M1.75 0h12.5C15.216 0 16 .784 16 1.75v12.5A1.75 1.75 0 0 1 14.25 16H1.75A1.75 1.75 0 0 1 0 14.25V1.75C0 .784.784 0 1.75 0ZM1.5 1.75v12.5c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25V1.75a.25.25 0 0 0-.25-.25H1.75a.25.25 0 0 0-.25.25ZM11.75 3a.75.75 0 0 1 .75.75v7.5a.75.75 0 0 1-1.5 0v-7.5a.75.75 0 0 1 .75-.75Zm-8.25.75a.75.75 0 0 1 1.5 0v5.5a.75.75 0 0 1-1.5 0ZM8 3a.75.75 0 0 1 .75.75v3.5a.75.75 0 0 1-1.5 0v-3.5A.75.75 0 0 1 8 3Z"></path> </svg> </template> <template id="pencil-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-pencil"> <path d="M11.013 1.427a1.75 1.75 0 0 1 2.474 0l1.086 1.086a1.75 1.75 0 0 1 0 2.474l-8.61 8.61c-.21.21-.47.364-.756.445l-3.251.93a.75.75 0 0 1-.927-.928l.929-3.25c.081-.286.235-.547.445-.758l8.61-8.61Zm.176 4.823L9.75 4.81l-6.286 6.287a.253.253 0 0 0-.064.108l-.558 1.953 1.953-.558a.253.253 0 0 0 .108-.064Zm1.238-3.763a.25.25 0 0 0-.354 0L10.811 3.75l1.439 1.44 1.263-1.263a.25.25 0 0 0 0-.354Z"></path> </svg> </template> <template id="copilot-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-copilot"> <path d="M7.998 15.035c-4.562 0-7.873-2.914-7.998-3.749V9.338c.085-.628.677-1.686 1.588-2.065.013-.07.024-.143.036-.218.029-.183.06-.384.126-.612-.201-.508-.254-1.084-.254-1.656 0-.87.128-1.769.693-2.484.579-.733 1.494-1.124 2.724-1.261 1.206-.134 2.262.034 2.944.765.05.053.096.108.139.165.044-.057.094-.112.143-.165.682-.731 1.738-.899 2.944-.765 1.23.137 2.145.528 2.724 1.261.566.715.693 1.614.693 2.484 0 .572-.053 1.148-.254 1.656.066.228.098.429.126.612.012.076.024.148.037.218.924.385 1.522 1.471 1.591 2.095v1.872c0 .766-3.351 3.795-8.002 3.795Zm0-1.485c2.28 0 4.584-1.11 5.002-1.433V7.862l-.023-.116c-.49.21-1.075.291-1.727.291-1.146 0-2.059-.327-2.71-.991A3.222 3.222 0 0 1 8 6.303a3.24 3.24 0 0 1-.544.743c-.65.664-1.563.991-2.71.991-.652 0-1.236-.081-1.727-.291l-.023.116v4.255c.419.323 2.722 1.433 5.002 1.433ZM6.762 2.83c-.193-.206-.637-.413-1.682-.297-1.019.113-1.479.404-1.713.7-.247.312-.369.789-.369 1.554 0 .793.129 1.171.308 1.371.162.181.519.379 1.442.379.853 0 1.339-.235 1.638-.54.315-.322.527-.827.617-1.553.117-.935-.037-1.395-.241-1.614Zm4.155-.297c-1.044-.116-1.488.091-1.681.297-.204.219-.359.679-.242 1.614.091.726.303 1.231.618 1.553.299.305.784.54 1.638.54.922 0 1.28-.198 1.442-.379.179-.2.308-.578.308-1.371 0-.765-.123-1.242-.37-1.554-.233-.296-.693-.587-1.713-.7Z"></path><path d="M6.25 9.037a.75.75 0 0 1 .75.75v1.501a.75.75 0 0 1-1.5 0V9.787a.75.75 0 0 1 .75-.75Zm4.25.75v1.501a.75.75 0 0 1-1.5 0V9.787a.75.75 0 0 1 1.5 0Z"></path> </svg> </template> <template id="copilot-error-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-copilot-error"> <path d="M16 11.24c0 .112-.072.274-.21.467L13 9.688V7.862l-.023-.116c-.49.21-1.075.291-1.727.291-.198 0-.388-.009-.571-.029L6.833 5.226a4.01 4.01 0 0 0 .17-.782c.117-.935-.037-1.395-.241-1.614-.193-.206-.637-.413-1.682-.297-.683.076-1.115.231-1.395.415l-1.257-.91c.579-.564 1.413-.877 2.485-.996 1.206-.134 2.262.034 2.944.765.05.053.096.108.139.165.044-.057.094-.112.143-.165.682-.731 1.738-.899 2.944-.765 1.23.137 2.145.528 2.724 1.261.566.715.693 1.614.693 2.484 0 .572-.053 1.148-.254 1.656.066.228.098.429.126.612.012.076.024.148.037.218.924.385 1.522 1.471 1.591 2.095Zm-5.083-8.707c-1.044-.116-1.488.091-1.681.297-.204.219-.359.679-.242 1.614.091.726.303 1.231.618 1.553.299.305.784.54 1.638.54.922 0 1.28-.198 1.442-.379.179-.2.308-.578.308-1.371 0-.765-.123-1.242-.37-1.554-.233-.296-.693-.587-1.713-.7Zm2.511 11.074c-1.393.776-3.272 1.428-5.43 1.428-4.562 0-7.873-2.914-7.998-3.749V9.338c.085-.628.677-1.686 1.588-2.065.013-.07.024-.143.036-.218.029-.183.06-.384.126-.612-.18-.455-.241-.963-.252-1.475L.31 4.107A.747.747 0 0 1 0 3.509V3.49a.748.748 0 0 1 .625-.73c.156-.026.306.047.435.139l14.667 10.578a.592.592 0 0 1 .227.264.752.752 0 0 1 .046.249v.022a.75.75 0 0 1-1.19.596Zm-1.367-.991L5.635 7.964a5.128 5.128 0 0 1-.889.073c-.652 0-1.236-.081-1.727-.291l-.023.116v4.255c.419.323 2.722 1.433 5.002 1.433 1.539 0 3.089-.505 4.063-.934Z"></path> </svg> </template> <template id="workflow-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-workflow"> <path d="M0 1.75C0 .784.784 0 1.75 0h3.5C6.216 0 7 .784 7 1.75v3.5A1.75 1.75 0 0 1 5.25 7H4v4a1 1 0 0 0 1 1h4v-1.25C9 9.784 9.784 9 10.75 9h3.5c.966 0 1.75.784 1.75 1.75v3.5A1.75 1.75 0 0 1 14.25 16h-3.5A1.75 1.75 0 0 1 9 14.25v-.75H5A2.5 2.5 0 0 1 2.5 11V7h-.75A1.75 1.75 0 0 1 0 5.25Zm1.75-.25a.25.25 0 0 0-.25.25v3.5c0 .138.112.25.25.25h3.5a.25.25 0 0 0 .25-.25v-3.5a.25.25 0 0 0-.25-.25Zm9 9a.25.25 0 0 0-.25.25v3.5c0 .138.112.25.25.25h3.5a.25.25 0 0 0 .25-.25v-3.5a.25.25 0 0 0-.25-.25Z"></path> </svg> </template> <template id="book-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-book"> <path d="M0 1.75A.75.75 0 0 1 .75 1h4.253c1.227 0 2.317.59 3 1.501A3.743 3.743 0 0 1 11.006 1h4.245a.75.75 0 0 1 .75.75v10.5a.75.75 0 0 1-.75.75h-4.507a2.25 2.25 0 0 0-1.591.659l-.622.621a.75.75 0 0 1-1.06 0l-.622-.621A2.25 2.25 0 0 0 5.258 13H.75a.75.75 0 0 1-.75-.75Zm7.251 10.324.004-5.073-.002-2.253A2.25 2.25 0 0 0 5.003 2.5H1.5v9h3.757a3.75 3.75 0 0 1 1.994.574ZM8.755 4.75l-.004 7.322a3.752 3.752 0 0 1 1.992-.572H14.5v-9h-3.495a2.25 2.25 0 0 0-2.25 2.25Z"></path> </svg> </template> <template id="code-review-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-code-review"> <path d="M1.75 1h12.5c.966 0 1.75.784 1.75 1.75v8.5A1.75 1.75 0 0 1 14.25 13H8.061l-2.574 2.573A1.458 1.458 0 0 1 3 14.543V13H1.75A1.75 1.75 0 0 1 0 11.25v-8.5C0 1.784.784 1 1.75 1ZM1.5 2.75v8.5c0 .138.112.25.25.25h2a.75.75 0 0 1 .75.75v2.19l2.72-2.72a.749.749 0 0 1 .53-.22h6.5a.25.25 0 0 0 .25-.25v-8.5a.25.25 0 0 0-.25-.25H1.75a.25.25 0 0 0-.25.25Zm5.28 1.72a.75.75 0 0 1 0 1.06L5.31 7l1.47 1.47a.751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018l-2-2a.75.75 0 0 1 0-1.06l2-2a.75.75 0 0 1 1.06 0Zm2.44 0a.75.75 0 0 1 1.06 0l2 2a.75.75 0 0 1 0 1.06l-2 2a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L10.69 7 9.22 5.53a.75.75 0 0 1 0-1.06Z"></path> </svg> </template> <template id="codespaces-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-codespaces"> <path d="M0 11.25c0-.966.784-1.75 1.75-1.75h12.5c.966 0 1.75.784 1.75 1.75v3A1.75 1.75 0 0 1 14.25 16H1.75A1.75 1.75 0 0 1 0 14.25Zm2-9.5C2 .784 2.784 0 3.75 0h8.5C13.216 0 14 .784 14 1.75v5a1.75 1.75 0 0 1-1.75 1.75h-8.5A1.75 1.75 0 0 1 2 6.75Zm1.75-.25a.25.25 0 0 0-.25.25v5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25v-5a.25.25 0 0 0-.25-.25Zm-2 9.5a.25.25 0 0 0-.25.25v3c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25v-3a.25.25 0 0 0-.25-.25Z"></path><path d="M7 12.75a.75.75 0 0 1 .75-.75h4.5a.75.75 0 0 1 0 1.5h-4.5a.75.75 0 0 1-.75-.75Zm-4 0a.75.75 0 0 1 .75-.75h.5a.75.75 0 0 1 0 1.5h-.5a.75.75 0 0 1-.75-.75Z"></path> </svg> </template> <template id="comment-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-comment"> <path d="M1 2.75C1 1.784 1.784 1 2.75 1h10.5c.966 0 1.75.784 1.75 1.75v7.5A1.75 1.75 0 0 1 13.25 12H9.06l-2.573 2.573A1.458 1.458 0 0 1 4 13.543V12H2.75A1.75 1.75 0 0 1 1 10.25Zm1.75-.25a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h2a.75.75 0 0 1 .75.75v2.19l2.72-2.72a.749.749 0 0 1 .53-.22h4.5a.25.25 0 0 0 .25-.25v-7.5a.25.25 0 0 0-.25-.25Z"></path> </svg> </template> <template id="comment-discussion-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-comment-discussion"> <path d="M1.75 1h8.5c.966 0 1.75.784 1.75 1.75v5.5A1.75 1.75 0 0 1 10.25 10H7.061l-2.574 2.573A1.458 1.458 0 0 1 2 11.543V10h-.25A1.75 1.75 0 0 1 0 8.25v-5.5C0 1.784.784 1 1.75 1ZM1.5 2.75v5.5c0 .138.112.25.25.25h1a.75.75 0 0 1 .75.75v2.19l2.72-2.72a.749.749 0 0 1 .53-.22h3.5a.25.25 0 0 0 .25-.25v-5.5a.25.25 0 0 0-.25-.25h-8.5a.25.25 0 0 0-.25.25Zm13 2a.25.25 0 0 0-.25-.25h-.5a.75.75 0 0 1 0-1.5h.5c.966 0 1.75.784 1.75 1.75v5.5A1.75 1.75 0 0 1 14.25 12H14v1.543a1.458 1.458 0 0 1-2.487 1.03L9.22 12.28a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215l2.22 2.22v-2.19a.75.75 0 0 1 .75-.75h1a.25.25 0 0 0 .25-.25Z"></path> </svg> </template> <template id="organization-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-organization"> <path d="M1.75 16A1.75 1.75 0 0 1 0 14.25V1.75C0 .784.784 0 1.75 0h8.5C11.216 0 12 .784 12 1.75v12.5c0 .085-.006.168-.018.25h2.268a.25.25 0 0 0 .25-.25V8.285a.25.25 0 0 0-.111-.208l-1.055-.703a.749.749 0 1 1 .832-1.248l1.055.703c.487.325.779.871.779 1.456v5.965A1.75 1.75 0 0 1 14.25 16h-3.5a.766.766 0 0 1-.197-.026c-.099.017-.2.026-.303.026h-3a.75.75 0 0 1-.75-.75V14h-1v1.25a.75.75 0 0 1-.75.75Zm-.25-1.75c0 .138.112.25.25.25H4v-1.25a.75.75 0 0 1 .75-.75h2.5a.75.75 0 0 1 .75.75v1.25h2.25a.25.25 0 0 0 .25-.25V1.75a.25.25 0 0 0-.25-.25h-8.5a.25.25 0 0 0-.25.25ZM3.75 6h.5a.75.75 0 0 1 0 1.5h-.5a.75.75 0 0 1 0-1.5ZM3 3.75A.75.75 0 0 1 3.75 3h.5a.75.75 0 0 1 0 1.5h-.5A.75.75 0 0 1 3 3.75Zm4 3A.75.75 0 0 1 7.75 6h.5a.75.75 0 0 1 0 1.5h-.5A.75.75 0 0 1 7 6.75ZM7.75 3h.5a.75.75 0 0 1 0 1.5h-.5a.75.75 0 0 1 0-1.5ZM3 9.75A.75.75 0 0 1 3.75 9h.5a.75.75 0 0 1 0 1.5h-.5A.75.75 0 0 1 3 9.75ZM7.75 9h.5a.75.75 0 0 1 0 1.5h-.5a.75.75 0 0 1 0-1.5Z"></path> </svg> </template> <template id="rocket-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-rocket"> <path d="M14.064 0h.186C15.216 0 16 .784 16 1.75v.186a8.752 8.752 0 0 1-2.564 6.186l-.458.459c-.314.314-.641.616-.979.904v3.207c0 .608-.315 1.172-.833 1.49l-2.774 1.707a.749.749 0 0 1-1.11-.418l-.954-3.102a1.214 1.214 0 0 1-.145-.125L3.754 9.816a1.218 1.218 0 0 1-.124-.145L.528 8.717a.749.749 0 0 1-.418-1.11l1.71-2.774A1.748 1.748 0 0 1 3.31 4h3.204c.288-.338.59-.665.904-.979l.459-.458A8.749 8.749 0 0 1 14.064 0ZM8.938 3.623h-.002l-.458.458c-.76.76-1.437 1.598-2.02 2.5l-1.5 2.317 2.143 2.143 2.317-1.5c.902-.583 1.74-1.26 2.499-2.02l.459-.458a7.25 7.25 0 0 0 2.123-5.127V1.75a.25.25 0 0 0-.25-.25h-.186a7.249 7.249 0 0 0-5.125 2.123ZM3.56 14.56c-.732.732-2.334 1.045-3.005 1.148a.234.234 0 0 1-.201-.064.234.234 0 0 1-.064-.201c.103-.671.416-2.273 1.15-3.003a1.502 1.502 0 1 1 2.12 2.12Zm6.94-3.935c-.088.06-.177.118-.266.175l-2.35 1.521.548 1.783 1.949-1.2a.25.25 0 0 0 .119-.213ZM3.678 8.116 5.2 5.766c.058-.09.117-.178.176-.266H3.309a.25.25 0 0 0-.213.119l-1.2 1.95ZM12 5a1 1 0 1 1-2 0 1 1 0 0 1 2 0Z"></path> </svg> </template> <template id="shield-check-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-shield-check"> <path d="m8.533.133 5.25 1.68A1.75 1.75 0 0 1 15 3.48V7c0 1.566-.32 3.182-1.303 4.682-.983 1.498-2.585 2.813-5.032 3.855a1.697 1.697 0 0 1-1.33 0c-2.447-1.042-4.049-2.357-5.032-3.855C1.32 10.182 1 8.566 1 7V3.48a1.75 1.75 0 0 1 1.217-1.667l5.25-1.68a1.748 1.748 0 0 1 1.066 0Zm-.61 1.429.001.001-5.25 1.68a.251.251 0 0 0-.174.237V7c0 1.36.275 2.666 1.057 3.859.784 1.194 2.121 2.342 4.366 3.298a.196.196 0 0 0 .154 0c2.245-.957 3.582-2.103 4.366-3.297C13.225 9.666 13.5 8.358 13.5 7V3.48a.25.25 0 0 0-.174-.238l-5.25-1.68a.25.25 0 0 0-.153 0ZM11.28 6.28l-3.5 3.5a.75.75 0 0 1-1.06 0l-1.5-1.5a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215l.97.97 2.97-2.97a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042Z"></path> </svg> </template> <template id="heart-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-heart"> <path d="m8 14.25.345.666a.75.75 0 0 1-.69 0l-.008-.004-.018-.01a7.152 7.152 0 0 1-.31-.17 22.055 22.055 0 0 1-3.434-2.414C2.045 10.731 0 8.35 0 5.5 0 2.836 2.086 1 4.25 1 5.797 1 7.153 1.802 8 3.02 8.847 1.802 10.203 1 11.75 1 13.914 1 16 2.836 16 5.5c0 2.85-2.045 5.231-3.885 6.818a22.066 22.066 0 0 1-3.744 2.584l-.018.01-.006.003h-.002ZM4.25 2.5c-1.336 0-2.75 1.164-2.75 3 0 2.15 1.58 4.144 3.365 5.682A20.58 20.58 0 0 0 8 13.393a20.58 20.58 0 0 0 3.135-2.211C12.92 9.644 14.5 7.65 14.5 5.5c0-1.836-1.414-3-2.75-3-1.373 0-2.609.986-3.029 2.456a.749.749 0 0 1-1.442 0C6.859 3.486 5.623 2.5 4.25 2.5Z"></path> </svg> </template> <template id="server-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-server"> <path d="M1.75 1h12.5c.966 0 1.75.784 1.75 1.75v4c0 .372-.116.717-.314 1 .198.283.314.628.314 1v4a1.75 1.75 0 0 1-1.75 1.75H1.75A1.75 1.75 0 0 1 0 12.75v-4c0-.358.109-.707.314-1a1.739 1.739 0 0 1-.314-1v-4C0 1.784.784 1 1.75 1ZM1.5 2.75v4c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25v-4a.25.25 0 0 0-.25-.25H1.75a.25.25 0 0 0-.25.25Zm.25 5.75a.25.25 0 0 0-.25.25v4c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25v-4a.25.25 0 0 0-.25-.25ZM7 4.75A.75.75 0 0 1 7.75 4h4.5a.75.75 0 0 1 0 1.5h-4.5A.75.75 0 0 1 7 4.75ZM7.75 10h4.5a.75.75 0 0 1 0 1.5h-4.5a.75.75 0 0 1 0-1.5ZM3 4.75A.75.75 0 0 1 3.75 4h.5a.75.75 0 0 1 0 1.5h-.5A.75.75 0 0 1 3 4.75ZM3.75 10h.5a.75.75 0 0 1 0 1.5h-.5a.75.75 0 0 1 0-1.5Z"></path> </svg> </template> <template id="globe-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-globe"> <path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM5.78 8.75a9.64 9.64 0 0 0 1.363 4.177c.255.426.542.832.857 1.215.245-.296.551-.705.857-1.215A9.64 9.64 0 0 0 10.22 8.75Zm4.44-1.5a9.64 9.64 0 0 0-1.363-4.177c-.307-.51-.612-.919-.857-1.215a9.927 9.927 0 0 0-.857 1.215A9.64 9.64 0 0 0 5.78 7.25Zm-5.944 1.5H1.543a6.507 6.507 0 0 0 4.666 5.5c-.123-.181-.24-.365-.352-.552-.715-1.192-1.437-2.874-1.581-4.948Zm-2.733-1.5h2.733c.144-2.074.866-3.756 1.58-4.948.12-.197.237-.381.353-.552a6.507 6.507 0 0 0-4.666 5.5Zm10.181 1.5c-.144 2.074-.866 3.756-1.58 4.948-.12.197-.237.381-.353.552a6.507 6.507 0 0 0 4.666-5.5Zm2.733-1.5a6.507 6.507 0 0 0-4.666-5.5c.123.181.24.365.353.552.714 1.192 1.436 2.874 1.58 4.948Z"></path> </svg> </template> <template id="issue-opened-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-issue-opened"> <path d="M8 9.5a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Z"></path><path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Z"></path> </svg> </template> <template id="device-mobile-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-device-mobile"> <path d="M3.75 0h8.5C13.216 0 14 .784 14 1.75v12.5A1.75 1.75 0 0 1 12.25 16h-8.5A1.75 1.75 0 0 1 2 14.25V1.75C2 .784 2.784 0 3.75 0ZM3.5 1.75v12.5c0 .138.112.25.25.25h8.5a.25.25 0 0 0 .25-.25V1.75a.25.25 0 0 0-.25-.25h-8.5a.25.25 0 0 0-.25.25ZM8 13a1 1 0 1 1 0-2 1 1 0 0 1 0 2Z"></path> </svg> </template> <template id="package-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-package"> <path d="m8.878.392 5.25 3.045c.54.314.872.89.872 1.514v6.098a1.75 1.75 0 0 1-.872 1.514l-5.25 3.045a1.75 1.75 0 0 1-1.756 0l-5.25-3.045A1.75 1.75 0 0 1 1 11.049V4.951c0-.624.332-1.201.872-1.514L7.122.392a1.75 1.75 0 0 1 1.756 0ZM7.875 1.69l-4.63 2.685L8 7.133l4.755-2.758-4.63-2.685a.248.248 0 0 0-.25 0ZM2.5 5.677v5.372c0 .09.047.171.125.216l4.625 2.683V8.432Zm6.25 8.271 4.625-2.683a.25.25 0 0 0 .125-.216V5.677L8.75 8.432Z"></path> </svg> </template> <template id="credit-card-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-credit-card"> <path d="M10.75 9a.75.75 0 0 0 0 1.5h1.5a.75.75 0 0 0 0-1.5h-1.5Z"></path><path d="M0 3.75C0 2.784.784 2 1.75 2h12.5c.966 0 1.75.784 1.75 1.75v8.5A1.75 1.75 0 0 1 14.25 14H1.75A1.75 1.75 0 0 1 0 12.25ZM14.5 6.5h-13v5.75c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25Zm0-2.75a.25.25 0 0 0-.25-.25H1.75a.25.25 0 0 0-.25.25V5h13Z"></path> </svg> </template> <template id="play-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-play"> <path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Zm4.879-2.773 4.264 2.559a.25.25 0 0 1 0 .428l-4.264 2.559A.25.25 0 0 1 6 10.559V5.442a.25.25 0 0 1 .379-.215Z"></path> </svg> </template> <template id="gift-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-gift"> <path d="M2 2.75A2.75 2.75 0 0 1 4.75 0c.983 0 1.873.42 2.57 1.232.268.318.497.668.68 1.042.183-.375.411-.725.68-1.044C9.376.42 10.266 0 11.25 0a2.75 2.75 0 0 1 2.45 4h.55c.966 0 1.75.784 1.75 1.75v2c0 .698-.409 1.301-1 1.582v4.918A1.75 1.75 0 0 1 13.25 16H2.75A1.75 1.75 0 0 1 1 14.25V9.332C.409 9.05 0 8.448 0 7.75v-2C0 4.784.784 4 1.75 4h.55c-.192-.375-.3-.8-.3-1.25ZM7.25 9.5H2.5v4.75c0 .138.112.25.25.25h4.5Zm1.5 0v5h4.5a.25.25 0 0 0 .25-.25V9.5Zm0-4V8h5.5a.25.25 0 0 0 .25-.25v-2a.25.25 0 0 0-.25-.25Zm-7 0a.25.25 0 0 0-.25.25v2c0 .138.112.25.25.25h5.5V5.5h-5.5Zm3-4a1.25 1.25 0 0 0 0 2.5h2.309c-.233-.818-.542-1.401-.878-1.793-.43-.502-.915-.707-1.431-.707ZM8.941 4h2.309a1.25 1.25 0 0 0 0-2.5c-.516 0-1 .205-1.43.707-.337.392-.646.975-.879 1.793Z"></path> </svg> </template> <template id="code-square-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-code-square"> <path d="M0 1.75C0 .784.784 0 1.75 0h12.5C15.216 0 16 .784 16 1.75v12.5A1.75 1.75 0 0 1 14.25 16H1.75A1.75 1.75 0 0 1 0 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25V1.75a.25.25 0 0 0-.25-.25Zm7.47 3.97a.75.75 0 0 1 1.06 0l2 2a.75.75 0 0 1 0 1.06l-2 2a.749.749 0 0 1-1.275-.326.749.749 0 0 1 .215-.734L10.69 8 9.22 6.53a.75.75 0 0 1 0-1.06ZM6.78 6.53 5.31 8l1.47 1.47a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215l-2-2a.75.75 0 0 1 0-1.06l2-2a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042Z"></path> </svg> </template> <template id="device-desktop-icon"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-device-desktop"> <path d="M14.25 1c.966 0 1.75.784 1.75 1.75v7.5A1.75 1.75 0 0 1 14.25 12h-3.727c.099 1.041.52 1.872 1.292 2.757A.752.752 0 0 1 11.25 16h-6.5a.75.75 0 0 1-.565-1.243c.772-.885 1.192-1.716 1.292-2.757H1.75A1.75 1.75 0 0 1 0 10.25v-7.5C0 1.784.784 1 1.75 1ZM1.75 2.5a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h12.5a.25.25 0 0 0 .25-.25v-7.5a.25.25 0 0 0-.25-.25ZM9.018 12H6.982a5.72 5.72 0 0 1-.765 2.5h3.566a5.72 5.72 0 0 1-.765-2.5Z"></path> </svg> </template> <div class="position-relative"> <ul role="listbox" class="ActionListWrap QueryBuilder-ListWrap" aria-label="Suggestions" data-action=" combobox-commit:query-builder#comboboxCommit mousedown:query-builder#resultsMousedown " data-target="query-builder.resultsList" data-persist-list=false id="query-builder-test-results" ></ul> </div> <div class="FormControl-inlineValidation" id="validation-e6db0230-6479-4914-b4a2-757b1b6f331e" hidden="hidden"> <span class="FormControl-inlineValidation--visual"> <svg aria-hidden="true" height="12" viewBox="0 0 12 12" version="1.1" width="12" data-view-component="true" class="octicon octicon-alert-fill"> <path d="M4.855.708c.5-.896 1.79-.896 2.29 0l4.675 8.351a1.312 1.312 0 0 1-1.146 1.954H1.33A1.313 1.313 0 0 1 .183 9.058ZM7 7V3H5v4Zm-1 3a1 1 0 1 0 0-2 1 1 0 0 0 0 2Z"></path> </svg> </span> <span></span> </div> </div> <div data-target="query-builder.screenReaderFeedback" aria-live="polite" aria-atomic="true" class="sr-only"></div> </query-builder></form> <div class="d-flex flex-row color-fg-muted px-3 text-small color-bg-default search-feedback-prompt"> <a target="_blank" href="https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax" data-view-component="true" class="Link color-fg-accent text-normal ml-2">Search syntax tips</a> <div class="d-flex flex-1"></div> </div> </div> </div> </div> </modal-dialog></div> </div> <div data-action="click:qbsearch-input#retract" class="dark-backdrop position-fixed" hidden data-target="qbsearch-input.darkBackdrop"></div> <div class="color-fg-default"> <dialog-helper> <dialog data-target="qbsearch-input.feedbackDialog" data-action="close:qbsearch-input#handleDialogClose cancel:qbsearch-input#handleDialogClose" id="feedback-dialog" aria-modal="true" aria-labelledby="feedback-dialog-title" aria-describedby="feedback-dialog-description" data-view-component="true" class="Overlay Overlay-whenNarrow Overlay--size-medium Overlay--motion-scaleFade Overlay--disableScroll"> <div data-view-component="true" class="Overlay-header"> <div class="Overlay-headerContentWrap"> <div class="Overlay-titleWrap"> <h1 class="Overlay-title " id="feedback-dialog-title"> Provide feedback </h1> </div> <div class="Overlay-actionWrap"> <button data-close-dialog-id="feedback-dialog" aria-label="Close" type="button" data-view-component="true" class="close-button Overlay-closeButton"><svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x"> <path d="M3.72 3.72a.75.75 0 0 1 1.06 0L8 6.94l3.22-3.22a.749.749 0 0 1 1.275.326.749.749 0 0 1-.215.734L9.06 8l3.22 3.22a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L8 9.06l-3.22 3.22a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L6.94 8 3.72 4.78a.75.75 0 0 1 0-1.06Z"></path> </svg></button> </div> </div> </div> <scrollable-region data-labelled-by="feedback-dialog-title"> <div data-view-component="true" class="Overlay-body"> <!-- '"` --><!-- </textarea></xmp> --></option></form><form id="code-search-feedback-form" data-turbo="false" action="/search/feedback" accept-charset="UTF-8" method="post"><input type="hidden" data-csrf="true" name="authenticity_token" value="L/ZwJySn3uv+P91rf9o9NtGtLm5+ToQC/+dT1VXMH1F+5bgc3Bk/cA1vY+bUjk6wnPesKkfWnxBE99la2DRh/Q==" /> <p>We read every piece of feedback, and take your input very seriously.</p> <textarea name="feedback" class="form-control width-full mb-2" style="height: 120px" id="feedback"></textarea> <input name="include_email" id="include_email" aria-label="Include my email address so I can be contacted" class="form-control mr-2" type="checkbox"> <label for="include_email" style="font-weight: normal">Include my email address so I can be contacted</label> </form></div> </scrollable-region> <div data-view-component="true" class="Overlay-footer Overlay-footer--alignEnd"> <button data-close-dialog-id="feedback-dialog" type="button" data-view-component="true" class="btn"> Cancel </button> <button form="code-search-feedback-form" data-action="click:qbsearch-input#submitFeedback" type="submit" data-view-component="true" class="btn-primary btn"> Submit feedback </button> </div> </dialog></dialog-helper> <custom-scopes data-target="qbsearch-input.customScopesManager"> <dialog-helper> <dialog data-target="custom-scopes.customScopesModalDialog" data-action="close:qbsearch-input#handleDialogClose cancel:qbsearch-input#handleDialogClose" id="custom-scopes-dialog" aria-modal="true" aria-labelledby="custom-scopes-dialog-title" aria-describedby="custom-scopes-dialog-description" data-view-component="true" class="Overlay Overlay-whenNarrow Overlay--size-medium Overlay--motion-scaleFade Overlay--disableScroll"> <div data-view-component="true" class="Overlay-header Overlay-header--divided"> <div class="Overlay-headerContentWrap"> <div class="Overlay-titleWrap"> <h1 class="Overlay-title " id="custom-scopes-dialog-title"> Saved searches </h1> <h2 id="custom-scopes-dialog-description" class="Overlay-description">Use saved searches to filter your results more quickly</h2> </div> <div class="Overlay-actionWrap"> <button data-close-dialog-id="custom-scopes-dialog" aria-label="Close" type="button" data-view-component="true" class="close-button Overlay-closeButton"><svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x"> <path d="M3.72 3.72a.75.75 0 0 1 1.06 0L8 6.94l3.22-3.22a.749.749 0 0 1 1.275.326.749.749 0 0 1-.215.734L9.06 8l3.22 3.22a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L8 9.06l-3.22 3.22a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L6.94 8 3.72 4.78a.75.75 0 0 1 0-1.06Z"></path> </svg></button> </div> </div> </div> <scrollable-region data-labelled-by="custom-scopes-dialog-title"> <div data-view-component="true" class="Overlay-body"> <div data-target="custom-scopes.customScopesModalDialogFlash"></div> <div hidden class="create-custom-scope-form" data-target="custom-scopes.createCustomScopeForm"> <!-- '"` --><!-- </textarea></xmp> --></option></form><form id="custom-scopes-dialog-form" data-turbo="false" action="/search/custom_scopes" accept-charset="UTF-8" method="post"><input type="hidden" data-csrf="true" name="authenticity_token" value="Nupv5RBslAGL8bOQkxTUF/uSygmuTiHFlGb5hHW4cdxJh/WGYA2lc/G0wvEHHPyOXRYYQ6DAh+cDdUs/doeYFw==" /> <div data-target="custom-scopes.customScopesModalDialogFlash"></div> <input type="hidden" id="custom_scope_id" name="custom_scope_id" data-target="custom-scopes.customScopesIdField"> <div class="form-group"> <label for="custom_scope_name">Name</label> <auto-check src="/search/custom_scopes/check_name" required only-validate-on-blur="false"> <input type="text" name="custom_scope_name" id="custom_scope_name" data-target="custom-scopes.customScopesNameField" class="form-control" autocomplete="off" placeholder="github-ruby" required maxlength="50"> <input type="hidden" data-csrf="true" value="LR18pHynMIHq3Vr50PAyIVciXQ6okM1If5cz1SpQ2Im+0kwRlTgu2W2xZoVNQOjx0Id9HHKvA9u2zRgnaH9RIw==" /> </auto-check> </div> <div class="form-group"> <label for="custom_scope_query">Query</label> <input type="text" name="custom_scope_query" id="custom_scope_query" data-target="custom-scopes.customScopesQueryField" class="form-control" autocomplete="off" placeholder="(repo:mona/a OR repo:mona/b) AND lang:python" required maxlength="500"> </div> <p class="text-small color-fg-muted"> To see all available qualifiers, see our <a class="Link--inTextBlock" href="https://docs.github.com/search-github/github-code-search/understanding-github-code-search-syntax">documentation</a>. </p> </form> </div> <div data-target="custom-scopes.manageCustomScopesForm"> <div data-target="custom-scopes.list"></div> </div> </div> </scrollable-region> <div data-view-component="true" class="Overlay-footer Overlay-footer--alignEnd Overlay-footer--divided"> <button data-action="click:custom-scopes#customScopesCancel" type="button" data-view-component="true" class="btn"> Cancel </button> <button form="custom-scopes-dialog-form" data-action="click:custom-scopes#customScopesSubmit" data-target="custom-scopes.customScopesSubmitButton" type="submit" data-view-component="true" class="btn-primary btn"> Create saved search </button> </div> </dialog></dialog-helper> </custom-scopes> </div> </qbsearch-input> <div class="position-relative HeaderMenu-link-wrap d-lg-inline-block"> <a href="/login?return_to=https%3A%2F%2Fgithub.com%2Fjwasham%2Fcoding-interview-university" class="HeaderMenu-link HeaderMenu-link--sign-in HeaderMenu-button flex-shrink-0 no-underline d-none d-lg-inline-flex border border-lg-0 rounded rounded-lg-0 px-2 py-1" style="margin-left: 12px;" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"site header menu","repository_id":null,"auth_type":"SIGN_UP","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="5ff38f5702d44f732ac5f7348719a1dd875d6e03f7b3cadfdfc22446d493f0ef" data-analytics-event="{"category":"Marketing nav","action":"click to go to homepage","label":"ref_page:Marketing;ref_cta:Sign in;ref_loc:Header"}" > Sign in </a> </div> <a href="/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E&source=header-repo&source_repo=jwasham%2Fcoding-interview-university" class="HeaderMenu-link HeaderMenu-link--sign-up HeaderMenu-button flex-shrink-0 d-flex d-lg-inline-flex no-underline border color-border-default rounded px-2 py-1" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"site header menu","repository_id":null,"auth_type":"SIGN_UP","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="5ff38f5702d44f732ac5f7348719a1dd875d6e03f7b3cadfdfc22446d493f0ef" data-analytics-event="{"category":"Sign up","action":"click to sign up for account","label":"ref_page:/<user-name>/<repo-name>;ref_cta:Sign up;ref_loc:header logged out"}" > Sign up </a> <button type="button" class="sr-only js-header-menu-focus-trap d-block d-lg-none">Reseting focus</button> </div> </div> </div> </div> </header> <div hidden="hidden" data-view-component="true" class="js-stale-session-flash stale-session-flash flash flash-warn flash-full"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-alert"> <path d="M6.457 1.047c.659-1.234 2.427-1.234 3.086 0l6.082 11.378A1.75 1.75 0 0 1 14.082 15H1.918a1.75 1.75 0 0 1-1.543-2.575Zm1.763.707a.25.25 0 0 0-.44 0L1.698 13.132a.25.25 0 0 0 .22.368h12.164a.25.25 0 0 0 .22-.368Zm.53 3.996v2.5a.75.75 0 0 1-1.5 0v-2.5a.75.75 0 0 1 1.5 0ZM9 11a1 1 0 1 1-2 0 1 1 0 0 1 2 0Z"></path> </svg> <span class="js-stale-session-flash-signed-in" hidden>You signed in with another tab or window. <a class="Link--inTextBlock" href="">Reload</a> to refresh your session.</span> <span class="js-stale-session-flash-signed-out" hidden>You signed out in another tab or window. <a class="Link--inTextBlock" href="">Reload</a> to refresh your session.</span> <span class="js-stale-session-flash-switched" hidden>You switched accounts on another tab or window. <a class="Link--inTextBlock" href="">Reload</a> to refresh your session.</span> <button id="icon-button-892e6ead-ba00-4b5d-b460-df53c2892c04" aria-labelledby="tooltip-7cbd5aa4-8743-4daa-b4ae-23b068e4f2ec" type="button" data-view-component="true" class="Button Button--iconOnly Button--invisible Button--medium flash-close js-flash-close"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x Button-visual"> <path d="M3.72 3.72a.75.75 0 0 1 1.06 0L8 6.94l3.22-3.22a.749.749 0 0 1 1.275.326.749.749 0 0 1-.215.734L9.06 8l3.22 3.22a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L8 9.06l-3.22 3.22a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L6.94 8 3.72 4.78a.75.75 0 0 1 0-1.06Z"></path> </svg> </button><tool-tip id="tooltip-7cbd5aa4-8743-4daa-b4ae-23b068e4f2ec" for="icon-button-892e6ead-ba00-4b5d-b460-df53c2892c04" popover="manual" data-direction="s" data-type="label" data-view-component="true" class="sr-only position-absolute">Dismiss alert</tool-tip> </div> </div> <div id="start-of-content" class="show-on-focus"></div> <div id="js-flash-container" class="flash-container" data-turbo-replace> <template class="js-flash-template"> <div class="flash flash-full {{ className }}"> <div > <button autofocus class="flash-close js-flash-close" type="button" aria-label="Dismiss this message"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x"> <path d="M3.72 3.72a.75.75 0 0 1 1.06 0L8 6.94l3.22-3.22a.749.749 0 0 1 1.275.326.749.749 0 0 1-.215.734L9.06 8l3.22 3.22a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L8 9.06l-3.22 3.22a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L6.94 8 3.72 4.78a.75.75 0 0 1 0-1.06Z"></path> </svg> </button> <div aria-atomic="true" role="alert" class="js-flash-alert"> <div>{{ message }}</div> </div> </div> </div> </template> </div> <div class="application-main " data-commit-hovercards-enabled data-discussion-hovercards-enabled data-issue-and-pr-hovercards-enabled data-project-hovercards-enabled > <div itemscope itemtype="http://schema.org/SoftwareSourceCode" class=""> <main id="js-repo-pjax-container" > <div id="repository-container-header" class="pt-3 hide-full-screen" style="background-color: var(--page-header-bgColor, var(--color-page-header-bg));" data-turbo-replace> <div class="d-flex flex-nowrap flex-justify-end mb-3 px-3 px-lg-5" style="gap: 1rem;"> <div class="flex-auto min-width-0 width-fit"> <div class=" d-flex flex-wrap flex-items-center wb-break-word f3 text-normal"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-repo color-fg-muted mr-2"> <path d="M2 2.5A2.5 2.5 0 0 1 4.5 0h8.75a.75.75 0 0 1 .75.75v12.5a.75.75 0 0 1-.75.75h-2.5a.75.75 0 0 1 0-1.5h1.75v-2h-8a1 1 0 0 0-.714 1.7.75.75 0 1 1-1.072 1.05A2.495 2.495 0 0 1 2 11.5Zm10.5-1h-8a1 1 0 0 0-1 1v6.708A2.486 2.486 0 0 1 4.5 9h8ZM5 12.25a.25.25 0 0 1 .25-.25h3.5a.25.25 0 0 1 .25.25v3.25a.25.25 0 0 1-.4.2l-1.45-1.087a.249.249 0 0 0-.3 0L5.4 15.7a.25.25 0 0 1-.4-.2Z"></path> </svg> <span class="author flex-self-stretch" itemprop="author"> <a class="url fn" rel="author" data-hovercard-type="user" data-hovercard-url="/users/jwasham/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" href="/jwasham"> jwasham </a> </span> <span class="mx-1 flex-self-stretch color-fg-muted">/</span> <strong itemprop="name" class="mr-2 flex-self-stretch"> <a data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" href="/jwasham/coding-interview-university">coding-interview-university</a> </strong> <span></span><span class="Label Label--secondary v-align-middle mr-1">Public</span> </div> </div> <div id="repository-details-container" class="flex-shrink-0" data-turbo-replace style="max-width: 70%;"> <ul class="pagehead-actions flex-shrink-0 d-none d-md-inline" style="padding: 2px 0;"> <li> <a href="/login?return_to=%2Fjwasham%2Fcoding-interview-university" rel="nofollow" id="repository-details-watch-button" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"notification subscription menu watch","repository_id":null,"auth_type":"LOG_IN","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="a6408feb0ce6d0062d6995f767ef28cafd921500580c83e130a12d770ea88059" aria-label="You must be signed in to change notification settings" data-view-component="true" class="btn-sm btn"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-bell mr-2"> <path d="M8 16a2 2 0 0 0 1.985-1.75c.017-.137-.097-.25-.235-.25h-3.5c-.138 0-.252.113-.235.25A2 2 0 0 0 8 16ZM3 5a5 5 0 0 1 10 0v2.947c0 .05.015.098.042.139l1.703 2.555A1.519 1.519 0 0 1 13.482 13H2.518a1.516 1.516 0 0 1-1.263-2.36l1.703-2.554A.255.255 0 0 0 3 7.947Zm5-3.5A3.5 3.5 0 0 0 4.5 5v2.947c0 .346-.102.683-.294.97l-1.703 2.556a.017.017 0 0 0-.003.01l.001.006c0 .002.002.004.004.006l.006.004.007.001h10.964l.007-.001.006-.004.004-.006.001-.007a.017.017 0 0 0-.003-.01l-1.703-2.554a1.745 1.745 0 0 1-.294-.97V5A3.5 3.5 0 0 0 8 1.5Z"></path> </svg>Notifications </a> <tool-tip id="tooltip-5215c1d8-d6c4-48ad-86c5-b622e2360350" for="repository-details-watch-button" popover="manual" data-direction="s" data-type="description" data-view-component="true" class="sr-only position-absolute">You must be signed in to change notification settings</tool-tip> </li> <li> <a icon="repo-forked" id="fork-button" href="/login?return_to=%2Fjwasham%2Fcoding-interview-university" rel="nofollow" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"repo details fork button","repository_id":60493101,"auth_type":"LOG_IN","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="9ea15a36dcf0bfa91e10011709d8345cde6fcd8e9c92abcb676d45ac060599f1" data-view-component="true" class="btn-sm btn"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-repo-forked mr-2"> <path d="M5 5.372v.878c0 .414.336.75.75.75h4.5a.75.75 0 0 0 .75-.75v-.878a2.25 2.25 0 1 1 1.5 0v.878a2.25 2.25 0 0 1-2.25 2.25h-1.5v2.128a2.251 2.251 0 1 1-1.5 0V8.5h-1.5A2.25 2.25 0 0 1 3.5 6.25v-.878a2.25 2.25 0 1 1 1.5 0ZM5 3.25a.75.75 0 1 0-1.5 0 .75.75 0 0 0 1.5 0Zm6.75.75a.75.75 0 1 0 0-1.5.75.75 0 0 0 0 1.5Zm-3 8.75a.75.75 0 1 0-1.5 0 .75.75 0 0 0 1.5 0Z"></path> </svg>Fork <span id="repo-network-counter" data-pjax-replace="true" data-turbo-replace="true" title="77,946" data-view-component="true" class="Counter">77.9k</span> </a> </li> <li> <div data-view-component="true" class="BtnGroup d-flex"> <a href="/login?return_to=%2Fjwasham%2Fcoding-interview-university" rel="nofollow" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"star button","repository_id":60493101,"auth_type":"LOG_IN","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="9a577f7c32b5ff726ef9b467d87ef0cacdc1aceafb20127c2a1223425d58a9bf" aria-label="You must be signed in to star a repository" data-view-component="true" class="tooltipped tooltipped-sw btn-sm btn"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-star v-align-text-bottom d-inline-block mr-2"> <path d="M8 .25a.75.75 0 0 1 .673.418l1.882 3.815 4.21.612a.75.75 0 0 1 .416 1.279l-3.046 2.97.719 4.192a.751.751 0 0 1-1.088.791L8 12.347l-3.766 1.98a.75.75 0 0 1-1.088-.79l.72-4.194L.818 6.374a.75.75 0 0 1 .416-1.28l4.21-.611L7.327.668A.75.75 0 0 1 8 .25Zm0 2.445L6.615 5.5a.75.75 0 0 1-.564.41l-3.097.45 2.24 2.184a.75.75 0 0 1 .216.664l-.528 3.084 2.769-1.456a.75.75 0 0 1 .698 0l2.77 1.456-.53-3.084a.75.75 0 0 1 .216-.664l2.24-2.183-3.096-.45a.75.75 0 0 1-.564-.41L8 2.694Z"></path> </svg><span data-view-component="true" class="d-inline"> Star </span> <span id="repo-stars-counter-star" aria-label="311963 users starred this repository" data-singular-suffix="user starred this repository" data-plural-suffix="users starred this repository" data-turbo-replace="true" title="311,963" data-view-component="true" class="Counter js-social-count">312k</span> </a></div> </li> </ul> </div> </div> <div id="responsive-meta-container" data-turbo-replace> <div class="d-block d-md-none mb-2 px-3 px-md-4 px-lg-5"> <p class="f4 mb-3 "> A complete computer science study plan to become a software engineer. </p> <h3 class="sr-only">License</h3> <div class="mb-2"> <a href="/jwasham/coding-interview-university/blob/main/LICENSE.txt" class="Link--muted" data-analytics-event="{"category":"Repository Overview","action":"click","label":"location:sidebar;file:license"}" > <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-law mr-2"> <path d="M8.75.75V2h.985c.304 0 .603.08.867.231l1.29.736c.038.022.08.033.124.033h2.234a.75.75 0 0 1 0 1.5h-.427l2.111 4.692a.75.75 0 0 1-.154.838l-.53-.53.529.531-.001.002-.002.002-.006.006-.006.005-.01.01-.045.04c-.21.176-.441.327-.686.45C14.556 10.78 13.88 11 13 11a4.498 4.498 0 0 1-2.023-.454 3.544 3.544 0 0 1-.686-.45l-.045-.04-.016-.015-.006-.006-.004-.004v-.001a.75.75 0 0 1-.154-.838L12.178 4.5h-.162c-.305 0-.604-.079-.868-.231l-1.29-.736a.245.245 0 0 0-.124-.033H8.75V13h2.5a.75.75 0 0 1 0 1.5h-6.5a.75.75 0 0 1 0-1.5h2.5V3.5h-.984a.245.245 0 0 0-.124.033l-1.289.737c-.265.15-.564.23-.869.23h-.162l2.112 4.692a.75.75 0 0 1-.154.838l-.53-.53.529.531-.001.002-.002.002-.006.006-.016.015-.045.04c-.21.176-.441.327-.686.45C4.556 10.78 3.88 11 3 11a4.498 4.498 0 0 1-2.023-.454 3.544 3.544 0 0 1-.686-.45l-.045-.04-.016-.015-.006-.006-.004-.004v-.001a.75.75 0 0 1-.154-.838L2.178 4.5H1.75a.75.75 0 0 1 0-1.5h2.234a.249.249 0 0 0 .125-.033l1.288-.737c.265-.15.564-.23.869-.23h.984V.75a.75.75 0 0 1 1.5 0Zm2.945 8.477c.285.135.718.273 1.305.273s1.02-.138 1.305-.273L13 6.327Zm-10 0c.285.135.718.273 1.305.273s1.02-.138 1.305-.273L3 6.327Z"></path> </svg> CC-BY-SA-4.0 license </a> </div> <div class="mb-3"> <a class="Link--secondary no-underline mr-3" href="/jwasham/coding-interview-university/stargazers"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-star mr-1"> <path d="M8 .25a.75.75 0 0 1 .673.418l1.882 3.815 4.21.612a.75.75 0 0 1 .416 1.279l-3.046 2.97.719 4.192a.751.751 0 0 1-1.088.791L8 12.347l-3.766 1.98a.75.75 0 0 1-1.088-.79l.72-4.194L.818 6.374a.75.75 0 0 1 .416-1.28l4.21-.611L7.327.668A.75.75 0 0 1 8 .25Zm0 2.445L6.615 5.5a.75.75 0 0 1-.564.41l-3.097.45 2.24 2.184a.75.75 0 0 1 .216.664l-.528 3.084 2.769-1.456a.75.75 0 0 1 .698 0l2.77 1.456-.53-3.084a.75.75 0 0 1 .216-.664l2.24-2.183-3.096-.45a.75.75 0 0 1-.564-.41L8 2.694Z"></path> </svg> <span class="text-bold">312k</span> stars </a> <a class="Link--secondary no-underline mr-3" href="/jwasham/coding-interview-university/forks"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-repo-forked mr-1"> <path d="M5 5.372v.878c0 .414.336.75.75.75h4.5a.75.75 0 0 0 .75-.75v-.878a2.25 2.25 0 1 1 1.5 0v.878a2.25 2.25 0 0 1-2.25 2.25h-1.5v2.128a2.251 2.251 0 1 1-1.5 0V8.5h-1.5A2.25 2.25 0 0 1 3.5 6.25v-.878a2.25 2.25 0 1 1 1.5 0ZM5 3.25a.75.75 0 1 0-1.5 0 .75.75 0 0 0 1.5 0Zm6.75.75a.75.75 0 1 0 0-1.5.75.75 0 0 0 0 1.5Zm-3 8.75a.75.75 0 1 0-1.5 0 .75.75 0 0 0 1.5 0Z"></path> </svg> <span class="text-bold">77.9k</span> forks </a> <a class="Link--secondary no-underline mr-3 d-inline-block" href="/jwasham/coding-interview-university/branches"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-git-branch mr-1"> <path d="M9.5 3.25a2.25 2.25 0 1 1 3 2.122V6A2.5 2.5 0 0 1 10 8.5H6a1 1 0 0 0-1 1v1.128a2.251 2.251 0 1 1-1.5 0V5.372a2.25 2.25 0 1 1 1.5 0v1.836A2.493 2.493 0 0 1 6 7h4a1 1 0 0 0 1-1v-.628A2.25 2.25 0 0 1 9.5 3.25Zm-6 0a.75.75 0 1 0 1.5 0 .75.75 0 0 0-1.5 0Zm8.25-.75a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5ZM4.25 12a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Z"></path> </svg> <span>Branches</span> </a> <a class="Link--secondary no-underline d-inline-block" href="/jwasham/coding-interview-university/tags"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-tag mr-1"> <path d="M1 7.775V2.75C1 1.784 1.784 1 2.75 1h5.025c.464 0 .91.184 1.238.513l6.25 6.25a1.75 1.75 0 0 1 0 2.474l-5.026 5.026a1.75 1.75 0 0 1-2.474 0l-6.25-6.25A1.752 1.752 0 0 1 1 7.775Zm1.5 0c0 .066.026.13.073.177l6.25 6.25a.25.25 0 0 0 .354 0l5.025-5.025a.25.25 0 0 0 0-.354l-6.25-6.25a.25.25 0 0 0-.177-.073H2.75a.25.25 0 0 0-.25.25ZM6 5a1 1 0 1 1 0 2 1 1 0 0 1 0-2Z"></path> </svg> <span>Tags</span> </a> <a class="Link--secondary no-underline d-inline-block" href="/jwasham/coding-interview-university/activity"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-pulse mr-1"> <path d="M6 2c.306 0 .582.187.696.471L10 10.731l1.304-3.26A.751.751 0 0 1 12 7h3.25a.75.75 0 0 1 0 1.5h-2.742l-1.812 4.528a.751.751 0 0 1-1.392 0L6 4.77 4.696 8.03A.75.75 0 0 1 4 8.5H.75a.75.75 0 0 1 0-1.5h2.742l1.812-4.529A.751.751 0 0 1 6 2Z"></path> </svg> <span>Activity</span> </a> </div> <div class="d-flex flex-wrap gap-2"> <div class="flex-1"> <div data-view-component="true" class="BtnGroup d-flex"> <a href="/login?return_to=%2Fjwasham%2Fcoding-interview-university" rel="nofollow" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"star button","repository_id":60493101,"auth_type":"LOG_IN","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="9a577f7c32b5ff726ef9b467d87ef0cacdc1aceafb20127c2a1223425d58a9bf" aria-label="You must be signed in to star a repository" data-view-component="true" class="tooltipped tooltipped-sw btn-sm btn btn-block"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-star v-align-text-bottom d-inline-block mr-2"> <path d="M8 .25a.75.75 0 0 1 .673.418l1.882 3.815 4.21.612a.75.75 0 0 1 .416 1.279l-3.046 2.97.719 4.192a.751.751 0 0 1-1.088.791L8 12.347l-3.766 1.98a.75.75 0 0 1-1.088-.79l.72-4.194L.818 6.374a.75.75 0 0 1 .416-1.28l4.21-.611L7.327.668A.75.75 0 0 1 8 .25Zm0 2.445L6.615 5.5a.75.75 0 0 1-.564.41l-3.097.45 2.24 2.184a.75.75 0 0 1 .216.664l-.528 3.084 2.769-1.456a.75.75 0 0 1 .698 0l2.77 1.456-.53-3.084a.75.75 0 0 1 .216-.664l2.24-2.183-3.096-.45a.75.75 0 0 1-.564-.41L8 2.694Z"></path> </svg><span data-view-component="true" class="d-inline"> Star </span> </a></div> </div> <div class="flex-1"> <a href="/login?return_to=%2Fjwasham%2Fcoding-interview-university" rel="nofollow" id="files-overview-watch-button" data-hydro-click="{"event_type":"authentication.click","payload":{"location_in_page":"notification subscription menu watch","repository_id":null,"auth_type":"LOG_IN","originating_url":"https://github.com/jwasham/coding-interview-university","user_id":null}}" data-hydro-click-hmac="a6408feb0ce6d0062d6995f767ef28cafd921500580c83e130a12d770ea88059" aria-label="You must be signed in to change notification settings" data-view-component="true" class="btn-sm btn btn-block"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-bell mr-2"> <path d="M8 16a2 2 0 0 0 1.985-1.75c.017-.137-.097-.25-.235-.25h-3.5c-.138 0-.252.113-.235.25A2 2 0 0 0 8 16ZM3 5a5 5 0 0 1 10 0v2.947c0 .05.015.098.042.139l1.703 2.555A1.519 1.519 0 0 1 13.482 13H2.518a1.516 1.516 0 0 1-1.263-2.36l1.703-2.554A.255.255 0 0 0 3 7.947Zm5-3.5A3.5 3.5 0 0 0 4.5 5v2.947c0 .346-.102.683-.294.97l-1.703 2.556a.017.017 0 0 0-.003.01l.001.006c0 .002.002.004.004.006l.006.004.007.001h10.964l.007-.001.006-.004.004-.006.001-.007a.017.017 0 0 0-.003-.01l-1.703-2.554a1.745 1.745 0 0 1-.294-.97V5A3.5 3.5 0 0 0 8 1.5Z"></path> </svg>Notifications </a> <tool-tip id="tooltip-95811675-56a6-4e11-b6be-e8a659807dd1" for="files-overview-watch-button" popover="manual" data-direction="s" data-type="description" data-view-component="true" class="sr-only position-absolute">You must be signed in to change notification settings</tool-tip> </div> <span> </span> </div> </div> </div> <nav data-pjax="#js-repo-pjax-container" aria-label="Repository" data-view-component="true" class="js-repo-nav js-sidenav-container-pjax js-responsive-underlinenav overflow-hidden UnderlineNav px-3 px-md-4 px-lg-5"> <ul data-view-component="true" class="UnderlineNav-body list-style-none"> <li data-view-component="true" class="d-inline-flex"> <a id="code-tab" href="/jwasham/coding-interview-university" data-tab-item="i0code-tab" data-selected-links="repo_source repo_downloads repo_commits repo_releases repo_tags repo_branches repo_packages repo_deployments repo_attestations /jwasham/coding-interview-university" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" data-hotkey="g c" data-analytics-event="{"category":"Underline navbar","action":"Click tab","label":"Code","target":"UNDERLINE_NAV.TAB"}" aria-current="page" data-view-component="true" class="UnderlineNav-item no-wrap js-responsive-underlinenav-item js-selected-navigation-item selected"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-code UnderlineNav-octicon d-none d-sm-inline"> <path d="m11.28 3.22 4.25 4.25a.75.75 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.275-.326.749.749 0 0 1 .215-.734L13.94 8l-3.72-3.72a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215Zm-6.56 0a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042L2.06 8l3.72 3.72a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L.47 8.53a.75.75 0 0 1 0-1.06Z"></path> </svg> <span data-content="Code">Code</span> <span id="code-repo-tab-count" data-pjax-replace="" data-turbo-replace="" title="Not available" data-view-component="true" class="Counter"></span> </a></li> <li data-view-component="true" class="d-inline-flex"> <a id="issues-tab" href="/jwasham/coding-interview-university/issues" data-tab-item="i1issues-tab" data-selected-links="repo_issues repo_labels repo_milestones /jwasham/coding-interview-university/issues" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" data-hotkey="g i" data-analytics-event="{"category":"Underline navbar","action":"Click tab","label":"Issues","target":"UNDERLINE_NAV.TAB"}" data-view-component="true" class="UnderlineNav-item no-wrap js-responsive-underlinenav-item js-selected-navigation-item"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-issue-opened UnderlineNav-octicon d-none d-sm-inline"> <path d="M8 9.5a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Z"></path><path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Z"></path> </svg> <span data-content="Issues">Issues</span> <span id="issues-repo-tab-count" data-pjax-replace="" data-turbo-replace="" title="52" data-view-component="true" class="Counter">52</span> </a></li> <li data-view-component="true" class="d-inline-flex"> <a id="pull-requests-tab" href="/jwasham/coding-interview-university/pulls" data-tab-item="i2pull-requests-tab" data-selected-links="repo_pulls checks /jwasham/coding-interview-university/pulls" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" data-hotkey="g p" data-analytics-event="{"category":"Underline navbar","action":"Click tab","label":"Pull requests","target":"UNDERLINE_NAV.TAB"}" data-view-component="true" class="UnderlineNav-item no-wrap js-responsive-underlinenav-item js-selected-navigation-item"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-git-pull-request UnderlineNav-octicon d-none d-sm-inline"> <path d="M1.5 3.25a2.25 2.25 0 1 1 3 2.122v5.256a2.251 2.251 0 1 1-1.5 0V5.372A2.25 2.25 0 0 1 1.5 3.25Zm5.677-.177L9.573.677A.25.25 0 0 1 10 .854V2.5h1A2.5 2.5 0 0 1 13.5 5v5.628a2.251 2.251 0 1 1-1.5 0V5a1 1 0 0 0-1-1h-1v1.646a.25.25 0 0 1-.427.177L7.177 3.427a.25.25 0 0 1 0-.354ZM3.75 2.5a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Zm0 9.5a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Zm8.25.75a.75.75 0 1 0 1.5 0 .75.75 0 0 0-1.5 0Z"></path> </svg> <span data-content="Pull requests">Pull requests</span> <span id="pull-requests-repo-tab-count" data-pjax-replace="" data-turbo-replace="" title="8" data-view-component="true" class="Counter">8</span> </a></li> <li data-view-component="true" class="d-inline-flex"> <a id="actions-tab" href="/jwasham/coding-interview-university/actions" data-tab-item="i3actions-tab" data-selected-links="repo_actions /jwasham/coding-interview-university/actions" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" data-hotkey="g a" data-analytics-event="{"category":"Underline navbar","action":"Click tab","label":"Actions","target":"UNDERLINE_NAV.TAB"}" data-view-component="true" class="UnderlineNav-item no-wrap js-responsive-underlinenav-item js-selected-navigation-item"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-play UnderlineNav-octicon d-none d-sm-inline"> <path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Zm4.879-2.773 4.264 2.559a.25.25 0 0 1 0 .428l-4.264 2.559A.25.25 0 0 1 6 10.559V5.442a.25.25 0 0 1 .379-.215Z"></path> </svg> <span data-content="Actions">Actions</span> <span id="actions-repo-tab-count" data-pjax-replace="" data-turbo-replace="" title="Not available" data-view-component="true" class="Counter"></span> </a></li> <li data-view-component="true" class="d-inline-flex"> <a id="security-tab" href="/jwasham/coding-interview-university/security" data-tab-item="i4security-tab" data-selected-links="security overview alerts policy token_scanning code_scanning /jwasham/coding-interview-university/security" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" data-hotkey="g s" data-analytics-event="{"category":"Underline navbar","action":"Click tab","label":"Security","target":"UNDERLINE_NAV.TAB"}" data-view-component="true" class="UnderlineNav-item no-wrap js-responsive-underlinenav-item js-selected-navigation-item"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-shield UnderlineNav-octicon d-none d-sm-inline"> <path d="M7.467.133a1.748 1.748 0 0 1 1.066 0l5.25 1.68A1.75 1.75 0 0 1 15 3.48V7c0 1.566-.32 3.182-1.303 4.682-.983 1.498-2.585 2.813-5.032 3.855a1.697 1.697 0 0 1-1.33 0c-2.447-1.042-4.049-2.357-5.032-3.855C1.32 10.182 1 8.566 1 7V3.48a1.75 1.75 0 0 1 1.217-1.667Zm.61 1.429a.25.25 0 0 0-.153 0l-5.25 1.68a.25.25 0 0 0-.174.238V7c0 1.358.275 2.666 1.057 3.86.784 1.194 2.121 2.34 4.366 3.297a.196.196 0 0 0 .154 0c2.245-.956 3.582-2.104 4.366-3.298C13.225 9.666 13.5 8.36 13.5 7V3.48a.251.251 0 0 0-.174-.237l-5.25-1.68ZM8.75 4.75v3a.75.75 0 0 1-1.5 0v-3a.75.75 0 0 1 1.5 0ZM9 10.5a1 1 0 1 1-2 0 1 1 0 0 1 2 0Z"></path> </svg> <span data-content="Security">Security</span> <include-fragment src="/jwasham/coding-interview-university/security/overall-count" accept="text/fragment+html"></include-fragment> </a></li> <li data-view-component="true" class="d-inline-flex"> <a id="insights-tab" href="/jwasham/coding-interview-university/pulse" data-tab-item="i5insights-tab" data-selected-links="repo_graphs repo_contributors dependency_graph dependabot_updates pulse people community /jwasham/coding-interview-university/pulse" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame" data-analytics-event="{"category":"Underline navbar","action":"Click tab","label":"Insights","target":"UNDERLINE_NAV.TAB"}" data-view-component="true" class="UnderlineNav-item no-wrap js-responsive-underlinenav-item js-selected-navigation-item"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-graph UnderlineNav-octicon d-none d-sm-inline"> <path d="M1.5 1.75V13.5h13.75a.75.75 0 0 1 0 1.5H.75a.75.75 0 0 1-.75-.75V1.75a.75.75 0 0 1 1.5 0Zm14.28 2.53-5.25 5.25a.75.75 0 0 1-1.06 0L7 7.06 4.28 9.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.25-3.25a.75.75 0 0 1 1.06 0L10 7.94l4.72-4.72a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042Z"></path> </svg> <span data-content="Insights">Insights</span> <span id="insights-repo-tab-count" data-pjax-replace="" data-turbo-replace="" title="Not available" data-view-component="true" class="Counter"></span> </a></li> </ul> <div style="visibility:hidden;" data-view-component="true" class="UnderlineNav-actions js-responsive-underlinenav-overflow position-absolute pr-3 pr-md-4 pr-lg-5 right-0"> <action-menu data-select-variant="none" data-view-component="true"> <focus-group direction="vertical" mnemonics retain> <button id="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-button" popovertarget="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-overlay" aria-controls="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-list" aria-haspopup="true" aria-labelledby="tooltip-94fa4b35-60ec-4761-8774-61e87563e517" type="button" data-view-component="true" class="Button Button--iconOnly Button--secondary Button--medium UnderlineNav-item"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-kebab-horizontal Button-visual"> <path d="M8 9a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3ZM1.5 9a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Zm13 0a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Z"></path> </svg> </button><tool-tip id="tooltip-94fa4b35-60ec-4761-8774-61e87563e517" for="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-button" popover="manual" data-direction="s" data-type="label" data-view-component="true" class="sr-only position-absolute">Additional navigation options</tool-tip> <anchored-position data-target="action-menu.overlay" id="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-overlay" anchor="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-button" align="start" side="outside-bottom" anchor-offset="normal" popover="auto" data-view-component="true"> <div data-view-component="true" class="Overlay Overlay--size-auto"> <div data-view-component="true" class="Overlay-body Overlay-body--paddingNone"> <action-list> <div data-view-component="true"> <ul aria-labelledby="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-button" id="action-menu-9f51edcf-8528-4eac-aef1-f7192c02b7d0-list" role="menu" data-view-component="true" class="ActionListWrap--inset ActionListWrap"> <li hidden="hidden" data-menu-item="i0code-tab" data-targets="action-list.items" role="none" data-view-component="true" class="ActionListItem"> <a tabindex="-1" id="item-56352d77-02a3-4e8c-bc3b-0eddbe333204" href="/jwasham/coding-interview-university" role="menuitem" data-view-component="true" class="ActionListContent ActionListContent--visual16"> <span class="ActionListItem-visual ActionListItem-visual--leading"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-code"> <path d="m11.28 3.22 4.25 4.25a.75.75 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.275-.326.749.749 0 0 1 .215-.734L13.94 8l-3.72-3.72a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215Zm-6.56 0a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042L2.06 8l3.72 3.72a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L.47 8.53a.75.75 0 0 1 0-1.06Z"></path> </svg> </span> <span data-view-component="true" class="ActionListItem-label"> Code </span> </a> </li> <li hidden="hidden" data-menu-item="i1issues-tab" data-targets="action-list.items" role="none" data-view-component="true" class="ActionListItem"> <a tabindex="-1" id="item-997b611f-de96-4e8d-ac71-dc172ccd09f4" href="/jwasham/coding-interview-university/issues" role="menuitem" data-view-component="true" class="ActionListContent ActionListContent--visual16"> <span class="ActionListItem-visual ActionListItem-visual--leading"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-issue-opened"> <path d="M8 9.5a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Z"></path><path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Z"></path> </svg> </span> <span data-view-component="true" class="ActionListItem-label"> Issues </span> </a> </li> <li hidden="hidden" data-menu-item="i2pull-requests-tab" data-targets="action-list.items" role="none" data-view-component="true" class="ActionListItem"> <a tabindex="-1" id="item-ff392278-6159-4c08-9c2e-7efdeb77200e" href="/jwasham/coding-interview-university/pulls" role="menuitem" data-view-component="true" class="ActionListContent ActionListContent--visual16"> <span class="ActionListItem-visual ActionListItem-visual--leading"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-git-pull-request"> <path d="M1.5 3.25a2.25 2.25 0 1 1 3 2.122v5.256a2.251 2.251 0 1 1-1.5 0V5.372A2.25 2.25 0 0 1 1.5 3.25Zm5.677-.177L9.573.677A.25.25 0 0 1 10 .854V2.5h1A2.5 2.5 0 0 1 13.5 5v5.628a2.251 2.251 0 1 1-1.5 0V5a1 1 0 0 0-1-1h-1v1.646a.25.25 0 0 1-.427.177L7.177 3.427a.25.25 0 0 1 0-.354ZM3.75 2.5a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Zm0 9.5a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Zm8.25.75a.75.75 0 1 0 1.5 0 .75.75 0 0 0-1.5 0Z"></path> </svg> </span> <span data-view-component="true" class="ActionListItem-label"> Pull requests </span> </a> </li> <li hidden="hidden" data-menu-item="i3actions-tab" data-targets="action-list.items" role="none" data-view-component="true" class="ActionListItem"> <a tabindex="-1" id="item-c45e29c0-5d1b-4939-a617-75232dd58a1d" href="/jwasham/coding-interview-university/actions" role="menuitem" data-view-component="true" class="ActionListContent ActionListContent--visual16"> <span class="ActionListItem-visual ActionListItem-visual--leading"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-play"> <path d="M8 0a8 8 0 1 1 0 16A8 8 0 0 1 8 0ZM1.5 8a6.5 6.5 0 1 0 13 0 6.5 6.5 0 0 0-13 0Zm4.879-2.773 4.264 2.559a.25.25 0 0 1 0 .428l-4.264 2.559A.25.25 0 0 1 6 10.559V5.442a.25.25 0 0 1 .379-.215Z"></path> </svg> </span> <span data-view-component="true" class="ActionListItem-label"> Actions </span> </a> </li> <li hidden="hidden" data-menu-item="i4security-tab" data-targets="action-list.items" role="none" data-view-component="true" class="ActionListItem"> <a tabindex="-1" id="item-2e755f8b-5537-4c68-b059-b7fc88b8d726" href="/jwasham/coding-interview-university/security" role="menuitem" data-view-component="true" class="ActionListContent ActionListContent--visual16"> <span class="ActionListItem-visual ActionListItem-visual--leading"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-shield"> <path d="M7.467.133a1.748 1.748 0 0 1 1.066 0l5.25 1.68A1.75 1.75 0 0 1 15 3.48V7c0 1.566-.32 3.182-1.303 4.682-.983 1.498-2.585 2.813-5.032 3.855a1.697 1.697 0 0 1-1.33 0c-2.447-1.042-4.049-2.357-5.032-3.855C1.32 10.182 1 8.566 1 7V3.48a1.75 1.75 0 0 1 1.217-1.667Zm.61 1.429a.25.25 0 0 0-.153 0l-5.25 1.68a.25.25 0 0 0-.174.238V7c0 1.358.275 2.666 1.057 3.86.784 1.194 2.121 2.34 4.366 3.297a.196.196 0 0 0 .154 0c2.245-.956 3.582-2.104 4.366-3.298C13.225 9.666 13.5 8.36 13.5 7V3.48a.251.251 0 0 0-.174-.237l-5.25-1.68ZM8.75 4.75v3a.75.75 0 0 1-1.5 0v-3a.75.75 0 0 1 1.5 0ZM9 10.5a1 1 0 1 1-2 0 1 1 0 0 1 2 0Z"></path> </svg> </span> <span data-view-component="true" class="ActionListItem-label"> Security </span> </a> </li> <li hidden="hidden" data-menu-item="i5insights-tab" data-targets="action-list.items" role="none" data-view-component="true" class="ActionListItem"> <a tabindex="-1" id="item-fd0ecf73-18da-4e46-a6e0-b83d26912aad" href="/jwasham/coding-interview-university/pulse" role="menuitem" data-view-component="true" class="ActionListContent ActionListContent--visual16"> <span class="ActionListItem-visual ActionListItem-visual--leading"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-graph"> <path d="M1.5 1.75V13.5h13.75a.75.75 0 0 1 0 1.5H.75a.75.75 0 0 1-.75-.75V1.75a.75.75 0 0 1 1.5 0Zm14.28 2.53-5.25 5.25a.75.75 0 0 1-1.06 0L7 7.06 4.28 9.78a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042l3.25-3.25a.75.75 0 0 1 1.06 0L10 7.94l4.72-4.72a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042Z"></path> </svg> </span> <span data-view-component="true" class="ActionListItem-label"> Insights </span> </a> </li> </ul> </div></action-list> </div> </div></anchored-position> </focus-group> </action-menu></div> </nav> </div> <turbo-frame id="repo-content-turbo-frame" target="_top" data-turbo-action="advance" class=""> <div id="repo-content-pjax-container" class="repository-content " > <h1 class='sr-only'>jwasham/coding-interview-university</h1> <div class="clearfix container-xl px-md-4 px-lg-5 px-3"> <div> <div style="max-width: 100%" data-view-component="true" class="Layout Layout--flowRow-until-md react-repos-overview-margin Layout--sidebarPosition-end Layout--sidebarPosition-flowRow-end"> <div data-view-component="true" class="Layout-main"> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_dompurify_dist_purify_js-b89b98661809.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_tanstack_query-core_build_modern_queryObserver_js-node_modules_tanstack_-defd52-843b41414e0e.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/vendors-node_modules_github_hydro-analytics-client_dist_analytics-client_js-node_modules_gith-853b24-f2006d2a5b98.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_aria-live_aria-live_ts-ui_packages_promise-with-resolvers-polyfill_promise-with-r-17c672-d6b5ea82572a.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_paths_index_ts-73c512ff3577.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_ref-selector_RefSelector_tsx-2cce17df147b.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/ui_packages_code-view-shared_hooks_use-canonical-object_ts-ui_packages_code-view-shared_hooks-a6859a-09c7f754ea79.js"></script> <script crossorigin="anonymous" defer="defer" type="application/javascript" src="https://github.githubassets.com/assets/repos-overview-d88ea0b31285.js"></script> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/primer-react.f5cae0c610a2c4c470c2.module.css" /> <link crossorigin="anonymous" media="all" rel="stylesheet" href="https://github.githubassets.com/assets/repos-overview.32a87dc4587d56dcf1eb.module.css" /> <react-partial partial-name="repos-overview" data-ssr="true" data-attempted-ssr="true" > <script type="application/json" data-target="react-partial.embeddedData">{"props":{"initialPayload":{"allShortcutsEnabled":false,"path":"/","repo":{"id":60493101,"defaultBranch":"main","name":"coding-interview-university","ownerLogin":"jwasham","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2016-06-06T02:34:12.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/3771963?v=4","public":true,"private":false,"isOrgOwned":false},"currentUser":null,"refInfo":{"name":"main","listCacheKey":"v0:1612660811.713015","canEdit":false,"refType":"branch","currentOid":"717298bf219a30d7fb0671285c5f057b1bb74b27"},"tree":{"items":[{"name":".github/workflows","path":".github/workflows","contentType":"directory","hasSimplifiedPath":true},{"name":"extras/cheat sheets","path":"extras/cheat sheets","contentType":"directory","hasSimplifiedPath":true},{"name":"translations","path":"translations","contentType":"directory"},{"name":".gitignore","path":".gitignore","contentType":"file"},{"name":"LICENSE.txt","path":"LICENSE.txt","contentType":"file"},{"name":"README.md","path":"README.md","contentType":"file"},{"name":"programming-language-resources.md","path":"programming-language-resources.md","contentType":"file"}],"templateDirectorySuggestionUrl":null,"readme":null,"totalCount":7,"showBranchInfobar":false},"fileTree":null,"fileTreeProcessingTime":null,"foldersToFetch":[],"treeExpanded":false,"symbolsExpanded":false,"isOverview":true,"overview":{"banners":{"shouldRecommendReadme":false,"isPersonalRepo":false,"showUseActionBanner":false,"actionSlug":null,"actionId":null,"showProtectBranchBanner":false,"publishBannersInfo":{"dismissActionNoticePath":"/settings/dismiss-notice/publish_action_from_repo","releasePath":"/jwasham/coding-interview-university/releases/new?marketplace=true","showPublishActionBanner":false},"interactionLimitBanner":null,"showInvitationBanner":false,"inviterName":null,"actionsMigrationBannerInfo":{"releaseTags":[],"showImmutableActionsMigrationBanner":false,"initialMigrationStatus":null}},"codeButton":{"contactPath":"/contact","isEnterprise":false,"local":{"protocolInfo":{"httpAvailable":true,"sshAvailable":null,"httpUrl":"https://github.com/jwasham/coding-interview-university.git","showCloneWarning":null,"sshUrl":null,"sshCertificatesRequired":null,"sshCertificatesAvailable":null,"ghCliUrl":"gh repo clone jwasham/coding-interview-university","defaultProtocol":"http","newSshKeyUrl":"/settings/ssh/new","setProtocolPath":"/users/set_protocol"},"platformInfo":{"cloneUrl":"https://desktop.github.com","showVisualStudioCloneButton":false,"visualStudioCloneUrl":"https://windows.github.com","showXcodeCloneButton":false,"xcodeCloneUrl":"xcode://clone?repo=https%3A%2F%2Fgithub.com%2Fjwasham%2Fcoding-interview-university","zipballUrl":"/jwasham/coding-interview-university/archive/refs/heads/main.zip"}},"newCodespacePath":"/codespaces/new?hide_repo_select=true\u0026repo=60493101"},"popovers":{"rename":null,"renamedParentRepo":null},"commitCount":"2,511","overviewFiles":[{"displayName":"README.md","repoName":"coding-interview-university","refName":"main","path":"README.md","preferredFileType":"readme","tabName":"README","richText":"\u003carticle class=\"markdown-body entry-content container-lg\" itemprop=\"text\"\u003e\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch1 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCoding Interview University\u003c/h1\u003e\u003ca id=\"user-content-coding-interview-university\" class=\"anchor\" aria-label=\"Permalink: Coding Interview University\" href=\"#coding-interview-university\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cblockquote\u003e\n\u003cp dir=\"auto\"\u003eI originally created this as a short to-do list of study topics for becoming a software engineer,\nbut it grew to the large list you see today. After going through this study plan, \u003ca href=\"https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu\" rel=\"nofollow\"\u003eI got hired\nas a Software Development Engineer at Amazon\u003c/a\u003e!\nYou probably won't have to study as much as I did. Anyway, everything you need is here.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eI studied about 8-12 hours a day, for several months. This is my story: \u003ca href=\"https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13\" rel=\"nofollow\"\u003eWhy I studied full-time for 8 months for a Google interview\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003ePlease Note:\u003c/strong\u003e You won't need to study as much as I did. I wasted a lot of time on things I didn't need to know. More info about that is below. I'll help you get there without wasting your precious time.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eThe items listed here will prepare you well for a technical interview at just about any software company,\nincluding the giants: Amazon, Facebook, Google, and Microsoft.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cem\u003eBest of luck to you!\u003c/em\u003e\u003c/p\u003e\n\u003c/blockquote\u003e\n\u003cdetails\u003e\n\u003csummary\u003eTranslations:\u003c/summary\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-id.md\"\u003eBahasa Indonesia\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-bg.md\"\u003eBulgarian\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-es.md\"\u003eEspañol\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-de.md\"\u003eGerman\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-ja.md\"\u003eJapanese (日本語)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-mr.md\"\u003eMarathi\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-pl.md\"\u003ePolish\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-ptbr.md\"\u003ePortuguês Brasileiro\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-ru.md\"\u003eRussian\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-vi.md\"\u003eTiếng Việt - Vietnamese\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-ur.md\"\u003eUrdu - اردو\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-uz.md\"\u003eUzbek\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-bn.md\"\u003eবাংলা - Bangla\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-kh.md\"\u003eខ្មែរ - Khmer\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-cn.md\"\u003e简体中文\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/translations/README-tw.md\"\u003e繁體中文\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/details\u003e\n\u003cdetails\u003e\n\u003csummary\u003eTranslations in progress:\u003c/summary\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/1164\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/1164/hovercard\"\u003eAfrikaans\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/98\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/98/hovercard\"\u003eArabic\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/89\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/89/hovercard\"\u003eFrench\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/166\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/166/hovercard\"\u003eGreek\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/1030\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/1030/hovercard\"\u003eItalian\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/118\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/118/hovercard\"\u003eKorean(한국어)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/239\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/239/hovercard\"\u003eMalayalam\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/186\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/186/hovercard\"\u003ePersian - Farsi\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/117\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/117/hovercard\"\u003eTelugu\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/156\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/156/hovercard\"\u003eThai\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/90\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/90/hovercard\"\u003eTurkish\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/106\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/106/hovercard\"\u003eУкраїнська\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/82\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/82/hovercard\"\u003eעברית\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/issues/81\" data-hovercard-type=\"issue\" data-hovercard-url=\"/jwasham/coding-interview-university/issues/81/hovercard\"\u003eहिन्दी\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/details\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eWhat is it?\u003c/h2\u003e\u003ca id=\"user-content-what-is-it\" class=\"anchor\" aria-label=\"Permalink: What is it?\" href=\"#what-is-it\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003e\u003ca target=\"_blank\" rel=\"noopener noreferrer nofollow\" href=\"https://camo.githubusercontent.com/8c889e19270293b87b4569c4edb3a024d4a586a37d6529c74a9f26d276f364de/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f636f64696e672d61742d7468652d7768697465626f6172642d73696c69636f6e2d76616c6c65792e706e67\"\u003e\u003cimg src=\"https://camo.githubusercontent.com/8c889e19270293b87b4569c4edb3a024d4a586a37d6529c74a9f26d276f364de/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f636f64696e672d61742d7468652d7768697465626f6172642d73696c69636f6e2d76616c6c65792e706e67\" alt=\"Coding at the whiteboard - from HBO's Silicon Valley\" data-canonical-src=\"https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png\" style=\"max-width: 100%;\"\u003e\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eThis is my multi-month study plan for becoming a software engineer for a large company.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eRequired:\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eA little experience with coding (variables, loops, methods/functions, etc)\u003c/li\u003e\n\u003cli\u003ePatience\u003c/li\u003e\n\u003cli\u003eTime\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eNote this is a study plan for \u003cstrong\u003esoftware engineering\u003c/strong\u003e, not frontend engineering or full-stack development. There are really\nsuper roadmaps and coursework for those career paths elsewhere (see \u003ca href=\"https://roadmap.sh/\" rel=\"nofollow\"\u003ehttps://roadmap.sh/\u003c/a\u003e for more info).\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eThere is a lot to learn in a university Computer Science program, but only knowing about 75% is good enough for an interview, so that's what I cover here.\nFor a complete CS self-taught program, the resources for my study plan have been included in Kamran Ahmed's Computer Science Roadmap: \u003ca href=\"https://roadmap.sh/computer-science\" rel=\"nofollow\"\u003ehttps://roadmap.sh/computer-science\u003c/a\u003e\u003c/p\u003e\n\u003chr\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTable of Contents\u003c/h2\u003e\u003ca id=\"user-content-table-of-contents\" class=\"anchor\" aria-label=\"Permalink: Table of Contents\" href=\"#table-of-contents\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eThe Study Plan\u003c/h3\u003e\u003ca id=\"user-content-the-study-plan\" class=\"anchor\" aria-label=\"Permalink: The Study Plan\" href=\"#the-study-plan\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#what-is-it\"\u003eWhat is it?\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#why-use-it\"\u003eWhy use it?\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#how-to-use-it\"\u003eHow to use it\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#dont-feel-you-arent-smart-enough\"\u003eDon't feel you aren't smart enough\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#a-note-about-video-resources\"\u003eA Note About Video Resources\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#choose-a-programming-language\"\u003eChoose a Programming Language\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#books-for-data-structures-and-algorithms\"\u003eBooks for Data Structures and Algorithms\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#interview-prep-books\"\u003eInterview Prep Books\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#dont-make-my-mistakes\"\u003eDon't Make My Mistakes\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#what-you-wont-see-covered\"\u003eWhat you Won't See Covered\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#the-daily-plan\"\u003eThe Daily Plan\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#coding-question-practice\"\u003eCoding Question Practice\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#coding-problems\"\u003eCoding Problems\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTopics of Study\u003c/h3\u003e\u003ca id=\"user-content-topics-of-study\" class=\"anchor\" aria-label=\"Permalink: Topics of Study\" href=\"#topics-of-study\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#algorithmic-complexity--big-o--asymptotic-analysis\"\u003eAlgorithmic complexity / Big-O / Asymptotic analysis\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#data-structures\"\u003eData Structures\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#arrays\"\u003eArrays\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#linked-lists\"\u003eLinked Lists\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#stack\"\u003eStack\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#queue\"\u003eQueue\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#hash-table\"\u003eHash table\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#more-knowledge\"\u003eMore Knowledge\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#binary-search\"\u003eBinary search\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#bitwise-operations\"\u003eBitwise operations\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#trees\"\u003eTrees\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#trees---intro\"\u003eTrees - Intro\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#binary-search-trees-bsts\"\u003eBinary search trees: BSTs\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#heap--priority-queue--binary-heap\"\u003eHeap / Priority Queue / Binary Heap\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003ebalanced search trees (general concept, not details)\u003c/li\u003e\n\u003cli\u003etraversals: preorder, inorder, postorder, BFS, DFS\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#sorting\"\u003eSorting\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eselection\u003c/li\u003e\n\u003cli\u003einsertion\u003c/li\u003e\n\u003cli\u003eheapsort\u003c/li\u003e\n\u003cli\u003equicksort\u003c/li\u003e\n\u003cli\u003emergesort\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#graphs\"\u003eGraphs\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003edirected\u003c/li\u003e\n\u003cli\u003eundirected\u003c/li\u003e\n\u003cli\u003eadjacency matrix\u003c/li\u003e\n\u003cli\u003eadjacency list\u003c/li\u003e\n\u003cli\u003etraversals: BFS, DFS\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#even-more-knowledge\"\u003eEven More Knowledge\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#recursion\"\u003eRecursion\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#dynamic-programming\"\u003eDynamic Programming\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#design-patterns\"\u003eDesign Patterns\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#combinatorics-n-choose-k--probability\"\u003eCombinatorics (n choose k) \u0026amp; Probability\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#np-np-complete-and-approximation-algorithms\"\u003eNP, NP-Complete and Approximation Algorithms\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#how-computers-process-a-program\"\u003eHow computers process a program\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#caches\"\u003eCaches\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#processes-and-threads\"\u003eProcesses and Threads\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#testing\"\u003eTesting\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#string-searching--manipulations\"\u003eString searching \u0026amp; manipulations\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#tries\"\u003eTries\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#floating-point-numbers\"\u003eFloating Point Numbers\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#unicode\"\u003eUnicode\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#endianness\"\u003eEndianness\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#networking\"\u003eNetworking\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#final-review\"\u003eFinal Review\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eGetting the Job\u003c/h3\u003e\u003ca id=\"user-content-getting-the-job\" class=\"anchor\" aria-label=\"Permalink: Getting the Job\" href=\"#getting-the-job\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#update-your-resume\"\u003eUpdate Your Resume\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#find-a-job\"\u003eFind a Job\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#interview-process--general-interview-prep\"\u003eInterview Process \u0026amp; General Interview Prep\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#be-thinking-of-for-when-the-interview-comes\"\u003eBe thinking of for when the interview comes\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#have-questions-for-the-interviewer\"\u003eHave questions for the interviewer\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#once-youve-got-the-job\"\u003eOnce You've Got The Job\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e---------------- Everything below this point is optional ----------------\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eOptional Extra Topics \u0026amp; Resources\u003c/h3\u003e\u003ca id=\"user-content-optional-extra-topics--resources\" class=\"anchor\" aria-label=\"Permalink: Optional Extra Topics \u0026amp; Resources\" href=\"#optional-extra-topics--resources\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#additional-books\"\u003eAdditional Books\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#system-design-scalability-data-handling\"\u003eSystem Design, Scalability, Data Handling\u003c/a\u003e (if you have 4+ years experience)\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#additional-learning\"\u003eAdditional Learning\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"#compilers\"\u003eCompilers\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#emacs-and-vim\"\u003eEmacs and vi(m)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#unix-command-line-tools\"\u003eUnix command line tools\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#information-theory-videos\"\u003eInformation theory\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#parity--hamming-code-videos\"\u003eParity \u0026amp; Hamming Code\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#entropy\"\u003eEntropy\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#cryptography\"\u003eCryptography\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#compression\"\u003eCompression\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#computer-security\"\u003eComputer Security\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#garbage-collection\"\u003eGarbage collection\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#parallel-programming\"\u003eParallel Programming\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#messaging-serialization-and-queueing-systems\"\u003eMessaging, Serialization, and Queueing Systems\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#a\"\u003eA*\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#fast-fourier-transform\"\u003eFast Fourier Transform\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#bloom-filter\"\u003eBloom Filter\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#hyperloglog\"\u003eHyperLogLog\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#locality-sensitive-hashing\"\u003eLocality-Sensitive Hashing\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#van-emde-boas-trees\"\u003evan Emde Boas Trees\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#augmented-data-structures\"\u003eAugmented Data Structures\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#balanced-search-trees\"\u003eBalanced search trees\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAVL trees\u003c/li\u003e\n\u003cli\u003eSplay trees\u003c/li\u003e\n\u003cli\u003eRed/black trees\u003c/li\u003e\n\u003cli\u003e2-3 search trees\u003c/li\u003e\n\u003cli\u003e2-3-4 Trees (aka 2-4 trees)\u003c/li\u003e\n\u003cli\u003eN-ary (K-ary, M-ary) trees\u003c/li\u003e\n\u003cli\u003eB-Trees\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#k-d-trees\"\u003ek-D Trees\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#skip-lists\"\u003eSkip lists\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#network-flows\"\u003eNetwork Flows\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#disjoint-sets--union-find\"\u003eDisjoint Sets \u0026amp; Union Find\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#math-for-fast-processing\"\u003eMath for Fast Processing\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#treap\"\u003eTreap\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#linear-programming-videos\"\u003eLinear Programming\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#geometry-convex-hull-videos\"\u003eGeometry, Convex hull\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#discrete-math\"\u003eDiscrete math\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#additional-detail-on-some-subjects\"\u003eAdditional Detail on Some Subjects\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#video-series\"\u003eVideo Series\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#computer-science-courses\"\u003eComputer Science Courses\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"#papers\"\u003ePapers\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003chr\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eWhy use it?\u003c/h2\u003e\u003ca id=\"user-content-why-use-it\" class=\"anchor\" aria-label=\"Permalink: Why use it?\" href=\"#why-use-it\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eIf you want to work as a software engineer for a large company, these are the things you have to know.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eIf you missed out on getting a degree in computer science, like I did, this will catch you up and save four years of your life.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eWhen I started this project, I didn't know a stack from a heap, didn't know Big-O anything, or anything about trees, or how to\ntraverse a graph. If I had to code a sorting algorithm, I can tell ya it would have been terrible.\nEvery data structure I had ever used was built into the language, and I didn't know how they worked\nunder the hood at all. I never had to manage memory unless a process I was running would give an \"out of\nmemory\" error, and then I'd have to find a workaround. I used a few multidimensional arrays in my life and\nthousands of associative arrays, but I never created data structures from scratch.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eIt's a long plan. It may take you months. If you are familiar with a lot of this already it will take you a lot less time.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eHow to use it\u003c/h2\u003e\u003ca id=\"user-content-how-to-use-it\" class=\"anchor\" aria-label=\"Permalink: How to use it\" href=\"#how-to-use-it\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eEverything below is an outline, and you should tackle the items in order from top to bottom.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eI'm using GitHub's special markdown flavor, including tasks lists to track progress.\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown\"\u003eMore about GitHub-flavored markdown\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eIf you don't want to use git\u003c/h3\u003e\u003ca id=\"user-content-if-you-dont-want-to-use-git\" class=\"anchor\" aria-label=\"Permalink: If you don't want to use git\" href=\"#if-you-dont-want-to-use-git\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eOn this page, click the Code button near the top, then click \"Download ZIP\". Unzip the file and you can work with the text files.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eIf you're open in a code editor that understands markdown, you'll see everything formatted nicely.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003ca target=\"_blank\" rel=\"noopener noreferrer nofollow\" href=\"https://camo.githubusercontent.com/d978fd57421706891a262cf334d878f252c956cdde4e04ed839d5651060f5460/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f686f772d746f2d646f776e6c6f61642d61732d7a69702e706e67\"\u003e\u003cimg src=\"https://camo.githubusercontent.com/d978fd57421706891a262cf334d878f252c956cdde4e04ed839d5651060f5460/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f686f772d746f2d646f776e6c6f61642d61732d7a69702e706e67\" alt=\"How to download the repo as a zip file\" data-canonical-src=\"https://d3j2pkmjtin6ou.cloudfront.net/how-to-download-as-zip.png\" style=\"max-width: 100%;\"\u003e\u003c/a\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eIf you're comfortable with git\u003c/h3\u003e\u003ca id=\"user-content-if-youre-comfortable-with-git\" class=\"anchor\" aria-label=\"Permalink: If you're comfortable with git\" href=\"#if-youre-comfortable-with-git\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eCreate a new branch so you can check items like this, just put an x in the brackets: [x]\u003c/p\u003e\n\u003col dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cem\u003e\u003cstrong\u003eFork the GitHub repo:\u003c/strong\u003e\u003c/em\u003e \u003ccode\u003ehttps://github.com/jwasham/coding-interview-university\u003c/code\u003e by clicking on the Fork button.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003ca target=\"_blank\" rel=\"noopener noreferrer nofollow\" href=\"https://camo.githubusercontent.com/f9c7278a5fb5a4cdaec00d3b6e20298a8037411eb5733b23d3c7875b6f1fcc5f/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f666f726b2d627574746f6e2e706e67\"\u003e\u003cimg src=\"https://camo.githubusercontent.com/f9c7278a5fb5a4cdaec00d3b6e20298a8037411eb5733b23d3c7875b6f1fcc5f/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f666f726b2d627574746f6e2e706e67\" alt=\"Fork the GitHub repo\" data-canonical-src=\"https://d3j2pkmjtin6ou.cloudfront.net/fork-button.png\" style=\"max-width: 100%;\"\u003e\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eClone to your local repo:\u003c/p\u003e\n\u003cdiv class=\"highlight highlight-source-shell notranslate position-relative overflow-auto\" dir=\"auto\" data-snippet-clipboard-copy-content=\"git clone https://github.com/\u0026lt;YOUR_GITHUB_USERNAME\u0026gt;/coding-interview-university.git\ncd coding-interview-university\ngit remote add upstream https://github.com/jwasham/coding-interview-university.git\ngit remote set-url --push upstream DISABLE # so that you don't push your personal progress back to the original repo\"\u003e\u003cpre\u003egit clone https://github.com/\u003cspan class=\"pl-k\"\u003e\u0026lt;\u003c/span\u003eYOUR_GITHUB_USERNAME\u003cspan class=\"pl-k\"\u003e\u0026gt;\u003c/span\u003e/coding-interview-university.git\n\u003cspan class=\"pl-c1\"\u003ecd\u003c/span\u003e coding-interview-university\ngit remote add upstream https://github.com/jwasham/coding-interview-university.git\ngit remote set-url --push upstream DISABLE \u003cspan class=\"pl-c\"\u003e\u003cspan class=\"pl-c\"\u003e#\u003c/span\u003e so that you don't push your personal progress back to the original repo\u003c/span\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eMark all boxes with X after you completed your changes:\u003c/p\u003e\n\u003cdiv class=\"highlight highlight-source-shell notranslate position-relative overflow-auto\" dir=\"auto\" data-snippet-clipboard-copy-content=\"git commit -am \u0026quot;Marked personal progress\u0026quot;\ngit pull upstream main # keep your fork up-to-date with changes from the original repo\n\ngit push # just pushes to your fork\"\u003e\u003cpre\u003egit commit -am \u003cspan class=\"pl-s\"\u003e\u003cspan class=\"pl-pds\"\u003e\"\u003c/span\u003eMarked personal progress\u003cspan class=\"pl-pds\"\u003e\"\u003c/span\u003e\u003c/span\u003e\ngit pull upstream main \u003cspan class=\"pl-c\"\u003e\u003cspan class=\"pl-c\"\u003e#\u003c/span\u003e keep your fork up-to-date with changes from the original repo\u003c/span\u003e\n\ngit push \u003cspan class=\"pl-c\"\u003e\u003cspan class=\"pl-c\"\u003e#\u003c/span\u003e just pushes to your fork\u003c/span\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003c/li\u003e\n\u003c/ol\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDon't feel you aren't smart enough\u003c/h2\u003e\u003ca id=\"user-content-dont-feel-you-arent-smart-enough\" class=\"anchor\" aria-label=\"Permalink: Don't feel you aren't smart enough\" href=\"#dont-feel-you-arent-smart-enough\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eSuccessful software engineers are smart, but many have an insecurity that they aren't smart enough.\u003c/li\u003e\n\u003cli\u003eThe following videos may help you overcome this insecurity:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=0SARbwvhupQ\" rel=\"nofollow\"\u003eThe myth of the Genius Programmer\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=1i8ylq4j_EY\" rel=\"nofollow\"\u003eIt's Dangerous to Go Alone: Battling the Invisible Monsters in Tech\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eA Note About Video Resources\u003c/h2\u003e\u003ca id=\"user-content-a-note-about-video-resources\" class=\"anchor\" aria-label=\"Permalink: A Note About Video Resources\" href=\"#a-note-about-video-resources\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eSome videos are available only by enrolling in a Coursera or EdX class. These are called MOOCs.\nSometimes the classes are not in session so you have to wait a couple of months, so you have no access.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eIt would be great to replace the online course resources with free and always-available public sources,\nsuch as YouTube videos (preferably university lectures), so that you people can study these anytime,\nnot just when a specific online course is in session.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eChoose a Programming Language\u003c/h2\u003e\u003ca id=\"user-content-choose-a-programming-language\" class=\"anchor\" aria-label=\"Permalink: Choose a Programming Language\" href=\"#choose-a-programming-language\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eYou'll need to choose a programming language for the coding interviews you do,\nbut you'll also need to find a language that you can use to study computer science concepts.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003ePreferably the language would be the same, so that you only need to be proficient in one.\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eFor this Study Plan\u003c/h3\u003e\u003ca id=\"user-content-for-this-study-plan\" class=\"anchor\" aria-label=\"Permalink: For this Study Plan\" href=\"#for-this-study-plan\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eWhen I did the study plan, I used 2 languages for most of it: C and Python\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eC: Very low level. Allows you to deal with pointers and memory allocation/deallocation, so you feel the data structures\nand algorithms in your bones. In higher-level languages like Python or Java, these are hidden from you. In day-to-day work, that's terrific,\nbut when you're learning how these low-level data structures are built, it's great to feel close to the metal.\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eC is everywhere. You'll see examples in books, lectures, videos, \u003cem\u003eeverywhere\u003c/em\u003e while you're studying.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Programming-Language-Brian-W-Kernighan/dp/0131103628\" rel=\"nofollow\"\u003eThe C Programming Language, 2nd Edition\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThis is a short book, but it will give you a great handle on the C language and if you practice it a little\nyou'll quickly get proficient. Understanding C helps you understand how programs and memory work.\u003c/li\u003e\n\u003cli\u003eYou don't need to go super deep in the book (or even finish it). Just get to where you're comfortable reading and writing in C.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003ePython: Modern and very expressive, I learned it because it's just super useful and also allows me to write less code in an interview.\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eThis is my preference. You do what you like, of course.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eYou may not need it, but here are some sites for learning a new language:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://exercism.org/tracks\" rel=\"nofollow\"\u003eExercism\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.codewars.com\" rel=\"nofollow\"\u003eCodewars\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.hackerearth.com/for-developers/\" rel=\"nofollow\"\u003eHackerEarth\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.scaler.com/topics/\" rel=\"nofollow\"\u003eScaler Topics (Java, C++)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://programiz.pro/\" rel=\"nofollow\"\u003eProgramiz PRO Community Challenges)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eFor your Coding Interview\u003c/h3\u003e\u003ca id=\"user-content-for-your-coding-interview\" class=\"anchor\" aria-label=\"Permalink: For your Coding Interview\" href=\"#for-your-coding-interview\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eYou can use a language you are comfortable in to do the coding part of the interview, but for large companies, these are solid choices:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eC++\u003c/li\u003e\n\u003cli\u003eJava\u003c/li\u003e\n\u003cli\u003ePython\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eYou could also use these, but read around first. There may be caveats:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eJavaScript\u003c/li\u003e\n\u003cli\u003eRuby\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eHere is an article I wrote about choosing a language for the interview:\n\u003ca href=\"https://startupnextdoor.com/important-pick-one-language-for-the-coding-interview/\" rel=\"nofollow\"\u003ePick One Language for the Coding Interview\u003c/a\u003e.\nThis is the original article my post was based on: \u003ca href=\"https://web.archive.org/web/20210516054124/http://blog.codingforinterviews.com/best-programming-language-jobs/\" rel=\"nofollow\"\u003eChoosing a Programming Language for Interviews\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eYou need to be very comfortable in the language and be knowledgeable.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eRead more about choices:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/\" rel=\"nofollow\"\u003eChoose the Right Language for Your Coding Interview\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/programming-language-resources.md\"\u003eSee language-specific resources here\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBooks for Data Structures and Algorithms\u003c/h2\u003e\u003ca id=\"user-content-books-for-data-structures-and-algorithms\" class=\"anchor\" aria-label=\"Permalink: Books for Data Structures and Algorithms\" href=\"#books-for-data-structures-and-algorithms\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eThis book will form your foundation for computer science.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eJust choose one, in a language that you will be comfortable with. You'll be doing a lot of reading and coding.\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003ePython\u003c/h3\u003e\u003ca id=\"user-content-python\" class=\"anchor\" aria-label=\"Permalink: Python\" href=\"#python\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://geni.us/q7svoz\" rel=\"nofollow\"\u003eCoding Interview Patterns: Nail Your Next Coding Interview\u003c/a\u003e (\u003cstrong\u003eMain Recommendation\u003c/strong\u003e)\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAn insider’s perspective on what interviewers are truly looking for and why.\u003c/li\u003e\n\u003cli\u003e101 real coding interview problems with detailed solutions.\u003c/li\u003e\n\u003cli\u003eIntuitive explanations that guide you through each problem as if you were solving it in a live interview.\u003c/li\u003e\n\u003cli\u003e1000+ diagrams to illustrate key concepts and patterns.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eC\u003c/h3\u003e\u003ca id=\"user-content-c\" class=\"anchor\" aria-label=\"Permalink: C\" href=\"#c\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Algorithms-Parts-1-5-Bundle-Fundamentals/dp/0201756080\" rel=\"nofollow\"\u003eAlgorithms in C, Parts 1-5 (Bundle), 3rd Edition\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eFundamentals, Data Structures, Sorting, Searching, and Graph Algorithms\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eJava\u003c/h3\u003e\u003ca id=\"user-content-java\" class=\"anchor\" aria-label=\"Permalink: Java\" href=\"#java\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eYour choice:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGoodrich, Tamassia, Goldwasser\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/\" rel=\"nofollow\"\u003eData Structures and Algorithms in Java\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eSedgewick and Wayne:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/\" rel=\"nofollow\"\u003eAlgorithms\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eFree Coursera course that covers the book (taught by the authors!):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/algorithms-part1\" rel=\"nofollow\"\u003eAlgorithms I\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/algorithms-part2\" rel=\"nofollow\"\u003eAlgorithms II\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eC++\u003c/h3\u003e\u003ca id=\"user-content-c-1\" class=\"anchor\" aria-label=\"Permalink: C++\" href=\"#c-1\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eYour choice:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGoodrich, Tamassia, and Mount\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/0470383275\" rel=\"nofollow\"\u003eData Structures and Algorithms in C++, 2nd Edition\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eSedgewick and Wayne\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/\" rel=\"nofollow\"\u003eAlgorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/\" rel=\"nofollow\"\u003eAlgorithms in C++ Part 5: Graph Algorithms\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eInterview Prep Books\u003c/h2\u003e\u003ca id=\"user-content-interview-prep-books\" class=\"anchor\" aria-label=\"Permalink: Interview Prep Books\" href=\"#interview-prep-books\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eHere are some recommended books to supplement your learning.\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://geni.us/q7svoz\" rel=\"nofollow\"\u003eCoding Interview Patterns: Nail Your Next Coding Interview\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.amazon.com/Programming-Interviews-Exposed-Through-Interview/dp/111941847X/\" rel=\"nofollow\"\u003eProgramming Interviews Exposed: Coding Your Way Through the Interview, 4th Edition\u003c/a\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAnswers in C++ and Java\u003c/li\u003e\n\u003cli\u003eThis is a good warm-up for Cracking the Coding Interview\u003c/li\u003e\n\u003cli\u003eNot too difficult. Most problems may be easier than what you'll see in an interview (from what I've read)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/\" rel=\"nofollow\"\u003eCracking the Coding Interview, 6th Edition\u003c/a\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eanswers in Java\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eIf you have tons of extra time:\u003c/h3\u003e\u003ca id=\"user-content-if-you-have-tons-of-extra-time\" class=\"anchor\" aria-label=\"Permalink: If you have tons of extra time:\" href=\"#if-you-have-tons-of-extra-time\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eChoose one:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836\" rel=\"nofollow\"\u003eElements of Programming Interviews (C++ version)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Elements-Programming-Interviews-Python-Insiders/dp/1537713949/\" rel=\"nofollow\"\u003eElements of Programming Interviews in Python\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Elements-Programming-Interviews-Java-Insiders/dp/1517435803/\" rel=\"nofollow\"\u003eElements of Programming Interviews (Java version)\u003c/a\u003e\n- \u003ca href=\"https://github.com/gardncl/elements-of-programming-interviews\"\u003eCompanion Project - Method Stub and Test Cases for Every Problem in the Book\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDon't Make My Mistakes\u003c/h2\u003e\u003ca id=\"user-content-dont-make-my-mistakes\" class=\"anchor\" aria-label=\"Permalink: Don't Make My Mistakes\" href=\"#dont-make-my-mistakes\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eThis list grew over many months, and yes, it got out of hand.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eHere are some mistakes I made so you'll have a better experience. And you'll save months of time.\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003e1. You Won't Remember it All\u003c/h3\u003e\u003ca id=\"user-content-1-you-wont-remember-it-all\" class=\"anchor\" aria-label=\"Permalink: 1. You Won't Remember it All\" href=\"#1-you-wont-remember-it-all\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eI watched hours of videos and took copious notes, and months later there was much I didn't remember. I spent 3 days going\nthrough my notes and making flashcards, so I could review. I didn't need all of that knowledge.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003ePlease, read so you won't make my mistakes:\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://startupnextdoor.com/retaining-computer-science-knowledge/\" rel=\"nofollow\"\u003eRetaining Computer Science Knowledge\u003c/a\u003e.\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003e2. Use Flashcards\u003c/h3\u003e\u003ca id=\"user-content-2-use-flashcards\" class=\"anchor\" aria-label=\"Permalink: 2. Use Flashcards\" href=\"#2-use-flashcards\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eTo solve the problem, I made a little flashcard site where I could add flashcards of 2 types: general and code.\nEach card has a different formatting. I made a mobile-first website, so I could review on my phone or tablet, wherever I am.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eMake your own for free:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/computer-science-flash-cards\"\u003eFlashcards site repo\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eI DON'T RECOMMEND using my flashcards.\u003c/strong\u003e There are too many and most of them are trivia that you don't need.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eBut if you don't want to listen to me, here you go:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db\"\u003eMy flash cards database (1200 cards)\u003c/a\u003e:\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db\"\u003eMy flash cards database (extreme - 1800 cards)\u003c/a\u003e:\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eKeep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics.\nIt's way too much for what's required.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eNote on flashcards:\u003c/strong\u003e The first time you recognize you know the answer, don't mark it as known. You have to see the\nsame card and answer it several times correctly before you really know it. Repetition will put that knowledge deeper in\nyour brain.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eAn alternative to using my flashcard site is \u003ca href=\"http://ankisrs.net/\" rel=\"nofollow\"\u003eAnki\u003c/a\u003e, which has been recommended to me numerous times.\nIt uses a repetition system to help you remember. It's user-friendly, available on all platforms, and has a cloud sync system.\nIt costs $25 on iOS but is free on other platforms.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eMy flashcard database in Anki format: \u003ca href=\"https://ankiweb.net/shared/info/25173560\" rel=\"nofollow\"\u003ehttps://ankiweb.net/shared/info/25173560\u003c/a\u003e (thanks \u003ca href=\"https://github.com/xiewenya\"\u003e@xiewenya\u003c/a\u003e).\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eSome students have mentioned formatting issues with white space that can be fixed by doing the following: open the deck, edit the card, click cards, select the \"styling\" radio button, and add the member \"white-space: pre;\" to the card class.\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003e3. Do Coding Interview Questions While You're Learning\u003c/h3\u003e\u003ca id=\"user-content-3-do-coding-interview-questions-while-youre-learning\" class=\"anchor\" aria-label=\"Permalink: 3. Do Coding Interview Questions While You're Learning\" href=\"#3-do-coding-interview-questions-while-youre-learning\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eTHIS IS VERY IMPORTANT.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eStart doing coding interview questions while you're learning data structures and algorithms.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eYou need to apply what you're learning to solve problems, or you'll forget. I made this mistake.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eOnce you've learned a topic, and feel somewhat comfortable with it, for example, \u003cstrong\u003elinked lists\u003c/strong\u003e:\u003c/p\u003e\n\u003col dir=\"auto\"\u003e\n\u003cli\u003eOpen one of the \u003ca href=\"#interview-prep-books\"\u003ecoding interview books\u003c/a\u003e (or coding problem websites, listed below)\u003c/li\u003e\n\u003cli\u003eDo 2 or 3 questions regarding linked lists.\u003c/li\u003e\n\u003cli\u003eMove on to the next learning topic.\u003c/li\u003e\n\u003cli\u003eLater, go back and do another 2 or 3 linked list problems.\u003c/li\u003e\n\u003cli\u003eDo this with each new topic you learn.\u003c/li\u003e\n\u003c/ol\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eKeep doing problems while you're learning all this stuff, not after.\u003c/strong\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eYou're not being hired for knowledge, but how you apply the knowledge.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eThere are many resources for this, listed below. Keep going.\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003e4. Focus\u003c/h3\u003e\u003ca id=\"user-content-4-focus\" class=\"anchor\" aria-label=\"Permalink: 4. Focus\" href=\"#4-focus\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eThere are a lot of distractions that can take up valuable time. Focus and concentration are hard. Turn on some music\nwithout lyrics and you'll be able to focus pretty well.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eWhat you won't see covered\u003c/h2\u003e\u003ca id=\"user-content-what-you-wont-see-covered\" class=\"anchor\" aria-label=\"Permalink: What you won't see covered\" href=\"#what-you-wont-see-covered\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eThese are prevalent technologies but not part of this study plan:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eJavascript\u003c/li\u003e\n\u003cli\u003eHTML, CSS, and other front-end technologies\u003c/li\u003e\n\u003cli\u003eSQL\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eThe Daily Plan\u003c/h2\u003e\u003ca id=\"user-content-the-daily-plan\" class=\"anchor\" aria-label=\"Permalink: The Daily Plan\" href=\"#the-daily-plan\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eThis course goes over a lot of subjects. Each will probably take you a few days, or maybe even a week or more. It depends on your schedule.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eEach day, take the next subject in the list, watch some videos about that subject, and then write an implementation\nof that data structure or algorithm in the language you chose for this course.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eYou can see my code here:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/practice-c\"\u003eC\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/practice-cpp\"\u003eC++\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/practice-python\"\u003ePython\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eYou don't need to memorize every algorithm. You just need to be able to understand it enough to be able to write your own implementation.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCoding Question Practice\u003c/h2\u003e\u003ca id=\"user-content-coding-question-practice\" class=\"anchor\" aria-label=\"Permalink: Coding Question Practice\" href=\"#coding-question-practice\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cdiv class=\"snippet-clipboard-content notranslate position-relative overflow-auto\" data-snippet-clipboard-copy-content=\"Why is this here? I'm not ready to interview.\"\u003e\u003cpre class=\"notranslate\"\u003e\u003ccode\u003eWhy is this here? I'm not ready to interview.\n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"#3-do-coding-interview-questions-while-youre-learning\"\u003eThen go back and read this.\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eWhy you need to practice doing programming problems:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eProblem recognition, and where the right data structures and algorithms fit in\u003c/li\u003e\n\u003cli\u003eGathering requirements for the problem\u003c/li\u003e\n\u003cli\u003eTalking your way through the problem like you will in the interview\u003c/li\u003e\n\u003cli\u003eCoding on a whiteboard or paper, not a computer\u003c/li\u003e\n\u003cli\u003eComing up with time and space complexity for your solutions (see Big-O below)\u003c/li\u003e\n\u003cli\u003eTesting your solutions\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eThere is a great intro for methodical, communicative problem-solving in an interview. You'll get this from the programming\ninterview books, too, but I found this outstanding:\n\u003ca href=\"http://www.hiredintech.com/algorithm-design/\" rel=\"nofollow\"\u003eAlgorithm design canvas\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eWrite code on a whiteboard or paper, not a computer. Test with some sample inputs. Then type it and test it out on a computer.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eIf you don't have a whiteboard at home, pick up a large drawing pad from an art store. You can sit on the couch and practice.\nThis is my \"sofa whiteboard\". I added the pen in the photo just for scale. If you use a pen, you'll wish you could erase.\nGets messy quickly. \u003cstrong\u003eI use a pencil and eraser.\u003c/strong\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003ca target=\"_blank\" rel=\"noopener noreferrer nofollow\" href=\"https://camo.githubusercontent.com/ad823324fe7b11bda32f23b8a543ad696b8559a6d89f17af4a2196a9efd0c984/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f6172745f626f6172645f736d5f322e6a7067\"\u003e\u003cimg src=\"https://camo.githubusercontent.com/ad823324fe7b11bda32f23b8a543ad696b8559a6d89f17af4a2196a9efd0c984/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f6172745f626f6172645f736d5f322e6a7067\" alt=\"my sofa whiteboard\" data-canonical-src=\"https://d3j2pkmjtin6ou.cloudfront.net/art_board_sm_2.jpg\" style=\"max-width: 100%;\"\u003e\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eCoding question practice is not about memorizing answers to programming problems.\u003c/strong\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCoding Problems\u003c/h2\u003e\u003ca id=\"user-content-coding-problems\" class=\"anchor\" aria-label=\"Permalink: Coding Problems\" href=\"#coding-problems\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eDon't forget your key coding interview books \u003ca href=\"#interview-prep-books\"\u003ehere\u003c/a\u003e.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eSolving Problems:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.topcoder.com/thrive/articles/How%20To%20Find%20a%20Solution\" rel=\"nofollow\"\u003eHow to Find a Solution\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.topcoder.com/thrive/articles/How%20To%20Dissect%20a%20Topcoder%20Problem%20Statement%20Content\" rel=\"nofollow\"\u003eHow to Dissect a Topcoder Problem Statement\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eCoding Interview Question Videos:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLamzFoFxwoNjPfxzaWqs7cZGsPYy0x_gI\" rel=\"nofollow\"\u003eIDeserve (88 videos)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/user/tusharroy2525/playlists?shelf_id=2\u0026amp;view=50\u0026amp;sort=dd\" rel=\"nofollow\"\u003eTushar Roy (5 playlists)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eSuper for walkthroughs of problem solutions\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLU_sdQYzUj2keVENTP0a5rdykRSgg9Wp-\" rel=\"nofollow\"\u003eNick White - LeetCode Solutions (187 Videos)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGood explanations of the solution and the code\u003c/li\u003e\n\u003cli\u003eYou can watch several in a short time\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://youtube.com/FisherCoder\" rel=\"nofollow\"\u003eFisherCoder - LeetCode Solutions\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eChallenge/Practice sites:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://leetcode.com/\" rel=\"nofollow\"\u003eLeetCode\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eMy favorite coding problem site. It's worth the subscription money for the 1-2 months you'll likely be preparing.\u003c/li\u003e\n\u003cli\u003eSee Nick White and FisherCoder Videos above for code walk-throughs.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.hackerrank.com/\" rel=\"nofollow\"\u003eHackerRank\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.topcoder.com/\" rel=\"nofollow\"\u003eTopCoder\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://codeforces.com/\" rel=\"nofollow\"\u003eCodeforces\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://codility.com/programmers/\" rel=\"nofollow\"\u003eCodility\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://practice.geeksforgeeks.org/explore/?page=1\" rel=\"nofollow\"\u003eGeeks for Geeks\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.algoexpert.io/product\" rel=\"nofollow\"\u003eAlgoExpert\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eCreated by Google engineers, this is also an excellent resource to hone your skills.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://projecteuler.net/\" rel=\"nofollow\"\u003eProject Euler\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003every math-focused, and not really suited for coding interviews\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eLet's Get Started\u003c/h2\u003e\u003ca id=\"user-content-lets-get-started\" class=\"anchor\" aria-label=\"Permalink: Let's Get Started\" href=\"#lets-get-started\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eAlright, enough talk, let's learn!\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eBut don't forget to do coding problems from above while you learn!\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eAlgorithmic complexity / Big-O / Asymptotic analysis\u003c/h2\u003e\u003ca id=\"user-content-algorithmic-complexity--big-o--asymptotic-analysis\" class=\"anchor\" aria-label=\"Permalink: Algorithmic complexity / Big-O / Asymptotic analysis\" href=\"#algorithmic-complexity--big-o--asymptotic-analysis\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eNothing to implement here, you're just watching videos and taking notes! Yay!\u003c/li\u003e\n\u003cli\u003eThere are a lot of videos here. Just watch enough until you understand it. You can always come back and review.\u003c/li\u003e\n\u003cli\u003eDon't worry if you don't understand all the math behind it.\u003c/li\u003e\n\u003cli\u003eYou just need to understand how to express the complexity of an algorithm in terms of Big-O.\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=iOq5kSKqeR4\" rel=\"nofollow\"\u003eHarvard CS50 - Asymptotic Notation (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=V6mKVRU1evU\" rel=\"nofollow\"\u003eBig O Notations (general quick tutorial) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ei-A_wy5Yxw\u0026amp;index=2\u0026amp;list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN\" rel=\"nofollow\"\u003eBig O Notation (and Omega and Theta) - best mathematical explanation (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=z1mkCe3kVUA\" rel=\"nofollow\"\u003eSkiena (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98\" rel=\"nofollow\"\u003eUC Berkeley Big O (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=B3SpQZaAZP4\u0026amp;index=10\u0026amp;list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN\" rel=\"nofollow\"\u003eAmortized Analysis (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e TopCoder (includes recurrence relations and master theorem):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one\" rel=\"nofollow\"\u003eComputational Complexity: Section 1\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two\" rel=\"nofollow\"\u003eComputational Complexity: Section 2\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://bigocheatsheet.com/\" rel=\"nofollow\"\u003eCheat sheet\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv\" rel=\"nofollow\"\u003e[Review] Analyzing Algorithms (playlist) in 18 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eWell, that's about enough of that.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eWhen you go through \"Cracking the Coding Interview\", there is a chapter on this, and at the end there is a quiz to see\nif you can identify the runtime complexity of different algorithms. It's a super review and test.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eData Structures\u003c/h2\u003e\u003ca id=\"user-content-data-structures\" class=\"anchor\" aria-label=\"Permalink: Data Structures\" href=\"#data-structures\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eArrays\u003c/h3\u003e\u003ca id=\"user-content-arrays\" class=\"anchor\" aria-label=\"Permalink: Arrays\" href=\"#arrays\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e About Arrays:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=tI_tIZFyKBw\u0026amp;t=3009s\" rel=\"nofollow\"\u003eArrays CS50 Harvard University\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures/arrays-OsBSF\" rel=\"nofollow\"\u003eArrays (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE\" rel=\"nofollow\"\u003eUC Berkeley CS61B - Linear and Multi-Dim Arrays (video)\u003c/a\u003e (Start watching from 15m 32s)\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures/dynamic-arrays-EwbnV\" rel=\"nofollow\"\u003eDynamic Arrays (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=1jtrQqYpt7g\" rel=\"nofollow\"\u003eJagged Arrays (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement a vector (mutable array with automatic resizing):\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Practice coding using arrays and pointers, and pointer math to jump to an index instead of using indexing.\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e New raw data array with allocated memory\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ecan allocate int array under the hood, just not use its features\u003c/li\u003e\n\u003cli\u003estart with 16, or if the starting number is greater, use power of 2 - 16, 32, 64, 128\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e size() - number of items\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e capacity() - number of items it can hold\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e is_empty()\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e at(index) - returns the item at a given index, blows up if index out of bounds\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e push(item)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e insert(index, item) - inserts item at index, shifts that index's value and trailing elements to the right\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e prepend(item) - can use insert above at index 0\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e pop() - remove from end, return value\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e delete(index) - delete item at index, shifting all trailing elements left\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e remove(item) - looks for value and removes index holding it (even if in multiple places)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e find(item) - looks for value and returns first index with that value, -1 if not found\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e resize(new_capacity) // private function\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ewhen you reach capacity, resize to double the size\u003c/li\u003e\n\u003cli\u003ewhen popping an item, if the size is 1/4 of capacity, resize to half\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Time\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eO(1) to add/remove at end (amortized for allocations for more space), index, or update\u003c/li\u003e\n\u003cli\u003eO(n) to insert/remove elsewhere\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Space\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003econtiguous in memory, so proximity helps performance\u003c/li\u003e\n\u003cli\u003espace needed = (array capacity, which is \u0026gt;= n) * size of item, but even if 2n, still O(n)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eLinked Lists\u003c/h3\u003e\u003ca id=\"user-content-linked-lists\" class=\"anchor\" aria-label=\"Permalink: Linked Lists\" href=\"#linked-lists\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Description:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=2T-A_GFuoTo\u0026amp;t=650s\" rel=\"nofollow\"\u003eLinked Lists CS50 Harvard University\u003c/a\u003e - this builds the intuition.\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK\" rel=\"nofollow\"\u003eSingly Linked Lists (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0\" rel=\"nofollow\"\u003eCS 61B - Linked Lists 1 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w\" rel=\"nofollow\"\u003eCS 61B - Linked Lists 2 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/F8AbOfQwl1c\" rel=\"nofollow\"\u003e[Review] Linked lists in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=QN6FPiD0Gzo\" rel=\"nofollow\"\u003eC Code (video)\u003c/a\u003e\n- not the whole video, just portions about Node struct and memory allocation\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Linked List vs Arrays:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures-optimizing-performance/core-linked-lists-vs-arrays-rjBs9\" rel=\"nofollow\"\u003eCore Linked Lists Vs Arrays (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures-optimizing-performance/in-the-real-world-lists-vs-arrays-QUaUd\" rel=\"nofollow\"\u003eIn The Real World Linked Lists Vs Arrays (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=YQs6IC-vgmo\" rel=\"nofollow\"\u003eWhy you should avoid linked lists (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Gotcha: you need pointer to pointer knowledge:\n(for when you pass a pointer to a function that may change the address where that pointer points)\nThis page is just to get a grasp on ptr to ptr. I don't recommend this list traversal style. Readability and maintainability suffer due to cleverness.\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.eskimo.com/~scs/cclass/int/sx8.html\" rel=\"nofollow\"\u003ePointers to Pointers\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement (I did with tail pointer \u0026amp; without):\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e size() - returns the number of data elements in the list\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e empty() - bool returns true if empty\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e value_at(index) - returns the value of the nth item (starting at 0 for first)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e push_front(value) - adds an item to the front of the list\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e pop_front() - remove the front item and return its value\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e push_back(value) - adds an item at the end\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e pop_back() - removes end item and returns its value\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e front() - get the value of the front item\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e back() - get the value of the end item\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e insert(index, value) - insert value at index, so the current item at that index is pointed to by the new item at the index\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e erase(index) - removes node at given index\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e value_n_from_end(n) - returns the value of the node at the nth position from the end of the list\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e reverse() - reverses the list\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e remove_value(value) - removes the first item in the list with this value\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Doubly-linked List\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures/doubly-linked-lists-jpGKD\" rel=\"nofollow\"\u003eDescription (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eNo need to implement\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eStack\u003c/h3\u003e\u003ca id=\"user-content-stack\" class=\"anchor\" aria-label=\"Permalink: Stack\" href=\"#stack\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/stacks-UdKzQ\" rel=\"nofollow\"\u003eStacks (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/KcT3aVgrrpU\" rel=\"nofollow\"\u003e[Review] Stacks in 3 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Will not implement. Implementing with the array is trivial\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eQueue\u003c/h3\u003e\u003ca id=\"user-content-queue\" class=\"anchor\" aria-label=\"Permalink: Queue\" href=\"#queue\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/queues-EShpq\" rel=\"nofollow\"\u003eQueue (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://en.wikipedia.org/wiki/Circular_buffer\" rel=\"nofollow\"\u003eCircular buffer/FIFO\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/D6gu-_tmEpQ\" rel=\"nofollow\"\u003e[Review] Queues in 3 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement using linked-list, with tail pointer:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eenqueue(value) - adds value at a position at the tail\u003c/li\u003e\n\u003cli\u003edequeue() - returns value and removes least recently added element (front)\u003c/li\u003e\n\u003cli\u003eempty()\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement using a fixed-sized array:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eenqueue(value) - adds item at end of available storage\u003c/li\u003e\n\u003cli\u003edequeue() - returns value and removes least recently added element\u003c/li\u003e\n\u003cli\u003eempty()\u003c/li\u003e\n\u003cli\u003efull()\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Cost:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ea bad implementation using a linked list where you enqueue at the head and dequeue at the tail would be O(n)\nbecause you'd need the next to last element, causing a full traversal of each dequeue\u003c/li\u003e\n\u003cli\u003eenqueue: O(1) (amortized, linked list and array [probing])\u003c/li\u003e\n\u003cli\u003edequeue: O(1) (linked list and array)\u003c/li\u003e\n\u003cli\u003eempty: O(1) (linked list and array)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eHash table\u003c/h3\u003e\u003ca id=\"user-content-hash-table\" class=\"anchor\" aria-label=\"Permalink: Hash table\" href=\"#hash-table\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Videos:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=0M_kIqhwbFo\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;index=8\" rel=\"nofollow\"\u003eHashing with Chaining (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=BRO7mVIFt08\u0026amp;index=9\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\" rel=\"nofollow\"\u003eTable Doubling, Karp-Rabin (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=rvdJDijO2Ro\u0026amp;index=10\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\" rel=\"nofollow\"\u003eOpen Addressing, Cryptographic Hashing (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=C4Kc8xzcA68\" rel=\"nofollow\"\u003ePyCon 2010: The Mighty Dictionary (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=66P5FMkWoVU\" rel=\"nofollow\"\u003ePyCon 2017: The Dictionary Even Mightier (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=z0lJ2k0sl1g\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=11\" rel=\"nofollow\"\u003e(Advanced) Randomization: Universal \u0026amp; Perfect Hashing (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=N0COwN14gt0\u0026amp;list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9\u0026amp;index=4\" rel=\"nofollow\"\u003e(Advanced) Perfect hashing (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/knV86FlSXJ8\" rel=\"nofollow\"\u003e[Review] Hash tables in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Online Courses:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP\" rel=\"nofollow\"\u003eCore Hash Tables (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/home/week/4\" rel=\"nofollow\"\u003eData Structures (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP\" rel=\"nofollow\"\u003ePhone Book Problem (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e distributed hash tables:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures/instant-uploads-and-storage-optimization-in-dropbox-DvaIb\" rel=\"nofollow\"\u003eInstant Uploads And Storage Optimization In Dropbox (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H\" rel=\"nofollow\"\u003eDistributed Hash Tables (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement with array using linear probing\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ehash(k, m) - m is the size of the hash table\u003c/li\u003e\n\u003cli\u003eadd(key, value) - if the key already exists, update value\u003c/li\u003e\n\u003cli\u003eexists(key)\u003c/li\u003e\n\u003cli\u003eget(key)\u003c/li\u003e\n\u003cli\u003eremove(key)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eMore Knowledge\u003c/h2\u003e\u003ca id=\"user-content-more-knowledge\" class=\"anchor\" aria-label=\"Permalink: More Knowledge\" href=\"#more-knowledge\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBinary search\u003c/h3\u003e\u003ca id=\"user-content-binary-search\" class=\"anchor\" aria-label=\"Permalink: Binary search\" href=\"#binary-search\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=D5SrAga1pno\" rel=\"nofollow\"\u003eBinary Search (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search\" rel=\"nofollow\"\u003eBinary Search (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.topcoder.com/thrive/articles/Binary%20Search\" rel=\"nofollow\"\u003edetail\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems\" rel=\"nofollow\"\u003eblueprint\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/fDKIpRe8GW4\" rel=\"nofollow\"\u003e[Review] Binary search in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ebinary search (on a sorted array of integers)\u003c/li\u003e\n\u003cli\u003ebinary search using recursion\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBitwise operations\u003c/h3\u003e\u003ca id=\"user-content-bitwise-operations\" class=\"anchor\" aria-label=\"Permalink: Bitwise operations\" href=\"#bitwise-operations\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf\"\u003eBits cheat sheet\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eyou should know many of the powers of 2 from (2^1 to 2^16 and 2^32)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Get a really good understanding of manipulating bits with: \u0026amp;, |, ^, ~, \u0026gt;\u0026gt;, \u0026lt;\u0026lt;\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://en.wikipedia.org/wiki/Word_(computer_architecture)\" rel=\"nofollow\"\u003ewords\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Good intro:\n\u003ca href=\"https://www.youtube.com/watch?v=7jkIUgLC29I\" rel=\"nofollow\"\u003eBit Manipulation (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=d0AwjSpNXR0\" rel=\"nofollow\"\u003eC Programming Tutorial 2-10: Bitwise Operators (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://en.wikipedia.org/wiki/Bit_manipulation\" rel=\"nofollow\"\u003eBit Manipulation\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://en.wikipedia.org/wiki/Bitwise_operation\" rel=\"nofollow\"\u003eBitwise Operation\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://graphics.stanford.edu/~seander/bithacks.html\" rel=\"nofollow\"\u003eBithacks\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://bits.stephan-brumme.com/\" rel=\"nofollow\"\u003eThe Bit Twiddler\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://bits.stephan-brumme.com/interactive.html\" rel=\"nofollow\"\u003eThe Bit Twiddler Interactive\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ZusiKXcz_ac\" rel=\"nofollow\"\u003eBit Hacks (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://pconrad.github.io/old_pconrad_cs16/topics/bitOps/\" rel=\"nofollow\"\u003ePractice Operations\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e 2s and 1s complement\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=lKTsv6iVxV4\" rel=\"nofollow\"\u003eBinary: Plusses \u0026amp; Minuses (Why We Use Two's Complement) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Ones%27_complement\" rel=\"nofollow\"\u003e1s Complement\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Two%27s_complement\" rel=\"nofollow\"\u003e2s Complement\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Count set bits\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://youtu.be/Hzuzo9NJrlc\" rel=\"nofollow\"\u003e4 ways to count bits in a byte (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan\" rel=\"nofollow\"\u003eCount Bits\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\" rel=\"nofollow\"\u003eHow To Count The Number Of Set Bits In a 32 Bit Integer\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Swap values:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://bits.stephan-brumme.com/swap.html\" rel=\"nofollow\"\u003eSwap\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Absolute value:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://bits.stephan-brumme.com/absInteger.html\" rel=\"nofollow\"\u003eAbsolute Integer\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTrees\u003c/h2\u003e\u003ca id=\"user-content-trees\" class=\"anchor\" aria-label=\"Permalink: Trees\" href=\"#trees\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTrees - Intro\u003c/h3\u003e\u003ca id=\"user-content-trees---intro\" class=\"anchor\" aria-label=\"Permalink: Trees - Intro\" href=\"#trees---intro\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/trees-95qda\" rel=\"nofollow\"\u003eIntro to Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/tree-traversal-fr51b\" rel=\"nofollow\"\u003eTree Traversal (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=uWL6FJhq5fM\" rel=\"nofollow\"\u003eBFS(breadth-first search) and DFS(depth-first search) (video)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eBFS notes:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003elevel order (BFS, using queue)\u003c/li\u003e\n\u003cli\u003etime complexity: O(n)\u003c/li\u003e\n\u003cli\u003espace complexity: best: O(1), worst: O(n/2)=O(n)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eDFS notes:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003etime complexity: O(n)\u003c/li\u003e\n\u003cli\u003espace complexity:\nbest: O(log n) - avg. height of tree\nworst: O(n)\u003c/li\u003e\n\u003cli\u003einorder (DFS: left, self, right)\u003c/li\u003e\n\u003cli\u003epostorder (DFS: left, right, self)\u003c/li\u003e\n\u003cli\u003epreorder (DFS: self, left, right)\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/HZ5YTanv5QE\" rel=\"nofollow\"\u003e[Review] Breadth-first search in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/Urx87-NMm6c\" rel=\"nofollow\"\u003e[Review] Depth-first search in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b\" rel=\"nofollow\"\u003e[Review] Tree Traversal (playlist) in 11 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBinary search trees: BSTs\u003c/h3\u003e\u003ca id=\"user-content-binary-search-trees-bsts\" class=\"anchor\" aria-label=\"Permalink: Binary search trees: BSTs\" href=\"#binary-search-trees-bsts\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=x6At0nzX92o\u0026amp;index=1\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\" rel=\"nofollow\"\u003eBinary Search Tree Review (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction\" rel=\"nofollow\"\u003eIntroduction (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=76dhtgZt38A\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003eMIT (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eC/C++:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=COZK7NATh4k\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\u0026amp;index=28\" rel=\"nofollow\"\u003eBinary search tree - Implementation in C/C++ (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=hWokyBoo0aI\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\u0026amp;index=29\" rel=\"nofollow\"\u003eBST implementation - memory allocation in stack and heap (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Ut90klNN264\u0026amp;index=30\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\" rel=\"nofollow\"\u003eFind min and max element in a binary search tree (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=_pnqMz5nrRs\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\u0026amp;index=31\" rel=\"nofollow\"\u003eFind the height of a binary tree (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=9RHO6jU--GU\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\u0026amp;index=32\" rel=\"nofollow\"\u003eBinary tree traversal - breadth-first and depth-first strategies (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=86g8jAQug04\u0026amp;index=33\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\" rel=\"nofollow\"\u003eBinary tree: Level Order Traversal (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=gm8DUJJhmY4\u0026amp;index=34\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\" rel=\"nofollow\"\u003eBinary tree traversal: Preorder, Inorder, Postorder (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=yEwSGhSsT0U\u0026amp;index=35\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\" rel=\"nofollow\"\u003eCheck if a binary tree is a binary search tree or not (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=gcULXE7ViZw\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\u0026amp;index=36\" rel=\"nofollow\"\u003eDelete a node from Binary Search Tree (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=5cPbNCrdotA\u0026amp;index=37\u0026amp;list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P\" rel=\"nofollow\"\u003eInorder Successor in a binary search tree (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://leetcode.com/problems/insert-into-a-binary-search-tree/submissions/987660183/\" rel=\"nofollow\"\u003einsert // insert value into tree\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e get_node_count // get count of values stored\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e print_values // prints the values in the tree, from min to max\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e delete_tree\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e is_in_tree // returns true if a given value exists in the tree\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.geeksforgeeks.org/find-the-maximum-depth-or-height-of-a-tree/\" rel=\"nofollow\"\u003eget_height // returns the height in nodes (single node's height is 1)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e get_min // returns the minimum value stored in the tree\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e get_max // returns the maximum value stored in the tree\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://leetcode.com/problems/validate-binary-search-tree/\" rel=\"nofollow\"\u003eis_binary_search_tree\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e delete_value\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e get_successor // returns the next-highest value in the tree after given value, -1 if none\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eHeap / Priority Queue / Binary Heap\u003c/h3\u003e\u003ca id=\"user-content-heap--priority-queue--binary-heap\" class=\"anchor\" aria-label=\"Permalink: Heap / Priority Queue / Binary Heap\" href=\"#heap--priority-queue--binary-heap\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003evisualized as a tree, but is usually linear in storage (array, linked list)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://en.wikipedia.org/wiki/Heap_(data_structure)\" rel=\"nofollow\"\u003eHeap\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/introduction-2OpTs\" rel=\"nofollow\"\u003eIntroduction (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees\" rel=\"nofollow\"\u003eBinary Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/supplement/S5xxz/tree-height-remark\" rel=\"nofollow\"\u003eTree Height Remark (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operations\" rel=\"nofollow\"\u003eBasic Operations (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/gl5Ni/complete-binary-trees\" rel=\"nofollow\"\u003eComplete Binary Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/HxQo9/pseudocode\" rel=\"nofollow\"\u003ePseudocode (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/odNJmw5TOEE?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;t=3291\" rel=\"nofollow\"\u003eHeap Sort - jumps to start (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/heap-sort-hSzMO\" rel=\"nofollow\"\u003eHeap Sort (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/data-structures/building-a-heap-dwrOS\" rel=\"nofollow\"\u003eBuilding a heap (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Xnpo1atN-Iw\u0026amp;list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY\u0026amp;index=12\" rel=\"nofollow\"\u003eMIT 6.006 Introduction to Algorithms: Binary Heaps\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE\" rel=\"nofollow\"\u003eCS 61B Lecture 24: Priority Queues (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=MiyLo8adrWw\" rel=\"nofollow\"\u003eLinear Time BuildHeap (max-heap)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6\" rel=\"nofollow\"\u003e[Review] Heap (playlist) in 13 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement a max-heap:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e insert\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e sift_up - needed for insert\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e get_max - returns the max item, without removing it\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e get_size() - return number of elements stored\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e is_empty() - returns true if the heap contains no elements\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e extract_max - returns the max item, removing it\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e sift_down - needed for extract_max\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e remove(x) - removes item at index x\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e heapify - create a heap from an array of elements, needed for heap_sort\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e heap_sort() - take an unsorted array and turn it into a sorted array in place using a max heap or min heap\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eSorting\u003c/h2\u003e\u003ca id=\"user-content-sorting\" class=\"anchor\" aria-label=\"Permalink: Sorting\" href=\"#sorting\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Notes:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eImplement sorts \u0026amp; know best case/worst case, average complexity of each:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eno bubble sort - it's terrible - O(n^2), except when n \u0026lt;= 16\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Stability in sorting algorithms (\"Is Quicksort stable?\")\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Sorting_algorithm#Stability\" rel=\"nofollow\"\u003eSorting Algorithm Stability\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms\" rel=\"nofollow\"\u003eStability In Sorting Algorithms\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.geeksforgeeks.org/stability-in-sorting-algorithms/\" rel=\"nofollow\"\u003eStability In Sorting Algorithms\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf\" rel=\"nofollow\"\u003eSorting Algorithms - Stability\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Which algorithms can be used on linked lists? Which on arrays? Which of both?\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eI wouldn't recommend sorting a linked list, but merge sort is doable.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.geeksforgeeks.org/merge-sort-for-linked-list/\" rel=\"nofollow\"\u003eMerge Sort For Linked List\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eFor heapsort, see the Heap data structure above. Heap sort is great, but not stable\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part1/home/week/3\" rel=\"nofollow\"\u003eSedgewick - Mergesort (5 videos)\u003c/a\u003e\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/mergesort-ARWDq\" rel=\"nofollow\"\u003e1. Mergesort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part1/lecture/PWNEl/bottom-up-mergesort\" rel=\"nofollow\"\u003e2. Bottom-up Mergesort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/sorting-complexity-xAltF\" rel=\"nofollow\"\u003e3. Sorting Complexity\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/comparators-9FYhS\" rel=\"nofollow\"\u003e4. Comparators\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part1/lecture/pvvLZ/stability\" rel=\"nofollow\"\u003e5. Stability\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part1/home/week/3\" rel=\"nofollow\"\u003eSedgewick - Quicksort (4 videos)\u003c/a\u003e\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/quicksort-vjvnC\" rel=\"nofollow\"\u003e1. Quicksort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/selection-UQxFT\" rel=\"nofollow\"\u003e2. Selection\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/duplicate-keys-XvjPd\" rel=\"nofollow\"\u003e3. Duplicate Keys\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part1/system-sorts-QBNZ7\" rel=\"nofollow\"\u003e4. System Sorts\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e UC Berkeley:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_EiUvYS2DT6I\" rel=\"nofollow\"\u003eCS 61B Lecture 29: Sorting I (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_2hTY3t80Qsk\" rel=\"nofollow\"\u003eCS 61B Lecture 30: Sorting II (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_Y6LOLpxg6Dc\" rel=\"nofollow\"\u003eCS 61B Lecture 32: Sorting III (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_qNMQ4ly43p4\" rel=\"nofollow\"\u003eCS 61B Lecture 33: Sorting V (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_pvbBMd-3NoI\" rel=\"nofollow\"\u003eCS 61B 2014-04-21: Radix Sort(video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=P00xJgWzz2c\u0026amp;index=1\u0026amp;list=PL89B61F78B552C1AB\" rel=\"nofollow\"\u003eBubble Sort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ni_zk257Nqo\u0026amp;index=7\u0026amp;list=PL89B61F78B552C1AB\" rel=\"nofollow\"\u003eAnalyzing Bubble Sort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Kg4bqzAqRBM\u0026amp;index=3\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\" rel=\"nofollow\"\u003eInsertion Sort, Merge Sort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=c4BRHC7kTaQ\u0026amp;index=2\u0026amp;list=PL89B61F78B552C1AB\" rel=\"nofollow\"\u003eInsertion Sort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=GCae1WNvnZM\u0026amp;index=3\u0026amp;list=PL89B61F78B552C1AB\" rel=\"nofollow\"\u003eMerge Sort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=y_G9BkAm6B8\u0026amp;index=4\u0026amp;list=PL89B61F78B552C1AB\" rel=\"nofollow\"\u003eQuicksort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=6nDMgr0-Yyo\u0026amp;index=8\u0026amp;list=PL89B61F78B552C1AB\" rel=\"nofollow\"\u003eSelection Sort (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Merge sort code:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c\" rel=\"nofollow\"\u003eUsing output array (C)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://github.com/jwasham/practice-python/blob/master/merge_sort/merge_sort.py\"\u003eUsing output array (Python)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc\"\u003eIn-place (C++)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Quick sort code:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c\" rel=\"nofollow\"\u003eImplementation (C)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c\"\u003eImplementation (C)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py\"\u003eImplementation (Python)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl\" rel=\"nofollow\"\u003e[Review] Sorting (playlist) in 18 minutes\u003c/a\u003e\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/Hoixgm4-P4M\" rel=\"nofollow\"\u003eQuick sort in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/2DmK_H7IdTo\" rel=\"nofollow\"\u003eHeap sort in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/4VqmGXwpLqc\" rel=\"nofollow\"\u003eMerge sort in 3 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/xli_FI7CuzA\" rel=\"nofollow\"\u003eBubble sort in 2 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/g-PGLbMth_g\" rel=\"nofollow\"\u003eSelection sort in 3 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/JU767SDMDvA\" rel=\"nofollow\"\u003eInsertion sort in 2 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Implement:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Mergesort: O(n log n) average and worst case\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Quicksort O(n log n) average case\u003c/li\u003e\n\u003cli\u003eSelection sort and insertion sort are both O(n^2) average and worst-case\u003c/li\u003e\n\u003cli\u003eFor heapsort, see Heap data structure above\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Not required, but I recommended them:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/home/week/3\" rel=\"nofollow\"\u003eSedgewick - Radix Sorts (6 videos)\u003c/a\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/vGHvb/strings-in-java\" rel=\"nofollow\"\u003e1. Strings in Java\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part2/key-indexed-counting-2pi1Z\" rel=\"nofollow\"\u003e2. Key Indexed Counting\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/c1U7L/lsd-radix-sort\" rel=\"nofollow\"\u003e3. Least Significant Digit First String Radix Sort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/gFxwG/msd-radix-sort\" rel=\"nofollow\"\u003e4. Most Significant Digit First String Radix Sort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part2/3-way-radix-quicksort-crkd5\" rel=\"nofollow\"\u003e5. 3 Way Radix Quicksort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays\" rel=\"nofollow\"\u003e6. Suffix Arrays\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort\" rel=\"nofollow\"\u003eRadix Sort\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=xhr26ia4k38\" rel=\"nofollow\"\u003eRadix Sort (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Nz1KZXbghj8\u0026amp;index=7\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\" rel=\"nofollow\"\u003eRadix Sort, Counting Sort (linear time given constraints) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=cNB2lADK3_s\u0026amp;index=8\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003eRandomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=pOKy3RZbSws\u0026amp;list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf\u0026amp;index=14\" rel=\"nofollow\"\u003eSorting in Linear Time (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eAs a summary, here is a visual representation of \u003ca href=\"https://www.youtube.com/watch?v=kPRA0W1kECg\" rel=\"nofollow\"\u003e15 sorting algorithms\u003c/a\u003e.\nIf you need more detail on this subject, see the \"Sorting\" section in \u003ca href=\"#additional-detail-on-some-subjects\"\u003eAdditional Detail on Some Subjects\u003c/a\u003e\u003c/p\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eGraphs\u003c/h2\u003e\u003ca id=\"user-content-graphs\" class=\"anchor\" aria-label=\"Permalink: Graphs\" href=\"#graphs\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eGraphs can be used to represent many problems in computer science, so this section is long, like trees and sorting.\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eNotes:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThere are 4 basic ways to represent a graph in memory:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eobjects and pointers\u003c/li\u003e\n\u003cli\u003eadjacency matrix\u003c/li\u003e\n\u003cli\u003eadjacency list\u003c/li\u003e\n\u003cli\u003eadjacency map\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eFamiliarize yourself with each representation and its pros \u0026amp; cons\u003c/li\u003e\n\u003cli\u003eBFS and DFS - know their computational complexity, their trade-offs, and how to implement them in real code\u003c/li\u003e\n\u003cli\u003eWhen asked a question, look for a graph-based solution first, then move on if none\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e MIT(videos):\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=oFVYVzlvk9c\u0026amp;t=14s\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003eBreadth-First Search\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=IBfWDYSffUU\u0026amp;t=32s\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003eDepth-First Search\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Skiena Lectures - great intro:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Sjk0xqWWPCc\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=10\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 10 - Graph Data Structures (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ZTwjXj81NVY\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=11\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 11 - Graph Traversal (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=KyordYB3BOs\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=12\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 12 - Depth First Search (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=oolm2VnJUKw\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=13\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 13 - Minimum Spanning Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=RktgPx0MarY\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=14\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 14 - Minimum Spanning Trees (con't) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=MUe5DXRhyAo\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=15\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 15 - Graph Algorithms (con't 2) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\n\u003cp dir=\"auto\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Graphs (review and more):\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Aa2sqUhIn-E\u0026amp;index=15\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\" rel=\"nofollow\"\u003e6.006 Single-Source Shortest Paths Problem (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=NSHizBK9JD8\u0026amp;t=1731s\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003e6.006 Dijkstra (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=f9cVS_URPc0\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003e6.006 Bellman-Ford (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=CHvQ3q_gJ7E\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;index=18\" rel=\"nofollow\"\u003e6.006 Speeding Up Dijkstra (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=i_AQT_XfvD8\u0026amp;index=6\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\" rel=\"nofollow\"\u003eAduni: Graph Algorithms I - Topological Sorting, Minimum Spanning Trees, Prim's Algorithm - Lecture 6 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ufj5_bppBsA\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=7\" rel=\"nofollow\"\u003eAduni: Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure - Lecture 7 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=DiedsPsMKXc\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=8\" rel=\"nofollow\"\u003eAduni: Graph Algorithms III: Shortest Path - Lecture 8 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=XIAQRlNkJAw\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=9\" rel=\"nofollow\"\u003eAduni: Graph Alg. IV: Intro to geometric algorithms - Lecture 9 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k\" rel=\"nofollow\"\u003eCS 61B 2014: Weighted graphs (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=tKwnms5iRBU\u0026amp;index=16\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003eGreedy Algorithms: Minimum Spanning Tree (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=RpgcYiky7uw\" rel=\"nofollow\"\u003eStrongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw\" rel=\"nofollow\"\u003e[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV\" rel=\"nofollow\"\u003e[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eFull Coursera Course:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-on-graphs/home/welcome\" rel=\"nofollow\"\u003eAlgorithms on Graphs (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eI'll implement:\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e DFS with adjacency list (recursive)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e DFS with adjacency list (iterative with stack)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e DFS with adjacency matrix (recursive)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e DFS with adjacency matrix (iterative with stack)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e BFS with adjacency list\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e BFS with adjacency matrix\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e single-source shortest path (Dijkstra)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e minimum spanning tree\u003c/li\u003e\n\u003cli\u003eDFS-based algorithms (see Aduni videos above):\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e check for a cycle (needed for topological sort, since we'll check for the cycle before starting)\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e topological sort\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e count connected components in a graph\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e list strongly connected components\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e check for bipartite graph\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eEven More Knowledge\u003c/h2\u003e\u003ca id=\"user-content-even-more-knowledge\" class=\"anchor\" aria-label=\"Permalink: Even More Knowledge\" href=\"#even-more-knowledge\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eRecursion\u003c/h3\u003e\u003ca id=\"user-content-recursion\" class=\"anchor\" aria-label=\"Permalink: Recursion\" href=\"#recursion\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Stanford lectures on recursion \u0026amp; backtracking:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=gl3emqCuueQ\u0026amp;list=PLFE6E58F856038C69\u0026amp;index=8\" rel=\"nofollow\"\u003eLecture 8 | Programming Abstractions (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=uFJhEPrbycQ\u0026amp;list=PLFE6E58F856038C69\u0026amp;index=9\" rel=\"nofollow\"\u003eLecture 9 | Programming Abstractions (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=NdF1QDTRkck\u0026amp;index=10\u0026amp;list=PLFE6E58F856038C69\" rel=\"nofollow\"\u003eLecture 10 | Programming Abstractions (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=p-gpaIGRCQI\u0026amp;list=PLFE6E58F856038C69\u0026amp;index=11\" rel=\"nofollow\"\u003eLecture 11 | Programming Abstractions (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eWhen it is appropriate to use it?\u003c/li\u003e\n\u003cli\u003eHow is tail recursion better than not?\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad\" rel=\"nofollow\"\u003eWhat Is Tail Recursion Why Is It So Bad?\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1\" rel=\"nofollow\"\u003eTail Recursion (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/ngCos392W4w\" rel=\"nofollow\"\u003e5 Simple Steps for Solving Any Recursive Problem(video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eBacktracking Blueprint: \u003ca href=\"https://leetcode.com/problems/combination-sum/discuss/16502/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning)\" rel=\"nofollow\"\u003eJava\u003c/a\u003e\n\u003ca href=\"https://leetcode.com/problems/combination-sum/discuss/429538/General-Backtracking-questions-solutions-in-Python-for-reference-%3A\" rel=\"nofollow\"\u003ePython\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDynamic Programming\u003c/h3\u003e\u003ca id=\"user-content-dynamic-programming\" class=\"anchor\" aria-label=\"Permalink: Dynamic Programming\" href=\"#dynamic-programming\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eYou probably won't see any dynamic programming problems in your interview, but it's worth being able to recognize a\nproblem as being a candidate for dynamic programming.\u003c/li\u003e\n\u003cli\u003eThis subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky.\u003c/li\u003e\n\u003cli\u003eI suggest looking at many examples of DP problems until you have a solid understanding of the pattern involved.\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Videos:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=wAA0AMfcJHQ\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=18\" rel=\"nofollow\"\u003eSkiena: CSE373 2020 - Lecture 19 - Introduction to Dynamic Programming (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=T3A4jlHlhtA\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=19\" rel=\"nofollow\"\u003eSkiena: CSE373 2020 - Lecture 20 - Edit Distance (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=iPnPVcZmRbE\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=20\" rel=\"nofollow\"\u003eSkiena: CSE373 2020 - Lecture 20 - Edit Distance (continued) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=2xPE4Wq8coQ\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=21\" rel=\"nofollow\"\u003eSkiena: CSE373 2020 - Lecture 21 - Dynamic Programming (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Yh3RzqQGsyI\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=22\" rel=\"nofollow\"\u003eSkiena: CSE373 2020 - Lecture 22 - Dynamic Programming and Review (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/J5aJEcOr6Eo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;t=3558\" rel=\"nofollow\"\u003eSimonson: Dynamic Programming 0 (starts at 59:18) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=0EzHjQ_SOeU\u0026amp;index=11\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\" rel=\"nofollow\"\u003eSimonson: Dynamic Programming I - Lecture 11 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=v1qiRwuJU7g\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=12\" rel=\"nofollow\"\u003eSimonson: Dynamic programming II - Lecture 12 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e List of individual DP problems (each is short):\n\u003ca href=\"https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr\" rel=\"nofollow\"\u003eDynamic Programming (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Yale Lecture notes:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming\" rel=\"nofollow\"\u003eDynamic Programming\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Coursera:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithmic-thinking-2/lecture/80RrW/the-rna-secondary-structure-problem\" rel=\"nofollow\"\u003eThe RNA secondary structure problem (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithmic-thinking-2/a-dynamic-programming-algorithm-PSonq\" rel=\"nofollow\"\u003eA dynamic programming algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithmic-thinking-2/illustrating-the-dp-algorithm-oUEK2\" rel=\"nofollow\"\u003eIllustrating the DP algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm\" rel=\"nofollow\"\u003eRunning time of the DP algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation\" rel=\"nofollow\"\u003eDP vs. recursive implementation (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithmic-thinking-2/global-pairwise-sequence-alignment-UZ7o6\" rel=\"nofollow\"\u003eGlobal pairwise sequence alignment (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment\" rel=\"nofollow\"\u003eLocal pairwise sequence alignment (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDesign patterns\u003c/h3\u003e\u003ca id=\"user-content-design-patterns\" class=\"anchor\" aria-label=\"Permalink: Design patterns\" href=\"#design-patterns\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=3cmzqZzwNDM\u0026amp;list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc\u0026amp;index=3\" rel=\"nofollow\"\u003eQuick UML review (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Learn these patterns:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e strategy\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e singleton\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e adapter\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e prototype\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e decorator\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e visitor\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e factory, abstract factory\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e facade\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e observer\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e proxy\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e delegate\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e command\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e state\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e memento\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e iterator\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e composite\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e flyweight\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PLF206E906175C7E07\" rel=\"nofollow\"\u003eSeries of videos (27 videos)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124\" rel=\"nofollow\"\u003eBook: Head First Design Patterns\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eI know the canonical book is \"Design Patterns: Elements of Reusable Object-Oriented Software\", but Head First is great for beginners to OO.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://sourcemaking.com/design-patterns-and-tips\" rel=\"nofollow\"\u003eHandy reference: 101 Design Patterns \u0026amp; Tips for Developers\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCombinatorics (n choose k) \u0026amp; Probability\u003c/h3\u003e\u003ca id=\"user-content-combinatorics-n-choose-k--probability\" class=\"anchor\" aria-label=\"Permalink: Combinatorics (n choose k) \u0026amp; Probability\" href=\"#combinatorics-n-choose-k--probability\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=8RRo6Ti9d0U\" rel=\"nofollow\"\u003eMath Skills: How to find Factorial, Permutation, and Combination (Choose) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=sZkAAk9Wwa4\" rel=\"nofollow\"\u003eMake School: Probability (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=dNaJg-mLobQ\" rel=\"nofollow\"\u003eMake School: More Probability and Markov Chains (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Khan Academy:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eCourse layout:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic\" rel=\"nofollow\"\u003eBasic Theoretical Probability\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eJust the videos - 41 (each are simple and each are short):\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=uzkc-qNVoOk\u0026amp;list=PLC58778F28211FA19\" rel=\"nofollow\"\u003eProbability Explained (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eNP, NP-Complete and Approximation Algorithms\u003c/h3\u003e\u003ca id=\"user-content-np-np-complete-and-approximation-algorithms\" class=\"anchor\" aria-label=\"Permalink: NP, NP-Complete and Approximation Algorithms\" href=\"#np-np-complete-and-approximation-algorithms\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eKnow about the most famous classes of NP-complete problems, such as the traveling salesman and the knapsack problem,\nand be able to recognize them when an interviewer asks you them in disguise.\u003c/li\u003e\n\u003cli\u003eKnow what NP-complete means.\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=moPtwq_cVH8\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;index=23\" rel=\"nofollow\"\u003eComputational Complexity (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Simonson:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;t=2939\" rel=\"nofollow\"\u003eGreedy Algs. II \u0026amp; Intro to NP-Completeness (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=e0tGC6ZQdQE\u0026amp;index=16\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\" rel=\"nofollow\"\u003eNP Completeness II \u0026amp; Reductions (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=fCX1BGT3wjE\u0026amp;index=17\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\" rel=\"nofollow\"\u003eNP Completeness III (Video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=NKLDp3Rch3M\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=18\" rel=\"nofollow\"\u003eNP Completeness IV (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Skiena:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ItHp5laE1VE\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=23\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 23 - NP-Completeness (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=inaFJeCzGxU\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=24\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 24 - Satisfiability (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=B-bhKxjZLlc\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=25\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 25 - More NP-Completeness (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=_EzetTkG_Cc\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=26\" rel=\"nofollow\"\u003eCSE373 2020 - Lecture 26 - NP-Completeness Challenge (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=eHZifpgyH_4\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=22\" rel=\"nofollow\"\u003eComplexity: P, NP, NP-completeness, Reductions (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=MEz1J9wY2iM\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=24\" rel=\"nofollow\"\u003eComplexity: Approximation Algorithms (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=4q-jmGrmxKs\u0026amp;index=25\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003eComplexity: Fixed-Parameter Algorithms (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003ePeter Norvig discusses near-optimal solutions to the traveling salesman problem:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb\" rel=\"nofollow\"\u003eJupyter Notebook\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003ePages 1048 - 1140 in CLRS if you have it.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eHow computers process a program\u003c/h3\u003e\u003ca id=\"user-content-how-computers-process-a-program\" class=\"anchor\" aria-label=\"Permalink: How computers process a program\" href=\"#how-computers-process-a-program\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=XM4lGflQFvA\" rel=\"nofollow\"\u003eHow CPU executes a program (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/1I5ZMmrOfnA\" rel=\"nofollow\"\u003eHow computers calculate - ALU (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/fpnE6UAfbtU\" rel=\"nofollow\"\u003eRegisters and RAM (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/FZGugFqdr60\" rel=\"nofollow\"\u003eThe Central Processing Unit (CPU) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://youtu.be/zltgXvg6r3k\" rel=\"nofollow\"\u003eInstructions and Programs (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCaches\u003c/h3\u003e\u003ca id=\"user-content-caches\" class=\"anchor\" aria-label=\"Permalink: Caches\" href=\"#caches\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e LRU cache:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=R5ON3iwx78M\" rel=\"nofollow\"\u003eThe Magic of LRU Cache (100 Days of Google Dev) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=bq6N7Ym81iI\" rel=\"nofollow\"\u003eImplementing LRU (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=8-FZRAjR7qU\" rel=\"nofollow\"\u003eLeetCode - 146 LRU Cache (C++) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e CPU cache:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=vjYF_fAZI5E\u0026amp;list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-\u0026amp;index=24\" rel=\"nofollow\"\u003eMIT 6.004 L15: The Memory Hierarchy (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ajgC3-pyGlk\u0026amp;index=25\u0026amp;list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-\" rel=\"nofollow\"\u003eMIT 6.004 L16: Cache Issues (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eProcesses and Threads\u003c/h3\u003e\u003ca id=\"user-content-processes-and-threads\" class=\"anchor\" aria-label=\"Permalink: Processes and Threads\" href=\"#processes-and-threads\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Computer Science 162 - Operating Systems (25 videos):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003efor processes and threads see videos 1-11\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c\" rel=\"nofollow\"\u003eOperating Systems and System Programming (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread\" rel=\"nofollow\"\u003eWhat Is The Difference Between A Process And A Thread?\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eCovers:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eProcesses, Threads, Concurrency issues\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eDifference between processes and threads\u003c/li\u003e\n\u003cli\u003eProcesses\u003c/li\u003e\n\u003cli\u003eThreads\u003c/li\u003e\n\u003cli\u003eLocks\u003c/li\u003e\n\u003cli\u003eMutexes\u003c/li\u003e\n\u003cli\u003eSemaphores\u003c/li\u003e\n\u003cli\u003eMonitors\u003c/li\u003e\n\u003cli\u003eHow do they work?\u003c/li\u003e\n\u003cli\u003eDeadlock\u003c/li\u003e\n\u003cli\u003eLivelock\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eCPU activity, interrupts, context switching\u003c/li\u003e\n\u003cli\u003eModern concurrency constructs with multicore processors\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://youtu.be/O4nwUqQodAg\" rel=\"nofollow\"\u003ePaging, segmentation, and virtual memory (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://youtu.be/iKlAWIKEyuw\" rel=\"nofollow\"\u003eInterrupts (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eProcess resource needs (memory: code, static storage, stack, heap, and also file descriptors, i/o)\u003c/li\u003e\n\u003cli\u003eThread resource needs (shares above (minus stack) with other threads in the same process but each has its own PC, stack counter, registers, and stack)\u003c/li\u003e\n\u003cli\u003eForking is really copy on write (read-only) until the new process writes to memory, then it does a full copy.\u003c/li\u003e\n\u003cli\u003eContext switching\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.javatpoint.com/what-is-the-context-switching-in-the-operating-system\" rel=\"nofollow\"\u003eHow context switching is initiated by the operating system and underlying hardware?\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL5jc9xFGsL8E12so1wlMS0r0hTQoJL74M\" rel=\"nofollow\"\u003ethreads in C++ (series - 10 videos)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PLacuG5pysFbDQU8kKxbUh4K5c1iL5_k7k\" rel=\"nofollow\"\u003eCS 377 Spring '14: Operating Systems from University of Massachusetts\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e concurrency in Python (videos):\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1\" rel=\"nofollow\"\u003eShort series on threads\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Bs7vPNbB9JM\" rel=\"nofollow\"\u003ePython Threads\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Obt-vMVdM8s\" rel=\"nofollow\"\u003eUnderstanding the Python GIL (2010)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://www.dabeaz.com/GIL\" rel=\"nofollow\"\u003ereference\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=MCs5OvhV9S4\" rel=\"nofollow\"\u003eDavid Beazley - Python Concurrency From the Ground Up LIVE! - PyCon 2015\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ZzfHjytDceU\" rel=\"nofollow\"\u003eKeynote David Beazley - Topics of Interest (Python Asyncio)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=0zaPs8OtyKY\" rel=\"nofollow\"\u003eMutex in Python\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTesting\u003c/h3\u003e\u003ca id=\"user-content-testing\" class=\"anchor\" aria-label=\"Permalink: Testing\" href=\"#testing\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eTo cover:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ehow unit testing works\u003c/li\u003e\n\u003cli\u003ewhat are mock objects\u003c/li\u003e\n\u003cli\u003ewhat is integration testing\u003c/li\u003e\n\u003cli\u003ewhat is dependency injection\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=SAhJf36_u5U\" rel=\"nofollow\"\u003eAgile Software Testing with James Bach (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=ILkT_HV9DVU\" rel=\"nofollow\"\u003eOpen Lecture by James Bach on Software Testing (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://vimeo.com/83960706\" rel=\"nofollow\"\u003eSteve Freeman - Test-Driven Development (that’s not what we meant) (video)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://gotocon.com/dl/goto-berlin-2013/slides/SteveFreeman_TestDrivenDevelopmentThatsNotWhatWeMeant.pdf\" rel=\"nofollow\"\u003eslides\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Dependency injection:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=IKD2-MAkXyQ\" rel=\"nofollow\"\u003evideo\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html\" rel=\"nofollow\"\u003eTao Of Testing\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html\" rel=\"nofollow\"\u003eHow to write tests\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eString searching \u0026amp; manipulations\u003c/h3\u003e\u003ca id=\"user-content-string-searching--manipulations\" class=\"anchor\" aria-label=\"Permalink: String searching \u0026amp; manipulations\" href=\"#string-searching--manipulations\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays\" rel=\"nofollow\"\u003eSedgewick - Suffix Arrays (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/home/week/4\" rel=\"nofollow\"\u003eSedgewick - Substring Search (videos)\u003c/a\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part2/introduction-to-substring-search-n3ZpG\" rel=\"nofollow\"\u003e1. Introduction to Substring Search\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/2Kn5i/brute-force-substring-search\" rel=\"nofollow\"\u003e2. Brute-Force Substring Search\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/TAtDr/knuth-morris-pratt\" rel=\"nofollow\"\u003e3. Knuth-Morris Pratt\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/CYxOT/boyer-moore\" rel=\"nofollow\"\u003e4. Boyer-Moore\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/lecture/algorithms-part2/rabin-karp-3KiqT\" rel=\"nofollow\"\u003e5. Rabin-Karp\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-text\" rel=\"nofollow\"\u003eSearch pattern in a text (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eIf you need more detail on this subject, see the \"String Matching\" section in \u003ca href=\"#additional-detail-on-some-subjects\"\u003eAdditional Detail on Some Subjects\u003c/a\u003e.\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTries\u003c/h3\u003e\u003ca id=\"user-content-tries\" class=\"anchor\" aria-label=\"Permalink: Tries\" href=\"#tries\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eNote there are different kinds of tries. Some have prefixes, some don't, and some use strings instead of bits\nto track the path\u003c/li\u003e\n\u003cli\u003eI read through the code, but will not implement\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/home/week/4\" rel=\"nofollow\"\u003eSedgewick - Tries (3 videos)\u003c/a\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries\" rel=\"nofollow\"\u003e1. R Way Tries\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries\" rel=\"nofollow\"\u003e2. Ternary Search Tries\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations\" rel=\"nofollow\"\u003e3. Character Based Operations\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries\" rel=\"nofollow\"\u003eNotes on Data Structures and Programming Techniques\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Short course videos:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries\" rel=\"nofollow\"\u003eIntroduction To Tries (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries\" rel=\"nofollow\"\u003ePerformance Of Tries (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie\" rel=\"nofollow\"\u003eImplementing A Trie (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.toptal.com/java/the-trie-a-neglected-data-structure\" rel=\"nofollow\"\u003eThe Trie: A Neglected Data Structure\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.topcoder.com/thrive/articles/Using%20Tries\" rel=\"nofollow\"\u003eTopCoder - Using Tries\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=TJ8SkcUSdbU\" rel=\"nofollow\"\u003eStanford Lecture (real-world use case) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=NinWEPPrkDQ\u0026amp;index=16\u0026amp;list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf\" rel=\"nofollow\"\u003eMIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eFloating Point Numbers\u003c/h3\u003e\u003ca id=\"user-content-floating-point-numbers\" class=\"anchor\" aria-label=\"Permalink: Floating Point Numbers\" href=\"#floating-point-numbers\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e simple 8-bit: \u003ca href=\"https://www.youtube.com/watch?v=ji3SfClm8TU\" rel=\"nofollow\"\u003eRepresentation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eUnicode\u003c/h3\u003e\u003ca id=\"user-content-unicode\" class=\"anchor\" aria-label=\"Permalink: Unicode\" href=\"#unicode\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.joelonsoftware.com/articles/Unicode.html\" rel=\"nofollow\"\u003eThe Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://kunststube.net/encoding/\" rel=\"nofollow\"\u003eWhat Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Text\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eEndianness\u003c/h3\u003e\u003ca id=\"user-content-endianness\" class=\"anchor\" aria-label=\"Permalink: Endianness\" href=\"#endianness\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://web.archive.org/web/20180107141940/http://www.cs.umd.edu:80/class/sum2003/cmsc311/Notes/Data/endian.html\" rel=\"nofollow\"\u003eBig And Little Endian\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=JrNF0KRAlyo\" rel=\"nofollow\"\u003eBig Endian Vs Little Endian (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=oBSuXP-1Tc0\" rel=\"nofollow\"\u003eBig And Little Endian Inside/Out (video)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eVery technical talk for kernel devs. Don't worry if most is over your head.\u003c/li\u003e\n\u003cli\u003eThe first half is enough.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eNetworking\u003c/h3\u003e\u003ca id=\"user-content-networking\" class=\"anchor\" aria-label=\"Permalink: Networking\" href=\"#networking\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003e\u003cstrong\u003eIf you have networking experience or want to be a reliability engineer or operations engineer, expect questions\u003c/strong\u003e\u003c/li\u003e\n\u003cli\u003eOtherwise, this is just good to know\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.khanacademy.org/computing/code-org/computers-and-the-internet\" rel=\"nofollow\"\u003eKhan Academy\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Vdc8TCESIg8\" rel=\"nofollow\"\u003eUDP and TCP: Comparison of Transport Protocols (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=e5DEVa9eSN0\" rel=\"nofollow\"\u003eTCP/IP and the OSI Model Explained! (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=nomyRJehhnM\" rel=\"nofollow\"\u003ePacket Transmission across the Internet. Networking \u0026amp; TCP/IP tutorial. (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=WGJrLqtX7As\" rel=\"nofollow\"\u003eHTTP (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=S2iBR2ZlZf0\" rel=\"nofollow\"\u003eSSL and HTTPS (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=Rp3iZUvXWlM\" rel=\"nofollow\"\u003eSSL/TLS (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=E9FxNzv1Tr8\" rel=\"nofollow\"\u003eHTTP 2.0 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j\" rel=\"nofollow\"\u003eVideo Series (21 videos) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=t5xYI0jzOf4\" rel=\"nofollow\"\u003eSubnetting Demystified - Part 5 CIDR Notation (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Sockets:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=6G_W54zuadg\u0026amp;t=6s\" rel=\"nofollow\"\u003eJava - Sockets - Introduction (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=G75vN2mnJeQ\" rel=\"nofollow\"\u003eSocket Programming (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003chr\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eFinal Review\u003c/h2\u003e\u003ca id=\"user-content-final-review\" class=\"anchor\" aria-label=\"Permalink: Final Review\" href=\"#final-review\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cdiv class=\"snippet-clipboard-content notranslate position-relative overflow-auto\" data-snippet-clipboard-copy-content=\"This section will have shorter videos that you can watch pretty quickly to review most of the important concepts.\nIt's nice if you want a refresher often.\"\u003e\u003cpre class=\"notranslate\"\u003e\u003ccode\u003eThis section will have shorter videos that you can watch pretty quickly to review most of the important concepts.\nIt's nice if you want a refresher often.\n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Series of 2-3 minutes short subject videos (23 videos)\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=r4r1DZcx1cM\u0026amp;list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj\u0026amp;index=22\" rel=\"nofollow\"\u003eVideos\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Series of 2-5 minutes short subject videos - Michael Sambol (48 videos):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/@MichaelSambol\" rel=\"nofollow\"\u003eVideos\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/msambol/dsa\"\u003eCode Examples\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part1\" rel=\"nofollow\"\u003eSedgewick Videos - Algorithms I\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.coursera.org/learn/algorithms-part2\" rel=\"nofollow\"\u003eSedgewick Videos - Algorithms II\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003chr\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eUpdate Your Resume\u003c/h2\u003e\u003ca id=\"user-content-update-your-resume\" class=\"anchor\" aria-label=\"Permalink: Update Your Resume\" href=\"#update-your-resume\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eSee Resume prep information in the books: \"Cracking The Coding Interview\" and \"Programming Interviews Exposed\"\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.careercup.com/resume\" rel=\"nofollow\"\u003e\"This Is What A GOOD Resume Should Look Like\" by Gayle McDowell (author of Cracking the Coding Interview)\u003c/a\u003e,\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eNote by the author: \"This is for a US-focused resume. CVs for India and other countries have different expectations, although many of the points will be the same.\"\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.techinterviewhandbook.org/resume/guide\" rel=\"nofollow\"\u003e\"Step-by-step resume guide\" by Tech Interview Handbook\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eDetailed guide on how to set up your resume from scratch, write effective resume content, optimize it, and test your resume\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eInterview Process \u0026amp; General Interview Prep\u003c/h2\u003e\u003ca id=\"user-content-interview-process--general-interview-prep\" class=\"anchor\" aria-label=\"Permalink: Interview Process \u0026amp; General Interview Prep\" href=\"#interview-process--general-interview-prep\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://davidbyttow.medium.com/how-to-pass-the-engineering-interview-in-2021-45f1b389a1\" rel=\"nofollow\"\u003eHow to Pass the Engineering Interview in 2021\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=N233T0epWTs\" rel=\"nofollow\"\u003eDemystifying Tech Recruiting\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e How to Get a Job at the Big 4:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=YJZCUhxNCv8\" rel=\"nofollow\"\u003eHow to Get a Job at the Big 4 - Amazon, Facebook, Google \u0026amp; Microsoft (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=6790FVXWBw8\u0026amp;feature=youtu.be\" rel=\"nofollow\"\u003eHow to Get a Job at the Big 4.1 (Follow-up video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Cracking The Coding Interview Set 1:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=rEJzOhC5ZtQ\" rel=\"nofollow\"\u003eGayle L McDowell - Cracking The Coding Interview (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=aClxtDcdpsQ\" rel=\"nofollow\"\u003eCracking the Coding Interview with Author Gayle Laakmann McDowell (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Cracking the Facebook Coding Interview:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=wCl9kvQGHPI\" rel=\"nofollow\"\u003eThe Approach\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=4UWDyJq8jZg\" rel=\"nofollow\"\u003eProblem Walkthrough\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003ePrep Courses:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.udemy.com/python-for-data-structures-algorithms-and-interviews/\" rel=\"nofollow\"\u003ePython for Data Structures, Algorithms, and Interviews (paid course)\u003c/a\u003e:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eA Python-centric interview prep course that covers data structures, algorithms, mock interviews, and much more.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.udacity.com/course/data-structures-and-algorithms-in-python--ud513\" rel=\"nofollow\"\u003eIntro to Data Structures and Algorithms using Python (Udacity free course)\u003c/a\u003e:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eA free Python-centric data structures and algorithms course.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.udacity.com/course/data-structures-and-algorithms-nanodegree--nd256\" rel=\"nofollow\"\u003eData Structures and Algorithms Nanodegree! (Udacity paid Nanodegree)\u003c/a\u003e:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGet hands-on practice with over 100 data structures and algorithm exercises and guidance from a dedicated mentor to help prepare you for interviews and on-the-job scenarios.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.educative.io/courses/grokking-the-behavioral-interview\" rel=\"nofollow\"\u003eGrokking the Behavioral Interview (Educative free course)\u003c/a\u003e:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eMany times, it’s not your technical competency that holds you back from landing your dream job, it’s how you perform on the behavioral interview.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://algo.monster/?utm_campaign=jwasham\u0026amp;utm_medium=referral\u0026amp;utm_content=coding-interview-university\u0026amp;utm_source=github\" rel=\"nofollow\"\u003eAlgoMonster (paid course with free content)\u003c/a\u003e:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThe crash course for LeetCode. Covers all the patterns condensed from thousands of questions.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003eMock Interviews:\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://www.gainlo.co/#!/\" rel=\"nofollow\"\u003eGainlo.co: Mock interviewers from big companies\u003c/a\u003e - I used this and it helped me relax for the phone screen and on-site interview\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.pramp.com/\" rel=\"nofollow\"\u003ePramp: Mock interviews from/with peers\u003c/a\u003e - a peer-to-peer model to practice interviews\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://interviewing.io\" rel=\"nofollow\"\u003einterviewing.io: Practice mock interview with senior engineers\u003c/a\u003e - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://meetapro.com/?utm_source=ciu\" rel=\"nofollow\"\u003eMeetapro: Mock interviews with top FAANG interviewers\u003c/a\u003e - an Airbnb-style mock interview/coaching platform.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.hellointerview.com/?utm_source=ciu\" rel=\"nofollow\"\u003eHello Interview: Mock Interviews with Expert Coaches and AI\u003c/a\u003e - interview directly with AI or with FAANG staff engineers and managers.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://codemia.io/?utm_source=ciu\" rel=\"nofollow\"\u003eCodemia: Practice system design problems with AI or community solutions and feedback\u003c/a\u003e - Practice system design problems via AI practice tool. Share your solution with the community to get human feedback as well.\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBe thinking of for when the interview comes\u003c/h2\u003e\u003ca id=\"user-content-be-thinking-of-for-when-the-interview-comes\" class=\"anchor\" aria-label=\"Permalink: Be thinking of for when the interview comes\" href=\"#be-thinking-of-for-when-the-interview-comes\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eThink of about 20 interview questions you'll get, along with the lines of the items below. Have at least one answer for each.\nHave a story, not just data, about something you accomplished.\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eWhy do you want this job?\u003c/li\u003e\n\u003cli\u003eWhat's a tough problem you've solved?\u003c/li\u003e\n\u003cli\u003eBiggest challenges faced?\u003c/li\u003e\n\u003cli\u003eBest/worst designs seen?\u003c/li\u003e\n\u003cli\u003eIdeas for improving an existing product\u003c/li\u003e\n\u003cli\u003eHow do you work best, as an individual and as part of a team?\u003c/li\u003e\n\u003cli\u003eWhich of your skills or experiences would be assets in the role and why?\u003c/li\u003e\n\u003cli\u003eWhat did you most enjoy at [job x / project y]?\u003c/li\u003e\n\u003cli\u003eWhat was the biggest challenge you faced at [job x / project y]?\u003c/li\u003e\n\u003cli\u003eWhat was the hardest bug you faced at [job x / project y]?\u003c/li\u003e\n\u003cli\u003eWhat did you learn at [job x / project y]?\u003c/li\u003e\n\u003cli\u003eWhat would you have done better at [job x / project y]?\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eHave questions for the interviewer\u003c/h2\u003e\u003ca id=\"user-content-have-questions-for-the-interviewer\" class=\"anchor\" aria-label=\"Permalink: Have questions for the interviewer\" href=\"#have-questions-for-the-interviewer\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eSome of mine (I already may know the answers, but want their opinion or team perspective):\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eHow large is your team?\u003c/li\u003e\n\u003cli\u003eWhat does your dev cycle look like? Do you do waterfall/sprints/agile?\u003c/li\u003e\n\u003cli\u003eAre rushes to deadlines common? Or is there flexibility?\u003c/li\u003e\n\u003cli\u003eHow are decisions made in your team?\u003c/li\u003e\n\u003cli\u003eHow many meetings do you have per week?\u003c/li\u003e\n\u003cli\u003eDo you feel your work environment helps you concentrate?\u003c/li\u003e\n\u003cli\u003eWhat are you working on?\u003c/li\u003e\n\u003cli\u003eWhat do you like about it?\u003c/li\u003e\n\u003cli\u003eWhat is the work life like?\u003c/li\u003e\n\u003cli\u003eHow is the work/life balance?\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eOnce You've Got The Job\u003c/h2\u003e\u003ca id=\"user-content-once-youve-got-the-job\" class=\"anchor\" aria-label=\"Permalink: Once You've Got The Job\" href=\"#once-youve-got-the-job\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eCongratulations!\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eKeep learning.\u003c/p\u003e\n\u003cp dir=\"auto\"\u003eYou're never really done.\u003c/p\u003e\n\u003chr\u003e\n\u003cdiv class=\"snippet-clipboard-content notranslate position-relative overflow-auto\" data-snippet-clipboard-copy-content=\"*****************************************************************************************************\n*****************************************************************************************************\n\nEverything below this point is optional. It is NOT needed for an entry-level interview.\nHowever, by studying these, you'll get greater exposure to more CS concepts and will be better prepared for\nany software engineering job. You'll be a much more well-rounded software engineer.\n\n*****************************************************************************************************\n*****************************************************************************************************\"\u003e\u003cpre class=\"notranslate\"\u003e\u003ccode\u003e*****************************************************************************************************\n*****************************************************************************************************\n\nEverything below this point is optional. It is NOT needed for an entry-level interview.\nHowever, by studying these, you'll get greater exposure to more CS concepts and will be better prepared for\nany software engineering job. You'll be a much more well-rounded software engineer.\n\n*****************************************************************************************************\n*****************************************************************************************************\n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003chr\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eAdditional Books\u003c/h2\u003e\u003ca id=\"user-content-additional-books\" class=\"anchor\" aria-label=\"Permalink: Additional Books\" href=\"#additional-books\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cdiv class=\"snippet-clipboard-content notranslate position-relative overflow-auto\" data-snippet-clipboard-copy-content=\"These are here so you can dive into a topic you find interesting.\"\u003e\u003cpre class=\"notranslate\"\u003e\u003ccode\u003eThese are here so you can dive into a topic you find interesting.\n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/dp/013937681X\" rel=\"nofollow\"\u003eThe Unix Programming Environment\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAn oldie but a goodie\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/dp/1593273894/\" rel=\"nofollow\"\u003eThe Linux Command Line: A Complete Introduction\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eA modern option\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/TCP/IP_Illustrated\" rel=\"nofollow\"\u003eTCP/IP Illustrated Series\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/gp/product/0596007124/\" rel=\"nofollow\"\u003eHead First Design Patterns\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eA gentle introduction to design patterns\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Design-Patterns-Elements-Reusable-Object-Oriented/dp/0201633612\" rel=\"nofollow\"\u003eDesign Patterns: Elements of Reusable Object-Oriented Software\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAKA the \"Gang Of Four\" book or GOF\u003c/li\u003e\n\u003cli\u003eThe canonical design patterns book\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202\" rel=\"nofollow\"\u003eAlgorithm Design Manual\u003c/a\u003e (Skiena)\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAs a review and problem-recognition\u003c/li\u003e\n\u003cli\u003eThe algorithm catalog portion is well beyond the scope of difficulty you'll get in an interview\u003c/li\u003e\n\u003cli\u003eThis book has 2 parts:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eClass textbook on data structures and algorithms\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ePros:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eIs a good review as any algorithms textbook would be\u003c/li\u003e\n\u003cli\u003eNice stories from his experiences solving problems in industry and academia\u003c/li\u003e\n\u003cli\u003eCode examples in C\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eCons:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eCan be as dense or impenetrable as CLRS, and in some cases, CLRS may be a better alternative for some subjects\u003c/li\u003e\n\u003cli\u003eChapters 7, 8, and 9 can be painful to try to follow, as some items are not explained well or require more brain than I have\u003c/li\u003e\n\u003cli\u003eDon't get me wrong: I like Skiena, his teaching style, and mannerisms, but I may not be Stony Brook material\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eAlgorithm catalog:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThis is the real reason you buy this book.\u003c/li\u003e\n\u003cli\u003eThis book is better as an algorithm reference, and not something you read cover to cover.\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eCan rent it on Kindle\u003c/li\u003e\n\u003cli\u003eAnswers:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://web.archive.org/web/20150404194210/http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition)\" rel=\"nofollow\"\u003eSolutions\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata\" rel=\"nofollow\"\u003eErrata\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://jeffe.cs.illinois.edu/teaching/algorithms/\" rel=\"nofollow\"\u003eAlgorithm\u003c/a\u003e (Jeff Erickson)\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Write-Great-Code-Understanding-Machine/dp/1593270038\" rel=\"nofollow\"\u003eWrite Great Code: Volume 1: Understanding the Machine\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThe book was published in 2004, and is somewhat outdated, but it's a terrific resource for understanding a computer in brief\u003c/li\u003e\n\u003cli\u003eThe author invented \u003ca href=\"https://en.wikipedia.org/wiki/High_Level_Assembly\" rel=\"nofollow\"\u003eHLA\u003c/a\u003e, so take mentions and examples in HLA with a grain of salt. Not widely used, but decent examples of what assembly looks like\u003c/li\u003e\n\u003cli\u003eThese chapters are worth the read to give you a nice foundation:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eChapter 2 - Numeric Representation\u003c/li\u003e\n\u003cli\u003eChapter 3 - Binary Arithmetic and Bit Operations\u003c/li\u003e\n\u003cli\u003eChapter 4 - Floating-Point Representation\u003c/li\u003e\n\u003cli\u003eChapter 5 - Character Representation\u003c/li\u003e\n\u003cli\u003eChapter 6 - Memory Organization and Access\u003c/li\u003e\n\u003cli\u003eChapter 7 - Composite Data Types and Memory Objects\u003c/li\u003e\n\u003cli\u003eChapter 9 - CPU Architecture\u003c/li\u003e\n\u003cli\u003eChapter 10 - Instruction Set Architecture\u003c/li\u003e\n\u003cli\u003eChapter 11 - Memory Architecture and Organization\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/Introduction-Algorithms-fourth-Thomas-Cormen/dp/026204630X\" rel=\"nofollow\"\u003eIntroduction to Algorithms\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003cstrong\u003eImportant:\u003c/strong\u003e Reading this book will only have limited value. This book is a great review of algorithms and data structures, but won't teach you how to write good code. You have to be able to code a decent solution efficiently\u003c/li\u003e\n\u003cli\u003eAKA CLR, sometimes CLRS, because Stein was late to the game\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.amazon.com/dp/0128119055\" rel=\"nofollow\"\u003eComputer Architecture, Sixth Edition: A Quantitative Approach\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eFor a richer, more up-to-date (2017), but longer treatment\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eSystem Design, Scalability, Data Handling\u003c/h2\u003e\u003ca id=\"user-content-system-design-scalability-data-handling\" class=\"anchor\" aria-label=\"Permalink: System Design, Scalability, Data Handling\" href=\"#system-design-scalability-data-handling\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eYou can expect system design questions if you have 4+ years of experience.\u003c/strong\u003e\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eScalability and System Design are very large topics with many topics and resources, since\nthere is a lot to consider when designing a software/hardware system that can scale.\nExpect to spend quite a bit of time on this\u003c/li\u003e\n\u003cli\u003eConsiderations:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eScalability\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eDistill large data sets to single values\u003c/li\u003e\n\u003cli\u003eTransform one data set to another\u003c/li\u003e\n\u003cli\u003eHandling obscenely large amounts of data\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eSystem design\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003efeatures sets\u003c/li\u003e\n\u003cli\u003einterfaces\u003c/li\u003e\n\u003cli\u003eclass hierarchies\u003c/li\u003e\n\u003cli\u003edesigning a system under certain constraints\u003c/li\u003e\n\u003cli\u003esimplicity and robustness\u003c/li\u003e\n\u003cli\u003etradeoffs\u003c/li\u003e\n\u003cli\u003eperformance analysis and optimization\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003cstrong\u003eSTART HERE\u003c/strong\u003e: \u003ca href=\"https://github.com/donnemartin/system-design-primer\"\u003eThe System Design Primer\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.hiredintech.com/system-design/\" rel=\"nofollow\"\u003eSystem Design from HiredInTech\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.quora.com/How-do-I-prepare-to-answer-design-questions-in-a-technical-interview?redirected_qid=1500023\" rel=\"nofollow\"\u003eHow Do I Prepare To Answer Design Questions In A Technical Interview?\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://javascript.plainenglish.io/8-steps-guide-to-ace-a-system-design-interview-7a5a797f4d7d\" rel=\"nofollow\"\u003e8 steps guide to ace your system design interview\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=UrYLYV7WSHM\" rel=\"nofollow\"\u003eDatabase Normalization - 1NF, 2NF, 3NF and 4NF (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://github.com/checkcheckzz/system-design-interview\"\u003eSystem Design Interview\u003c/a\u003e - There are a lot of resources in this one. Look through the articles and examples. I put some of them below\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://web.archive.org/web/20120716060051/http://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/\" rel=\"nofollow\"\u003eHow to ace a systems design interview\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://everythingisdata.wordpress.com/2009/10/17/numbers-everyone-should-know/\" rel=\"nofollow\"\u003eNumbers Everyone Should Know\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://blog.tsunanet.net/2010/11/how-long-does-it-take-to-make-context.html\" rel=\"nofollow\"\u003eHow long does it take to make a context switch?\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=srOgpXECblk\" rel=\"nofollow\"\u003eTransactions Across Datacenters (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://ksat.me/a-plain-english-introduction-to-cap-theorem\" rel=\"nofollow\"\u003eA plain English introduction to CAP Theorem\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=cQP8WApzIQQ\u0026amp;list=PLrw6a1wE39_tb2fErI4-WkMbsvGQk9_UB\" rel=\"nofollow\"\u003eMIT 6.824: Distributed Systems, Spring 2020 (20 videos)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Consensus Algorithms:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Paxos - \u003ca href=\"https://www.youtube.com/watch?v=s8JqcZtvnsM\" rel=\"nofollow\"\u003ePaxos Agreement - Computerphile (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Raft - \u003ca href=\"https://www.youtube.com/watch?v=P9Ydif5_qvE\" rel=\"nofollow\"\u003eAn Introduction to the Raft Distributed Consensus Algorithm (video)\u003c/a\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://raft.github.io/\" rel=\"nofollow\"\u003eEasy-to-read paper\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://thesecretlivesofdata.com/raft/\" rel=\"nofollow\"\u003eInfographic\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.tom-e-white.com/2007/11/consistent-hashing.html\" rel=\"nofollow\"\u003eConsistent Hashing\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://horicky.blogspot.com/2009/11/nosql-patterns.html\" rel=\"nofollow\"\u003eNoSQL Patterns\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Scalability:\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli\u003eYou don't need all of these. Just pick a few that interest you.\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=-W9F__D3oY4\" rel=\"nofollow\"\u003eGreat overview (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Short series:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones\" rel=\"nofollow\"\u003eClones\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database\" rel=\"nofollow\"\u003eDatabase\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache\" rel=\"nofollow\"\u003eCache\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism\" rel=\"nofollow\"\u003eAsynchronism\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://www.aosabook.org/en/distsys.html\" rel=\"nofollow\"\u003eScalable Web Architecture and Distributed Systems\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://pages.cs.wisc.edu/~zuyu/files/fallacies.pdf\" rel=\"nofollow\"\u003eFallacies of Distributed Computing Explained\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=modXC5IWTJI\" rel=\"nofollow\"\u003eJeff Dean - Building Software Systems At Google and Lessons Learned (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://lethain.com/introduction-to-architecting-systems-for-scale/\" rel=\"nofollow\"\u003eIntroduction to Architecting Systems for Scale\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=9nWyWwY2Onc\" rel=\"nofollow\"\u003eScaling mobile games to a global audience using App Engine and Cloud Datastore (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=H4vMcD7zKM0\" rel=\"nofollow\"\u003eHow Google Does Planet-Scale Engineering for Planet-Scale Infra (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.topcoder.com/thrive/articles/The%20Importance%20of%20Algorithms\" rel=\"nofollow\"\u003eThe Importance of Algorithms\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2009/8/6/an-unorthodox-approach-to-database-design-the-coming-of-the.html\" rel=\"nofollow\"\u003eSharding\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=p0jGmgIrf_M\u0026amp;list=PLRXxvay_m8gqVlExPC5DG3TGWJTaBgqSA\u0026amp;index=4\" rel=\"nofollow\"\u003eEngineering for the Long Game - Astrid Atkinson Keynote(video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2012/3/26/7-years-of-youtube-scalability-lessons-in-30-minutes.html\" rel=\"nofollow\"\u003e7 Years Of YouTube Scalability Lessons In 30 Minutes\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=G-lGCC4KKok\" rel=\"nofollow\"\u003evideo\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/8/15/how-paypal-scaled-to-billions-of-transactions-daily-using-ju.html\" rel=\"nofollow\"\u003eHow PayPal Scaled To Billions Of Transactions Daily Using Just 8VMs\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://blog.clevertap.com/how-to-remove-duplicates-in-large-datasets/\" rel=\"nofollow\"\u003eHow to Remove Duplicates in Large Datasets\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=3vV4YiqKm1o\" rel=\"nofollow\"\u003eA look inside Etsy's scale and engineering culture with Jon Cowie (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://thenewstack.io/led-amazon-microservices-architecture/\" rel=\"nofollow\"\u003eWhat Led Amazon to its Own Microservices Architecture\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://eng.uber.com/trip-data-squeeze/\" rel=\"nofollow\"\u003eTo Compress Or Not To Compress, That Was Uber's Question\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/2/25/when-should-approximate-query-processing-be-used.html\" rel=\"nofollow\"\u003eWhen Should Approximate Query Processing Be Used?\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/2/23/googles-transition-from-single-datacenter-to-failover-to-a-n.html\" rel=\"nofollow\"\u003eGoogle's Transition From Single Datacenter To Failover, To A Native Multihomed Architecture\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/6/15/the-image-optimization-technology-that-serves-millions-of-re.html\" rel=\"nofollow\"\u003eThe Image Optimization Technology That Serves Millions Of Requests Per Day\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/2/1/a-patreon-architecture-short.html\" rel=\"nofollow\"\u003eA Patreon Architecture Short\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/1/27/tinder-how-does-one-of-the-largest-recommendation-engines-de.html\" rel=\"nofollow\"\u003eTinder: How Does One Of The Largest Recommendation Engines Decide Who You'll See Next?\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/1/25/design-of-a-modern-cache.html\" rel=\"nofollow\"\u003eDesign Of A Modern Cache\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/1/13/live-video-streaming-at-facebook-scale.html\" rel=\"nofollow\"\u003eLive Video Streaming At Facebook Scale\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2016/1/11/a-beginners-guide-to-scaling-to-11-million-users-on-amazons.html\" rel=\"nofollow\"\u003eA Beginner's Guide To Scaling To 11 Million+ Users On Amazon's AWS\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2015/11/9/a-360-degree-view-of-the-entire-netflix-stack.html\" rel=\"nofollow\"\u003eA 360 Degree View Of The Entire Netflix Stack\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/latency-everywhere-and-it-costs-you-sales-how-crush-it\" rel=\"nofollow\"\u003eLatency Is Everywhere And It Costs You Sales - How To Crush It\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://instagram-engineering.tumblr.com/post/13649370142/what-powers-instagram-hundreds-of-instances\" rel=\"nofollow\"\u003eWhat Powers Instagram: Hundreds of Instances, Dozens of Technologies\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html\" rel=\"nofollow\"\u003eSalesforce Architecture - How They Handle 1.3 Billion Transactions A Day\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html\" rel=\"nofollow\"\u003eESPN's Architecture At Scale - Operating At 100,000 Duh Nuh Nuhs Per Second\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e See \"Messaging, Serialization, and Queueing Systems\" way below for info on some of the technologies that can glue services together\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Twitter:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=5cKTP36HVgI\" rel=\"nofollow\"\u003eO'Reilly MySQL CE 2011: Jeremy Cole, \"Big and Small Data at @Twitter\" (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.infoq.com/presentations/Twitter-Timeline-Scalability\" rel=\"nofollow\"\u003eTimelines at Scale\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eFor even more, see the \"Mining Massive Datasets\" video series in the \u003ca href=\"#video-series\"\u003eVideo Series\u003c/a\u003e section\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ereview: \u003ca href=\"https://github.com/donnemartin/system-design-primer\"\u003eThe System Design Primer\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.hiredintech.com/system-design/\" rel=\"nofollow\"\u003eSystem Design from HiredInTech\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf\"\u003echeat sheet\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eflow:\n\u003col dir=\"auto\"\u003e\n\u003cli\u003eUnderstand the problem and scope:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eDefine the use cases, with the interviewer's help\u003c/li\u003e\n\u003cli\u003eSuggest additional features\u003c/li\u003e\n\u003cli\u003eRemove items that the interviewer deems out of scope\u003c/li\u003e\n\u003cli\u003eAssume high availability is required, add as a use case\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eThink about constraints:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAsk how many requests per month\u003c/li\u003e\n\u003cli\u003eAsk how many requests per second (they may volunteer it or make you do the math)\u003c/li\u003e\n\u003cli\u003eEstimate reads vs. writes percentage\u003c/li\u003e\n\u003cli\u003eKeep the 80/20 rule in mind when estimating\u003c/li\u003e\n\u003cli\u003eHow much data is written per second\u003c/li\u003e\n\u003cli\u003eTotal storage required over 5 years\u003c/li\u003e\n\u003cli\u003eHow much data read per second\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eAbstract design:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eLayers (service, data, caching)\u003c/li\u003e\n\u003cli\u003eInfrastructure: load balancing, messaging\u003c/li\u003e\n\u003cli\u003eRough overview of any key algorithm that drives the service\u003c/li\u003e\n\u003cli\u003eConsider bottlenecks and determine solutions\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ol\u003e\n\u003c/li\u003e\n\u003cli\u003eExercises:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://blog.twitter.com/2010/announcing-snowflake\" rel=\"nofollow\"\u003eDesign a random unique ID generation system\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.slideshare.net/dvirsky/introduction-to-redis\" rel=\"nofollow\"\u003eDesign a key-value database\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html\" rel=\"nofollow\"\u003eDesign a picture sharing system\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://ijcai13.org/files/tutorial_slides/td3.pdf\" rel=\"nofollow\"\u003eDesign a recommendation system\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.hiredintech.com/system-design/the-system-design-process/\" rel=\"nofollow\"\u003eDesign a URL-shortener system: copied from above\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://web.archive.org/web/20220217064329/https://adayinthelifeof.nl/2011/02/06/memcache-internals/\" rel=\"nofollow\"\u003eDesign a cache system\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eAdditional Learning\u003c/h2\u003e\u003ca id=\"user-content-additional-learning\" class=\"anchor\" aria-label=\"Permalink: Additional Learning\" href=\"#additional-learning\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cdiv class=\"snippet-clipboard-content notranslate position-relative overflow-auto\" data-snippet-clipboard-copy-content=\"I added them to help you become a well-rounded software engineer and to be aware of certain\ntechnologies and algorithms, so you'll have a bigger toolbox.\"\u003e\u003cpre class=\"notranslate\"\u003e\u003ccode\u003eI added them to help you become a well-rounded software engineer and to be aware of certain\ntechnologies and algorithms, so you'll have a bigger toolbox.\n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCompilers\u003c/h3\u003e\u003ca id=\"user-content-compilers\" class=\"anchor\" aria-label=\"Permalink: Compilers\" href=\"#compilers\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=IhC7sdYe-Jg\" rel=\"nofollow\"\u003eHow a Compiler Works in ~1 minute (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=CSZLNYF4Klo\" rel=\"nofollow\"\u003eHarvard CS50 - Compilers (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=twodd1KFfGk\" rel=\"nofollow\"\u003eC++ (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=FnGCDLhaxKU\" rel=\"nofollow\"\u003eUnderstanding Compiler Optimization (C++) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eEmacs and vi(m)\u003c/h3\u003e\u003ca id=\"user-content-emacs-and-vim\" class=\"anchor\" aria-label=\"Permalink: Emacs and vi(m)\" href=\"#emacs-and-vim\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eFamiliarize yourself with a UNIX-based code editor\u003c/li\u003e\n\u003cli\u003evi(m):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=5givLEMcINQ\u0026amp;index=1\u0026amp;list=PL13bz4SHGmRxlZVmWQ9DvXo1fEg4UdGkr\" rel=\"nofollow\"\u003eEditing With Vim 01 - Installation, Setup, and The Modes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://vim-adventures.com/\" rel=\"nofollow\"\u003eVIM Adventures\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eset of 4 videos:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=SI8TeVMX8pk\" rel=\"nofollow\"\u003eThe vi/vim editor - Lesson 1\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=F3OO7ZIOaJE\" rel=\"nofollow\"\u003eThe vi/vim editor - Lesson 2\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=ZYEccA_nMaI\" rel=\"nofollow\"\u003eThe vi/vim editor - Lesson 3\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=1lYD5gwgZIA\" rel=\"nofollow\"\u003eThe vi/vim editor - Lesson 4\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Using_Vi_instead_of_Emacs\" rel=\"nofollow\"\u003eUsing Vi Instead of Emacs\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eemacs:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=hbmV1bnQ-i0\" rel=\"nofollow\"\u003eBasics Emacs Tutorial (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eset of 3 (videos):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=ujODL7MD04Q\" rel=\"nofollow\"\u003eEmacs Tutorial (Beginners) -Part 1- File commands, cut/copy/paste, cursor commands\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=XWpsRupJ4II\" rel=\"nofollow\"\u003eEmacs Tutorial (Beginners) -Part 2- Buffer management, search, M-x grep and rgrep modes\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=paSgzPso-yc\" rel=\"nofollow\"\u003eEmacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file, and packages\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=JWD1Fpdd4Pc\" rel=\"nofollow\"\u003eEvil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs\" rel=\"nofollow\"\u003eWriting C Programs With Emacs\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=48JlgiBpw_I\u0026amp;t=0s\" rel=\"nofollow\"\u003eThe Absolute Beginner's Guide to Emacs (video by David Wilson)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://systemcrafters.net/emacs-essentials/absolute-beginners-guide-to-emacs/\" rel=\"nofollow\"\u003eThe Absolute Beginner's Guide to Emacs (notes by David Wilson)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eUnix/Linux command line tools\u003c/h3\u003e\u003ca id=\"user-content-unixlinux-command-line-tools\" class=\"anchor\" aria-label=\"Permalink: Unix/Linux command line tools\" href=\"#unixlinux-command-line-tools\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eI filled in the list below from good tools.\u003c/li\u003e\n\u003cli\u003ebash\u003c/li\u003e\n\u003cli\u003ecat\u003c/li\u003e\n\u003cli\u003egrep\u003c/li\u003e\n\u003cli\u003esed\u003c/li\u003e\n\u003cli\u003eawk\u003c/li\u003e\n\u003cli\u003ecurl or wget\u003c/li\u003e\n\u003cli\u003esort\u003c/li\u003e\n\u003cli\u003etr\u003c/li\u003e\n\u003cli\u003euniq\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Strace\" rel=\"nofollow\"\u003estrace\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://danielmiessler.com/study/tcpdump/\" rel=\"nofollow\"\u003etcpdump\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://labex.io/tutorials/practice-linux-commands-hands-on-labs-398420\" rel=\"nofollow\"\u003eEssential Linux Commands Tutorial\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDevOps\u003c/h3\u003e\u003ca id=\"user-content-devops\" class=\"anchor\" aria-label=\"Permalink: DevOps\" href=\"#devops\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://roadmap.sh/devops\" rel=\"nofollow\"\u003eDevOps Roadmap\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eInformation theory (videos)\u003c/h3\u003e\u003ca id=\"user-content-information-theory-videos\" class=\"anchor\" aria-label=\"Permalink: Information theory (videos)\" href=\"#information-theory-videos\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.khanacademy.org/computing/computer-science/informationtheory\" rel=\"nofollow\"\u003eKhan Academy\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eMore about Markov processes:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/waxgx/core-markov-text-generation\" rel=\"nofollow\"\u003eCore Markov Text Generation\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-text-generation\" rel=\"nofollow\"\u003eCore Implementing Markov Text Generation\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-text-generation-walk-through\" rel=\"nofollow\"\u003eProject = Markov Text Generation Walk Through\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eSee more in the MIT 6.050J Information and Entropy series below\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eParity \u0026amp; Hamming Code (videos)\u003c/h3\u003e\u003ca id=\"user-content-parity--hamming-code-videos\" class=\"anchor\" aria-label=\"Permalink: Parity \u0026amp; Hamming Code (videos)\" href=\"#parity--hamming-code-videos\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=q-3BctoUpHE\" rel=\"nofollow\"\u003eIntro\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=DdMcAUlxh1M\" rel=\"nofollow\"\u003eParity\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eHamming Code:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=1A_NcXxdoCc\" rel=\"nofollow\"\u003eError detection\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=JAMLuxdHH8o\" rel=\"nofollow\"\u003eError correction\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=wbH2VxzmoZk\" rel=\"nofollow\"\u003eError Checking\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eEntropy\u003c/h3\u003e\u003ca id=\"user-content-entropy\" class=\"anchor\" aria-label=\"Permalink: Entropy\" href=\"#entropy\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAlso see the videos below\u003c/li\u003e\n\u003cli\u003eMake sure to watch information theory videos first\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://youtu.be/JnJq3Py0dyM?t=176\" rel=\"nofollow\"\u003eInformation Theory, Claude Shannon, Entropy, Redundancy, Data Compression \u0026amp; Bits (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCryptography\u003c/h3\u003e\u003ca id=\"user-content-cryptography\" class=\"anchor\" aria-label=\"Permalink: Cryptography\" href=\"#cryptography\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eAlso see the videos below\u003c/li\u003e\n\u003cli\u003eMake sure to watch information theory videos first\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.khanacademy.org/computing/computer-science/cryptography\" rel=\"nofollow\"\u003eKhan Academy Series\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=KqqOXndnvic\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=30\" rel=\"nofollow\"\u003eCryptography: Hash Functions\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=9TNI2wHmaeI\u0026amp;index=31\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003eCryptography: Encryption\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eCompression\u003c/h3\u003e\u003ca id=\"user-content-compression\" class=\"anchor\" aria-label=\"Permalink: Compression\" href=\"#compression\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eMake sure to watch information theory videos first\u003c/li\u003e\n\u003cli\u003eComputerphile (videos):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=Lto-ajuqW3w\" rel=\"nofollow\"\u003eCompression\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=M5c_RFKVkko\" rel=\"nofollow\"\u003eEntropy in Compression\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=umTbivyJoiI\" rel=\"nofollow\"\u003eUpside Down Trees (Huffman Trees)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=DV8efuB3h2g\" rel=\"nofollow\"\u003eEXTRA BITS/TRITS - Huffman Trees\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=goOa3DGezUA\" rel=\"nofollow\"\u003eElegant Compression in Text (The LZ 77 Method)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=cCDCfoHTsaU\" rel=\"nofollow\"\u003eText Compression Meets Probabilities\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H\" rel=\"nofollow\"\u003eCompressor Head videos\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=whGwm0Lky2s\" rel=\"nofollow\"\u003e(optional) Google Developers Live: GZIP is not enough!\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eComputer Security\u003c/h3\u003e\u003ca id=\"user-content-computer-security\" class=\"anchor\" aria-label=\"Permalink: Computer Security\" href=\"#computer-security\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eMIT (23 videos)\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=GqmQg-cszw4\u0026amp;index=1\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eIntroduction, Threat Models\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=6bwzNg5qQ0o\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\u0026amp;index=2\" rel=\"nofollow\"\u003eControl Hijacking Attacks\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=drQyrzRoRiA\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\u0026amp;index=3\" rel=\"nofollow\"\u003eBuffer Overflow Exploits and Defenses\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=6SIJmoE9L9g\u0026amp;index=4\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003ePrivilege Separation\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=8VqTSY-11F4\u0026amp;index=5\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eCapabilities\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=VEV74hwASeU\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\u0026amp;index=6\" rel=\"nofollow\"\u003eSandboxing Native Code\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=chkFBigodIw\u0026amp;index=7\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eWeb Security Model\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=EBQIGy1ROLY\u0026amp;index=8\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eSecuring Web Applications\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=yRVZPvHYHzw\u0026amp;index=9\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eSymbolic Execution\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=SIEVvk3NVuk\u0026amp;index=11\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eNetwork Security\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=QOtA76ga_fY\u0026amp;index=12\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eNetwork Protocols\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=PuVMkSEcPiI\u0026amp;index=15\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eSide-Channel Attacks\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eGarbage collection\u003c/h3\u003e\u003ca id=\"user-content-garbage-collection\" class=\"anchor\" aria-label=\"Permalink: Garbage collection\" href=\"#garbage-collection\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=iHVs_HkjdmI\" rel=\"nofollow\"\u003eGC in Python (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.infoq.com/presentations/garbage-collection-benefits\" rel=\"nofollow\"\u003eDeep Dive Java: Garbage Collection is Good!\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=P-8Z0-MhdQs\u0026amp;list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR\u0026amp;index=3\" rel=\"nofollow\"\u003eDeep Dive Python: Garbage Collection in CPython (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eParallel Programming\u003c/h3\u003e\u003ca id=\"user-content-parallel-programming\" class=\"anchor\" aria-label=\"Permalink: Parallel Programming\" href=\"#parallel-programming\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/parprog1/home/week/1\" rel=\"nofollow\"\u003eCoursera (Scala)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=uY85GkaYzBk\" rel=\"nofollow\"\u003eEfficient Python for High-Performance Parallel Computing (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eMessaging, Serialization, and Queueing Systems\u003c/h3\u003e\u003ca id=\"user-content-messaging-serialization-and-queueing-systems\" class=\"anchor\" aria-label=\"Permalink: Messaging, Serialization, and Queueing Systems\" href=\"#messaging-serialization-and-queueing-systems\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://thrift.apache.org/\" rel=\"nofollow\"\u003eThrift\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://thrift-tutorial.readthedocs.io/en/latest/intro.html\" rel=\"nofollow\"\u003eTutorial\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://developers.google.com/protocol-buffers/\" rel=\"nofollow\"\u003eProtocol Buffers\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://developers.google.com/protocol-buffers/docs/tutorials\" rel=\"nofollow\"\u003eTutorials\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.grpc.io/\" rel=\"nofollow\"\u003egRPC\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=5tmPvSe7xXQ\u0026amp;list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJoly\u0026amp;index=1\" rel=\"nofollow\"\u003egRPC 101 for Java Developers (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://redis.io/\" rel=\"nofollow\"\u003eRedis\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://try.redis.io/\" rel=\"nofollow\"\u003eTutorial\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://aws.amazon.com/sqs/\" rel=\"nofollow\"\u003eAmazon SQS (queue)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://aws.amazon.com/sns/\" rel=\"nofollow\"\u003eAmazon SNS (pub-sub)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.rabbitmq.com/\" rel=\"nofollow\"\u003eRabbitMQ\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.rabbitmq.com/getstarted.html\" rel=\"nofollow\"\u003eGet Started\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.celeryproject.org/\" rel=\"nofollow\"\u003eCelery\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://docs.celeryproject.org/en/latest/getting-started/first-steps-with-celery.html\" rel=\"nofollow\"\u003eFirst Steps With Celery\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://zeromq.org/\" rel=\"nofollow\"\u003eZeroMQ\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://zeromq.org/intro:read-the-manual\" rel=\"nofollow\"\u003eIntro - Read The Manual\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://activemq.apache.org/\" rel=\"nofollow\"\u003eActiveMQ\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://kafka.apache.org/documentation.html#introduction\" rel=\"nofollow\"\u003eKafka\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://msgpack.org/index.html\" rel=\"nofollow\"\u003eMessagePack\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://avro.apache.org/\" rel=\"nofollow\"\u003eAvro\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eA*\u003c/h3\u003e\u003ca id=\"user-content-a\" class=\"anchor\" aria-label=\"Permalink: A*\" href=\"#a\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/A*_search_algorithm\" rel=\"nofollow\"\u003eA Search Algorithm\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=-L-WgKMFuhE\" rel=\"nofollow\"\u003eA* Pathfinding (E01: algorithm explanation) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eFast Fourier Transform\u003c/h3\u003e\u003ca id=\"user-content-fast-fourier-transform\" class=\"anchor\" aria-label=\"Permalink: Fast Fourier Transform\" href=\"#fast-fourier-transform\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/\" rel=\"nofollow\"\u003eAn Interactive Guide To The Fourier Transform\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/\" rel=\"nofollow\"\u003eWhat is a Fourier transform? What is it used for?\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=Xxut2PN-V8Q\" rel=\"nofollow\"\u003eWhat is the Fourier Transform? (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=iTMn0Kt18tg\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=4\" rel=\"nofollow\"\u003eDivide \u0026amp; Conquer: FFT (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/\" rel=\"nofollow\"\u003eUnderstanding The FFT\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBloom Filter\u003c/h3\u003e\u003ca id=\"user-content-bloom-filter\" class=\"anchor\" aria-label=\"Permalink: Bloom Filter\" href=\"#bloom-filter\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGiven a Bloom filter with m bits and k hashing functions, both insertion and membership testing are O(k)\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=-SuTGoFYjZs\" rel=\"nofollow\"\u003eBloom Filters (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=qBTdukbzc78\" rel=\"nofollow\"\u003eBloom Filters | Mining of Massive Datasets | Stanford University (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://billmill.org/bloomfilter-tutorial/\" rel=\"nofollow\"\u003eTutorial\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/\" rel=\"nofollow\"\u003eHow To Write A Bloom Filter App\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eHyperLogLog\u003c/h3\u003e\u003ca id=\"user-content-hyperloglog\" class=\"anchor\" aria-label=\"Permalink: HyperLogLog\" href=\"#hyperloglog\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html\" rel=\"nofollow\"\u003eHow To Count A Billion Distinct Objects Using Only 1.5KB Of Memory\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eLocality-Sensitive Hashing\u003c/h3\u003e\u003ca id=\"user-content-locality-sensitive-hashing\" class=\"anchor\" aria-label=\"Permalink: Locality-Sensitive Hashing\" href=\"#locality-sensitive-hashing\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eUsed to determine the similarity of documents\u003c/li\u003e\n\u003cli\u003eThe opposite of MD5 or SHA which are used to determine if 2 documents/strings are exactly the same\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://ferd.ca/simhashing-hopefully-made-simple.html\" rel=\"nofollow\"\u003eSimhashing (hopefully) made simple\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003evan Emde Boas Trees\u003c/h3\u003e\u003ca id=\"user-content-van-emde-boas-trees\" class=\"anchor\" aria-label=\"Permalink: van Emde Boas Trees\" href=\"#van-emde-boas-trees\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=hmReJCupbNU\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=6\" rel=\"nofollow\"\u003eDivide \u0026amp; Conquer: van Emde Boas Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec15.pdf\" rel=\"nofollow\"\u003eMIT Lecture Notes\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eAugmented Data Structures\u003c/h3\u003e\u003ca id=\"user-content-augmented-data-structures\" class=\"anchor\" aria-label=\"Permalink: Augmented Data Structures\" href=\"#augmented-data-structures\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://archive.org/details/ucberkeley_webcast_zksIj9O8_jc\" rel=\"nofollow\"\u003eCS 61B Lecture 39: Augmenting Data Structures\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eBalanced search trees\u003c/h3\u003e\u003ca id=\"user-content-balanced-search-trees\" class=\"anchor\" aria-label=\"Permalink: Balanced search trees\" href=\"#balanced-search-trees\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eKnow at least one type of balanced binary tree (and know how it's implemented):\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\"Among balanced search trees, AVL and 2/3 trees are now passé and red-black trees seem to be more popular.\nA particularly interesting self-organizing data structure is the splay tree, which uses rotations\nto move any accessed key to the root.\" - Skiena\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eOf these, I chose to implement a splay tree. From what I've read, you won't implement a\nbalanced search tree in your interview. But I wanted exposure to coding one up\nand let's face it, splay trees are the bee's knees. I did read a lot of red-black tree code\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eSplay tree: insert, search, delete functions\nIf you end up implementing a red/black tree try just these:\u003c/li\u003e\n\u003cli\u003eSearch and insertion functions, skipping delete\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eI want to learn more about B-Tree since it's used so widely with very large data sets\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree\" rel=\"nofollow\"\u003eSelf-balancing binary search tree\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eAVL trees\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eIn practice:\nFrom what I can tell, these aren't used much in practice, but I could see where they would be:\nThe AVL tree is another structure supporting O(log n) search, insertion, and removal. It is more rigidly\nbalanced than red–black trees, leading to slower insertion and removal but faster retrieval. This makes it\nattractive for data structures that may be built once and loaded without reconstruction, such as language\ndictionaries (or program dictionaries, such as the opcodes of an assembler or interpreter)\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=FNeL18KsWPc\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;index=6\" rel=\"nofollow\"\u003eMIT AVL Trees / AVL Sort (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees\" rel=\"nofollow\"\u003eAVL Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation\" rel=\"nofollow\"\u003eAVL Tree Implementation (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge\" rel=\"nofollow\"\u003eSplit And Merge\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-\" rel=\"nofollow\"\u003e[Review] AVL Trees (playlist) in 19 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eSplay trees\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eIn practice:\nSplay trees are typically used in the implementation of caches, memory allocators, routers, garbage collectors,\ndata compression, ropes (replacement of string used for long text strings), in Windows NT (in the virtual memory,\nnetworking and file system code) etc\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://archive.org/details/ucberkeley_webcast_G5QIXywcJlY\" rel=\"nofollow\"\u003eCS 61B: Splay Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eMIT Lecture: Splay Trees:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGets very mathy, but watch the last 10 minutes for sure.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=QnPl_Y6EqMo\" rel=\"nofollow\"\u003eVideo\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eRed/black trees\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThese are a translation of a 2-3 tree (see below).\u003c/li\u003e\n\u003cli\u003eIn practice:\nRed–black trees offer worst-case guarantees for insertion time, deletion time, and search time.\nNot only does this make them valuable in time-sensitive applications such as real-time applications,\nbut it makes them valuable building blocks in other data structures that provide worst-case guarantees;\nfor example, many data structures used in computational geometry can be based on red-black trees, and\nthe Completely Fair Scheduler used in current Linux kernels uses red–black trees. In version 8 of Java,\nthe Collection HashMap has been modified such that instead of using a LinkedList to store identical elements with poor\nhashcodes, a Red-Black tree is used\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;t=3871\" rel=\"nofollow\"\u003eAduni - Algorithms - Lecture 4 (link jumps to the starting point) (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=hm2GHwyKF1o\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=5\" rel=\"nofollow\"\u003eAduni - Algorithms - Lecture 5 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Red%E2%80%93black_tree\" rel=\"nofollow\"\u003eRed-Black Tree\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.topcoder.com/thrive/articles/An%20Introduction%20to%20Binary%20Search%20and%20Red-Black%20Trees\" rel=\"nofollow\"\u003eAn Introduction To Binary Search And Red Black Tree\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin\" rel=\"nofollow\"\u003e[Review] Red-Black Trees (playlist) in 30 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e2-3 search trees\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eIn practice:\n2-3 trees have faster inserts at the expense of slower searches (since height is more compared to AVL trees).\u003c/li\u003e\n\u003cli\u003eYou would use 2-3 trees very rarely because its implementation involves different types of nodes. Instead, people use Red-Black trees.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=C3SsdUqasD4\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\u0026amp;index=2\" rel=\"nofollow\"\u003e23-Tree Intuition and Definition (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=iYvBtGKsqSg\u0026amp;index=3\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\" rel=\"nofollow\"\u003eBinary View of 23-Tree\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=TOb1tuEZ2X4\u0026amp;index=5\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003e2-3 Trees (student recitation) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e2-3-4 Trees (aka 2-4 trees)\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eIn practice:\nFor every 2-4 trees, there are corresponding red–black trees with data elements in the same order. The insertion and deletion\noperations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an\nimportant tool for understanding the logic behind red-black trees, and this is why many introductory algorithm texts introduce\n2-4 trees just before red–black trees, even though \u003cstrong\u003e2-4 trees are not often used in practice\u003c/strong\u003e.\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://archive.org/details/ucberkeley_webcast_zqrqYXkth6Q\" rel=\"nofollow\"\u003eCS 61B Lecture 26: Balanced Search Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=DQdMYevEyE4\u0026amp;index=4\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\" rel=\"nofollow\"\u003eBottom Up 234-Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=2679VQ26Fp4\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\u0026amp;index=5\" rel=\"nofollow\"\u003eTop Down 234-Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eN-ary (K-ary, M-ary) trees\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003enote: the N or K is the branching factor (max branches)\u003c/li\u003e\n\u003cli\u003ebinary trees are a 2-ary tree, with branching factor = 2\u003c/li\u003e\n\u003cli\u003e2-3 trees are 3-ary\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/K-ary_tree\" rel=\"nofollow\"\u003eK-Ary Tree\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eB-Trees\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eFun fact: it's a mystery, but the B could stand for Boeing, Balanced, or Bayer (co-inventor).\u003c/li\u003e\n\u003cli\u003eIn Practice:\nB-trees are widely used in databases. Most modern filesystems use B-trees (or Variants). In addition to\nits use in databases, the B-tree is also used in filesystems to allow quick random access to an arbitrary\nblock in a particular file. The basic problem is turning the file block address into a disk block\n(or perhaps to a cylinder head sector) address\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/B-tree\" rel=\"nofollow\"\u003eB-Tree\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://btechsmartclass.com/data_structures/b-trees.html\" rel=\"nofollow\"\u003eB-Tree Datastructure\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=I22wEC1tTGo\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\u0026amp;index=6\" rel=\"nofollow\"\u003eIntroduction to B-Trees (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=s3bCdZGrgpA\u0026amp;index=7\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\" rel=\"nofollow\"\u003eB-Tree Definition and Insertion (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=svfnVhJOfMc\u0026amp;index=8\u0026amp;list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6\" rel=\"nofollow\"\u003eB-Tree Deletion (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=V3omVLzI0WE\u0026amp;index=7\u0026amp;list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf\" rel=\"nofollow\"\u003eMIT 6.851 - Memory Hierarchy Models (video)\u003c/a\u003e\n- covers cache-oblivious B-Trees, very interesting data structures\n- the first 37 minutes are very technical, and may be skipped (B is block size, cache line size)\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz\" rel=\"nofollow\"\u003e[Review] B-Trees (playlist) in 26 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003ek-D Trees\u003c/h3\u003e\u003ca id=\"user-content-k-d-trees\" class=\"anchor\" aria-label=\"Permalink: k-D Trees\" href=\"#k-d-trees\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eGreat for finding a number of points in a rectangle or higher-dimensional object\u003c/li\u003e\n\u003cli\u003eA good fit for k-nearest neighbors\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=Y4ZgLlDfKDg\" rel=\"nofollow\"\u003ekNN K-d tree algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eSkip lists\u003c/h3\u003e\u003ca id=\"user-content-skip-lists\" class=\"anchor\" aria-label=\"Permalink: Skip lists\" href=\"#skip-lists\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\"These are somewhat of a cult data structure\" - Skiena\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=2g9OSRKJuzM\u0026amp;index=10\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003eRandomization: Skip Lists (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Skip_list\" rel=\"nofollow\"\u003eFor animations and a little more detail\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eNetwork Flows\u003c/h3\u003e\u003ca id=\"user-content-network-flows\" class=\"anchor\" aria-label=\"Permalink: Network Flows\" href=\"#network-flows\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=Tl90tNtKvxs\" rel=\"nofollow\"\u003eFord-Fulkerson in 5 minutes — Step by step example (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=v1VgJmkEJW0\" rel=\"nofollow\"\u003eFord-Fulkerson Algorithm (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=2vhN4Ice5jI\" rel=\"nofollow\"\u003eNetwork Flows (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDisjoint Sets \u0026amp; Union Find\u003c/h3\u003e\u003ca id=\"user-content-disjoint-sets--union-find\" class=\"anchor\" aria-label=\"Permalink: Disjoint Sets \u0026amp; Union Find\" href=\"#disjoint-sets--union-find\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://archive.org/details/ucberkeley_webcast_MAEGXTwmUsI\" rel=\"nofollow\"\u003eUCB 61B - Disjoint Sets; Sorting \u0026amp; selection (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/algorithms-part1/home/week/1\" rel=\"nofollow\"\u003eSedgewick Algorithms - Union-Find (6 videos)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eMath for Fast Processing\u003c/h3\u003e\u003ca id=\"user-content-math-for-fast-processing\" class=\"anchor\" aria-label=\"Permalink: Math for Fast Processing\" href=\"#math-for-fast-processing\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=eCaXlAaN2uE\u0026amp;index=11\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\" rel=\"nofollow\"\u003eInteger Arithmetic, Karatsuba Multiplication (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=ru7mWZJlRQg\" rel=\"nofollow\"\u003eThe Chinese Remainder Theorem (used in cryptography) (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eTreap\u003c/h3\u003e\u003ca id=\"user-content-treap\" class=\"anchor\" aria-label=\"Permalink: Treap\" href=\"#treap\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eCombination of a binary search tree and a heap\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Treap\" rel=\"nofollow\"\u003eTreap\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=6podLUYinH8\" rel=\"nofollow\"\u003eData Structures: Treaps explained (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf\" rel=\"nofollow\"\u003eApplications in set operations\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eLinear Programming (videos)\u003c/h3\u003e\u003ca id=\"user-content-linear-programming-videos\" class=\"anchor\" aria-label=\"Permalink: Linear Programming (videos)\" href=\"#linear-programming-videos\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=M4K6HYLHREQ\" rel=\"nofollow\"\u003eLinear Programming\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=2ACJ9ewUC6U\" rel=\"nofollow\"\u003eFinding minimum cost\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=8AA_81xI3ik\" rel=\"nofollow\"\u003eFinding maximum value\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=44pAWI7v5Zk\" rel=\"nofollow\"\u003eSolve Linear Equations with Python - Simplex Algorithm\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eGeometry, Convex hull (videos)\u003c/h3\u003e\u003ca id=\"user-content-geometry-convex-hull-videos\" class=\"anchor\" aria-label=\"Permalink: Geometry, Convex hull (videos)\" href=\"#geometry-convex-hull-videos\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;t=3164\" rel=\"nofollow\"\u003eGraph Alg. IV: Intro to geometric algorithms - Lecture 9\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=J5aJEcOr6Eo\u0026amp;index=10\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\" rel=\"nofollow\"\u003eGeometric Algorithms: Graham \u0026amp; Jarvis - Lecture 10\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=EzeYI7p9MjU\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=2\" rel=\"nofollow\"\u003eDivide \u0026amp; Conquer: Convex Hull, Median Finding\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch3 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eDiscrete math\u003c/h3\u003e\u003ca id=\"user-content-discrete-math\" class=\"anchor\" aria-label=\"Permalink: Discrete math\" href=\"#discrete-math\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://www.infocobuild.com/education/audio-video-courses/computer-science/cs70-spring2015-berkeley.html\" rel=\"nofollow\"\u003eComputer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t\" rel=\"nofollow\"\u003eDiscrete Mathematics by Shai Simonson (19 videos)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://nptel.ac.in/courses/106/106/106106183/\" rel=\"nofollow\"\u003eDiscrete Mathematics By IIT Ropar NPTEL\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003chr\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eAdditional Detail on Some Subjects\u003c/h2\u003e\u003ca id=\"user-content-additional-detail-on-some-subjects\" class=\"anchor\" aria-label=\"Permalink: Additional Detail on Some Subjects\" href=\"#additional-detail-on-some-subjects\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cdiv class=\"snippet-clipboard-content notranslate position-relative overflow-auto\" data-snippet-clipboard-copy-content=\"I added these to reinforce some ideas already presented above, but didn't want to include them\nabove because it's just too much. It's easy to overdo it on a subject.\nYou want to get hired in this century, right?\"\u003e\u003cpre class=\"notranslate\"\u003e\u003ccode\u003eI added these to reinforce some ideas already presented above, but didn't want to include them\nabove because it's just too much. It's easy to overdo it on a subject.\nYou want to get hired in this century, right?\n\u003c/code\u003e\u003c/pre\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eSOLID\u003c/strong\u003e\u003c/p\u003e\n\u003cul class=\"contains-task-list\"\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e \u003ca href=\"https://www.youtube.com/watch?v=TMuno5RZNeE\" rel=\"nofollow\"\u003eBob Martin SOLID Principles of Object Oriented and Agile Design (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e S - \u003ca href=\"http://www.oodesign.com/single-responsibility-principle.html\" rel=\"nofollow\"\u003eSingle Responsibility Principle\u003c/a\u003e | \u003ca href=\"http://www.javacodegeeks.com/2011/11/solid-single-responsibility-principle.html\" rel=\"nofollow\"\u003eSingle responsibility to each Object\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://docs.google.com/open?id=0ByOwmqah_nuGNHEtcU5OekdDMkk\" rel=\"nofollow\"\u003emore flavor\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e O - \u003ca href=\"http://www.oodesign.com/open-close-principle.html\" rel=\"nofollow\"\u003eOpen/Closed Principle\u003c/a\u003e | \u003ca href=\"https://en.wikipedia.org/wiki/Open/closed_principle\" rel=\"nofollow\"\u003eOn production level Objects are ready for extension but not for modification\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://docs.google.com/a/cleancoder.com/viewer?a=v\u0026amp;pid=explorer\u0026amp;chrome=true\u0026amp;srcid=0BwhCYaYDn8EgN2M5MTkwM2EtNWFkZC00ZTI3LWFjZTUtNTFhZGZiYmUzODc1\u0026amp;hl=en\" rel=\"nofollow\"\u003emore flavor\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e L - \u003ca href=\"http://www.oodesign.com/liskov-s-substitution-principle.html\" rel=\"nofollow\"\u003eLiskov Substitution Principle\u003c/a\u003e | \u003ca href=\"http://stackoverflow.com/questions/56860/what-is-the-liskov-substitution-principle\" rel=\"nofollow\"\u003eBase Class and Derived class follow ‘IS A’ Principle\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://docs.google.com/a/cleancoder.com/viewer?a=v\u0026amp;pid=explorer\u0026amp;chrome=true\u0026amp;srcid=0BwhCYaYDn8EgNzAzZjA5ZmItNjU3NS00MzQ5LTkwYjMtMDJhNDU5ZTM0MTlh\u0026amp;hl=en\" rel=\"nofollow\"\u003emore flavor\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e I - \u003ca href=\"http://www.oodesign.com/interface-segregation-principle.html\" rel=\"nofollow\"\u003eInterface segregation principle\u003c/a\u003e | Clients should not be forced to implement interfaces they don't use\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=3CtAfl7aXAQ\" rel=\"nofollow\"\u003eInterface Segregation Principle in 5 minutes (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://docs.google.com/a/cleancoder.com/viewer?a=v\u0026amp;pid=explorer\u0026amp;chrome=true\u0026amp;srcid=0BwhCYaYDn8EgOTViYjJhYzMtMzYxMC00MzFjLWJjMzYtOGJiMDc5N2JkYmJi\u0026amp;hl=en\" rel=\"nofollow\"\u003emore flavor\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli class=\"task-list-item\"\u003e\u003cinput type=\"checkbox\" id=\"\" disabled=\"\" class=\"task-list-item-checkbox\"\u003e D -\u003ca href=\"http://www.oodesign.com/dependency-inversion-principle.html\" rel=\"nofollow\"\u003eDependency Inversion principle\u003c/a\u003e | Reduce the dependency In composition of objects.\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://stackoverflow.com/questions/62539/what-is-the-dependency-inversion-principle-and-why-is-it-important\" rel=\"nofollow\"\u003eWhy Is The Dependency Inversion Principle And Why Is It Important\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://docs.google.com/a/cleancoder.com/viewer?a=v\u0026amp;pid=explorer\u0026amp;chrome=true\u0026amp;srcid=0BwhCYaYDn8EgMjdlMWIzNGUtZTQ0NC00ZjQ5LTkwYzQtZjRhMDRlNTQ3ZGMz\u0026amp;hl=en\" rel=\"nofollow\"\u003emore flavor\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eUnion-Find\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/JssSY/overview\" rel=\"nofollow\"\u003eOverview\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/EM5D0/naive-implementations\" rel=\"nofollow\"\u003eNaive Implementation\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/Mxu0w/trees\" rel=\"nofollow\"\u003eTrees\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/qb4c2/union-by-rank\" rel=\"nofollow\"\u003eUnion By Rank\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/Q9CVI/path-compression\" rel=\"nofollow\"\u003ePath Compression\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/GQQLN/analysis-optional\" rel=\"nofollow\"\u003eAnalysis Options\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eMore Dynamic Programming\u003c/strong\u003e (videos)\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=r4-cftqTcdI\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003e6.006: Dynamic Programming I: Fibonacci, Shortest Paths\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=KLBCUx1is2c\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003e6.006: Dynamic Programming II: Text Justification, Blackjack\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=TDo3r5M1LNo\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003e6.006: DP III: Parenthesization, Edit Distance, Knapsack\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=i9OAOk0CUQE\u0026amp;ab_channel=MITOpenCourseWare\" rel=\"nofollow\"\u003e6.006: DP IV: Guitar Fingering, Tetris, Super Mario Bros.\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=Tw1k46ywN6E\u0026amp;index=14\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003e6.046: Dynamic Programming \u0026amp; Advanced DP\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=NzgFUwOaoIw\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=15\" rel=\"nofollow\"\u003e6.046: Dynamic Programming: All-Pairs Shortest Paths\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=krZI60lKPek\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=12\" rel=\"nofollow\"\u003e6.046: Dynamic Programming (student recitation)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eAdvanced Graph Processing\u003c/strong\u003e (videos)\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=mUBmcbbJNf4\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=27\" rel=\"nofollow\"\u003eSynchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=kQ-UQAzcnzA\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\u0026amp;index=28\" rel=\"nofollow\"\u003eAsynchronous Distributed Algorithms: Shortest-Paths Spanning Trees\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eMIT \u003cstrong\u003eProbability\u003c/strong\u003e (mathy, and go slowly, which is good for mathy things) (videos):\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=SmFwFdESMHI\u0026amp;index=18\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J - Probability Introduction\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=E6FbvM-FGZ8\u0026amp;index=19\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J - Conditional Probability\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=l1BCv3qqW4A\u0026amp;index=20\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J - Independence\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=MOfhhFaQdjw\u0026amp;list=PLB7540DEDD482705B\u0026amp;index=21\" rel=\"nofollow\"\u003eMIT 6.042J - Random Variables\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=gGlMSe7uEkA\u0026amp;index=22\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J - Expectation I\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=oI9fMUqgfxY\u0026amp;index=23\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J - Expectation II\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=q4mwO2qS2z4\u0026amp;index=24\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J - Large Deviations\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=56iFMY8QW2k\u0026amp;list=PLB7540DEDD482705B\u0026amp;index=25\" rel=\"nofollow\"\u003eMIT 6.042J - Random Walks\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=oDniZCmNmNw\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=19\" rel=\"nofollow\"\u003eSimonson: Approximation Algorithms (video)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eString Matching\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eRabin-Karp (videos):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/lecture/data-structures/rabin-karps-algorithm-c0Qkw\" rel=\"nofollow\"\u003eRabin Karps Algorithm\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation\" rel=\"nofollow\"\u003ePrecomputing\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization-implementation-and-analysis\" rel=\"nofollow\"\u003eOptimization: Implementation and Analysis\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=BRO7mVIFt08\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;index=9\" rel=\"nofollow\"\u003eTable Doubling, Karp-Rabin\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=w6nuXg0BISo\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;index=32\" rel=\"nofollow\"\u003eRolling Hashes, Amortized Analysis\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eKnuth-Morris-Pratt (KMP):\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=5i7oKodCRJo\" rel=\"nofollow\"\u003eTThe Knuth-Morris-Pratt (KMP) String Matching Algorithm\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eBoyer–Moore string search algorithm\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm\" rel=\"nofollow\"\u003eBoyer-Moore String Search Algorithm\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=QDZpzctPf10\" rel=\"nofollow\"\u003eAdvanced String Searching Boyer-Moore-Horspool Algorithms (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.coursera.org/learn/algorithms-on-strings/home/week/1\" rel=\"nofollow\"\u003eCoursera: Algorithms on Strings\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003estarts off great, but by the time it gets past KMP it gets more complicated than it needs to be\u003c/li\u003e\n\u003cli\u003enice explanation of tries\u003c/li\u003e\n\u003cli\u003ecan be skipped\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003eSorting\u003c/strong\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eStanford lectures on sorting:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=ENp00xylP7c\u0026amp;index=15\u0026amp;list=PLFE6E58F856038C69\" rel=\"nofollow\"\u003eLecture 15 | Programming Abstractions (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=y4M9IVgrVKo\u0026amp;index=16\u0026amp;list=PLFE6E58F856038C69\" rel=\"nofollow\"\u003eLecture 16 | Programming Abstractions (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eShai Simonson:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=odNJmw5TOEE\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=2\" rel=\"nofollow\"\u003eAlgorithms - Sorting - Lecture 2 (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=hj8YKFTFKEE\u0026amp;list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm\u0026amp;index=3\" rel=\"nofollow\"\u003eAlgorithms - Sorting II - Lecture 3 (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003eSteven Skiena lectures on sorting:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=jUf-UQ3a0kg\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=8\" rel=\"nofollow\"\u003eCSE373 2020 - Mergesort/Quicksort (video)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.youtube.com/watch?v=0ksyQKmre84\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=9\" rel=\"nofollow\"\u003eCSE373 2020 - Linear Sorting (video)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003eNAND To Tetris: \u003ca href=\"https://www.coursera.org/learn/build-a-computer\" rel=\"nofollow\"\u003eBuild a Modern Computer from First Principles\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eVideo Series\u003c/h2\u003e\u003ca id=\"user-content-video-series\" class=\"anchor\" aria-label=\"Permalink: Video Series\" href=\"#video-series\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003eSit back and enjoy.\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr\" rel=\"nofollow\"\u003eList of individual Dynamic Programming problems (each is short)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL038BE01D3BAEFDB0\" rel=\"nofollow\"\u003ex86 Architecture, Assembly, Applications (11 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLE7DDD91010BC51F8\" rel=\"nofollow\"\u003eMIT 18.06 Linear Algebra, Spring 2005 (35 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL3B08AE665AB9002A\" rel=\"nofollow\"\u003eExcellent - MIT Calculus Revisited: Single Variable Calculus\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=22hwcnXIGgk\u0026amp;list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx\u0026amp;index=1\" rel=\"nofollow\"\u003eSkiena lectures from Algorithm Design Manual - CSE373 2020 - Analysis of Algorithms (26 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd\" rel=\"nofollow\"\u003eUC Berkeley 61B (Spring 2014): Data Structures (25 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://archive.org/details/ucberkeley-webcast-PL4BBB74C7D2A1049C\" rel=\"nofollow\"\u003eUC Berkeley 61B (Fall 2006): Data Structures (39 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iCl2-D-FS5mk0jFF6cYSJs_\" rel=\"nofollow\"\u003eUC Berkeley 61C: Machine Structures (26 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO\" rel=\"nofollow\"\u003eOOSE: Software Dev Using UML and Java (21 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLDSlqjcPpoL64CJdF0Qee5oWqGS6we_Yu\" rel=\"nofollow\"\u003eMIT 6.004: Computation Structures (49 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL5PHm2jkkXmi5CxxI7b3JCL1TWybTDtKq\" rel=\"nofollow\"\u003eCarnegie Mellon - Computer Architecture Lectures (39 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=HtSuA80QTyo\u0026amp;list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb\u0026amp;nohtml5=False\" rel=\"nofollow\"\u003eMIT 6.006: Intro to Algorithms (47 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=zm2VP0kHl1M\u0026amp;list=PL6535748F59DCA484\" rel=\"nofollow\"\u003eMIT 6.033: Computer System Engineering (22 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi\" rel=\"nofollow\"\u003eMIT 6.034 Artificial Intelligence, Fall 2010 (30 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=L3LMbpZIKhQ\u0026amp;list=PLB7540DEDD482705B\" rel=\"nofollow\"\u003eMIT 6.042J: Mathematics for Computer Science, Fall 2010 (25 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=2P-yW7LQr08\u0026amp;list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp\" rel=\"nofollow\"\u003eMIT 6.046: Design and Analysis of Algorithms (34 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=cQP8WApzIQQ\u0026amp;list=PLrw6a1wE39_tb2fErI4-WkMbsvGQk9_UB\" rel=\"nofollow\"\u003eMIT 6.824: Distributed Systems, Spring 2020 (20 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=T0yzrZL1py0\u0026amp;list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf\u0026amp;index=1\" rel=\"nofollow\"\u003eMIT 6.851: Advanced Data Structures (22 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c\" rel=\"nofollow\"\u003eMIT 6.854: Advanced Algorithms, Spring 2016 (24 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL2SOU6wwxB0uP4rJgf5ayhHWgw7akUWSf\" rel=\"nofollow\"\u003eHarvard COMPSCI 224: Advanced Algorithms (25 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/watch?v=GqmQg-cszw4\u0026amp;index=1\u0026amp;list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh\" rel=\"nofollow\"\u003eMIT 6.858 Computer Systems Security, Fall 2014\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL9D558D49CA734A02\" rel=\"nofollow\"\u003eStanford: Programming Paradigms (27 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy\" rel=\"nofollow\"\u003eIntroduction to Cryptography by Christof Paar\u003c/a\u003e\u003c/p\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://www.crypto-textbook.com/\" rel=\"nofollow\"\u003eCourse Website along with Slides and Problem Sets\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/playlist?list=PLLssT5z_DsK9JDLcT8T62VtzwyW9LNepV\" rel=\"nofollow\"\u003eMining Massive Datasets - Stanford University (94 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003cli\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"https://www.youtube.com/user/DrSaradaHerke/playlists?shelf_id=5\u0026amp;view=50\u0026amp;sort=dd\" rel=\"nofollow\"\u003eGraph Theory by Sarada Herke (67 videos)\u003c/a\u003e\u003c/p\u003e\n\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eComputer Science Courses\u003c/h2\u003e\u003ca id=\"user-content-computer-science-courses\" class=\"anchor\" aria-label=\"Permalink: Computer Science Courses\" href=\"#computer-science-courses\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/open-source-society/computer-science\"\u003eDirectory of Online CS Courses\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://github.com/prakhar1989/awesome-courses\"\u003eDirectory of CS Courses (many with online lectures)\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eAlgorithms implementation\u003c/h2\u003e\u003ca id=\"user-content-algorithms-implementation\" class=\"anchor\" aria-label=\"Permalink: Algorithms implementation\" href=\"#algorithms-implementation\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://algs4.cs.princeton.edu/code\" rel=\"nofollow\"\u003eMultiple Algorithms implementation by Princeton University\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003ePapers\u003c/h2\u003e\u003ca id=\"user-content-papers\" class=\"anchor\" aria-label=\"Permalink: Papers\" href=\"#papers\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://www.cs.cmu.edu/~crary/819-f09/\" rel=\"nofollow\"\u003eLove classic papers?\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://spinroot.com/courses/summer/Papers/hoare_1978.pdf\" rel=\"nofollow\"\u003e1978: Communicating Sequential Processes\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"https://godoc.org/github.com/thomas11/csp\" rel=\"nofollow\"\u003eimplemented in Go\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://static.googleusercontent.com/media/research.google.com/en//archive/gfs-sosp2003.pdf\" rel=\"nofollow\"\u003e2003: The Google File System\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003ereplaced by Colossus in 2012\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://static.googleusercontent.com/media/research.google.com/en//archive/mapreduce-osdi04.pdf\" rel=\"nofollow\"\u003e2004: MapReduce: Simplified Data Processing on Large Clusters\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003emostly replaced by Cloud Dataflow?\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://static.googleusercontent.com/media/research.google.com/en//archive/bigtable-osdi06.pdf\" rel=\"nofollow\"\u003e2006: Bigtable: A Distributed Storage System for Structured Data\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://research.google.com/archive/chubby-osdi06.pdf\" rel=\"nofollow\"\u003e2006: The Chubby Lock Service for Loosely-Coupled Distributed Systems\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://s3.amazonaws.com/AllThingsDistributed/sosp/amazon-dynamo-sosp2007.pdf\" rel=\"nofollow\"\u003e2007: Dynamo: Amazon’s Highly Available Key-value Store\u003c/a\u003e\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003eThe Dynamo paper kicked off the NoSQL revolution\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.akkadia.org/drepper/cpumemory.pdf\" rel=\"nofollow\"\u003e2007: What Every Programmer Should Know About Memory (very long, and the author encourages skipping of some sections)\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e2012: AddressSanitizer: A Fast Address Sanity Checker:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/37752.pdf\" rel=\"nofollow\"\u003epaper\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.usenix.org/conference/atc12/technical-sessions/presentation/serebryany\" rel=\"nofollow\"\u003evideo\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e2013: Spanner: Google’s Globally-Distributed Database:\n\u003cul dir=\"auto\"\u003e\n\u003cli\u003e\u003ca href=\"http://static.googleusercontent.com/media/research.google.com/en//archive/spanner-osdi2012.pdf\" rel=\"nofollow\"\u003epaper\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://www.usenix.org/node/170855\" rel=\"nofollow\"\u003evideo\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43790.pdf\" rel=\"nofollow\"\u003e2015: Continuous Pipelines at Google\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44686.pdf\" rel=\"nofollow\"\u003e2015: High-Availability at Massive Scale: Building Google’s Data Infrastructure for Ads\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003e\u003ca href=\"http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43835.pdf\" rel=\"nofollow\"\u003e2015: How Developers Search for Code: A Case Study\u003c/a\u003e\u003c/li\u003e\n\u003cli\u003eMore papers: \u003ca href=\"https://github.com/0voice/computer_expert_paper\"\u003e1,000 papers\u003c/a\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003cp dir=\"auto\"\u003e\u003cstrong\u003e\u003ca href=\"#table-of-contents\"\u003e⬆ back to top\u003c/a\u003e\u003c/strong\u003e\u003c/p\u003e\n\u003cdiv class=\"markdown-heading\" dir=\"auto\"\u003e\u003ch2 tabindex=\"-1\" class=\"heading-element\" dir=\"auto\"\u003eLICENSE\u003c/h2\u003e\u003ca id=\"user-content-license\" class=\"anchor\" aria-label=\"Permalink: LICENSE\" href=\"#license\"\u003e\u003csvg class=\"octicon octicon-link\" viewBox=\"0 0 16 16\" version=\"1.1\" width=\"16\" height=\"16\" aria-hidden=\"true\"\u003e\u003cpath d=\"m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z\"\u003e\u003c/path\u003e\u003c/svg\u003e\u003c/a\u003e\u003c/div\u003e\n\u003cp dir=\"auto\"\u003e\u003ca href=\"/jwasham/coding-interview-university/blob/main/LICENSE.txt\"\u003eCC-BY-SA-4.0\u003c/a\u003e\u003c/p\u003e\n\u003c/article\u003e","loaded":true,"timedOut":false,"errorMessage":null,"headerInfo":{"toc":[{"level":1,"text":"Coding Interview University","anchor":"coding-interview-university","htmlText":"Coding Interview University"},{"level":2,"text":"What is it?","anchor":"what-is-it","htmlText":"What is it?"},{"level":2,"text":"Table of Contents","anchor":"table-of-contents","htmlText":"Table of Contents"},{"level":3,"text":"The Study Plan","anchor":"the-study-plan","htmlText":"The Study Plan"},{"level":3,"text":"Topics of Study","anchor":"topics-of-study","htmlText":"Topics of Study"},{"level":3,"text":"Getting the Job","anchor":"getting-the-job","htmlText":"Getting the Job"},{"level":3,"text":"Optional Extra Topics \u0026 Resources","anchor":"optional-extra-topics--resources","htmlText":"Optional Extra Topics \u0026amp; Resources"},{"level":2,"text":"Why use it?","anchor":"why-use-it","htmlText":"Why use it?"},{"level":2,"text":"How to use it","anchor":"how-to-use-it","htmlText":"How to use it"},{"level":3,"text":"If you don't want to use git","anchor":"if-you-dont-want-to-use-git","htmlText":"If you don't want to use git"},{"level":3,"text":"If you're comfortable with git","anchor":"if-youre-comfortable-with-git","htmlText":"If you're comfortable with git"},{"level":2,"text":"Don't feel you aren't smart enough","anchor":"dont-feel-you-arent-smart-enough","htmlText":"Don't feel you aren't smart enough"},{"level":2,"text":"A Note About Video Resources","anchor":"a-note-about-video-resources","htmlText":"A Note About Video Resources"},{"level":2,"text":"Choose a Programming Language","anchor":"choose-a-programming-language","htmlText":"Choose a Programming Language"},{"level":3,"text":"For this Study Plan","anchor":"for-this-study-plan","htmlText":"For this Study Plan"},{"level":3,"text":"For your Coding Interview","anchor":"for-your-coding-interview","htmlText":"For your Coding Interview"},{"level":2,"text":"Books for Data Structures and Algorithms","anchor":"books-for-data-structures-and-algorithms","htmlText":"Books for Data Structures and Algorithms"},{"level":3,"text":"Python","anchor":"python","htmlText":"Python"},{"level":3,"text":"C","anchor":"c","htmlText":"C"},{"level":3,"text":"Java","anchor":"java","htmlText":"Java"},{"level":3,"text":"C++","anchor":"c-1","htmlText":"C++"},{"level":2,"text":"Interview Prep Books","anchor":"interview-prep-books","htmlText":"Interview Prep Books"},{"level":3,"text":"If you have tons of extra time:","anchor":"if-you-have-tons-of-extra-time","htmlText":"If you have tons of extra time:"},{"level":2,"text":"Don't Make My Mistakes","anchor":"dont-make-my-mistakes","htmlText":"Don't Make My Mistakes"},{"level":3,"text":"1. You Won't Remember it All","anchor":"1-you-wont-remember-it-all","htmlText":"1. You Won't Remember it All"},{"level":3,"text":"2. Use Flashcards","anchor":"2-use-flashcards","htmlText":"2. Use Flashcards"},{"level":3,"text":"3. Do Coding Interview Questions While You're Learning","anchor":"3-do-coding-interview-questions-while-youre-learning","htmlText":"3. Do Coding Interview Questions While You're Learning"},{"level":3,"text":"4. Focus","anchor":"4-focus","htmlText":"4. Focus"},{"level":2,"text":"What you won't see covered","anchor":"what-you-wont-see-covered","htmlText":"What you won't see covered"},{"level":2,"text":"The Daily Plan","anchor":"the-daily-plan","htmlText":"The Daily Plan"},{"level":2,"text":"Coding Question Practice","anchor":"coding-question-practice","htmlText":"Coding Question Practice"},{"level":2,"text":"Coding Problems","anchor":"coding-problems","htmlText":"Coding Problems"},{"level":2,"text":"Let's Get Started","anchor":"lets-get-started","htmlText":"Let's Get Started"},{"level":2,"text":"Algorithmic complexity / Big-O / Asymptotic analysis","anchor":"algorithmic-complexity--big-o--asymptotic-analysis","htmlText":"Algorithmic complexity / Big-O / Asymptotic analysis"},{"level":2,"text":"Data Structures","anchor":"data-structures","htmlText":"Data Structures"},{"level":3,"text":"Arrays","anchor":"arrays","htmlText":"Arrays"},{"level":3,"text":"Linked Lists","anchor":"linked-lists","htmlText":"Linked Lists"},{"level":3,"text":"Stack","anchor":"stack","htmlText":"Stack"},{"level":3,"text":"Queue","anchor":"queue","htmlText":"Queue"},{"level":3,"text":"Hash table","anchor":"hash-table","htmlText":"Hash table"},{"level":2,"text":"More Knowledge","anchor":"more-knowledge","htmlText":"More Knowledge"},{"level":3,"text":"Binary search","anchor":"binary-search","htmlText":"Binary search"},{"level":3,"text":"Bitwise operations","anchor":"bitwise-operations","htmlText":"Bitwise operations"},{"level":2,"text":"Trees","anchor":"trees","htmlText":"Trees"},{"level":3,"text":"Trees - Intro","anchor":"trees---intro","htmlText":"Trees - Intro"},{"level":3,"text":"Binary search trees: BSTs","anchor":"binary-search-trees-bsts","htmlText":"Binary search trees: BSTs"},{"level":3,"text":"Heap / Priority Queue / Binary Heap","anchor":"heap--priority-queue--binary-heap","htmlText":"Heap / Priority Queue / Binary Heap"},{"level":2,"text":"Sorting","anchor":"sorting","htmlText":"Sorting"},{"level":2,"text":"Graphs","anchor":"graphs","htmlText":"Graphs"},{"level":2,"text":"Even More Knowledge","anchor":"even-more-knowledge","htmlText":"Even More Knowledge"},{"level":3,"text":"Recursion","anchor":"recursion","htmlText":"Recursion"},{"level":3,"text":"Dynamic Programming","anchor":"dynamic-programming","htmlText":"Dynamic Programming"},{"level":3,"text":"Design patterns","anchor":"design-patterns","htmlText":"Design patterns"},{"level":3,"text":"Combinatorics (n choose k) \u0026 Probability","anchor":"combinatorics-n-choose-k--probability","htmlText":"Combinatorics (n choose k) \u0026amp; Probability"},{"level":3,"text":"NP, NP-Complete and Approximation Algorithms","anchor":"np-np-complete-and-approximation-algorithms","htmlText":"NP, NP-Complete and Approximation Algorithms"},{"level":3,"text":"How computers process a program","anchor":"how-computers-process-a-program","htmlText":"How computers process a program"},{"level":3,"text":"Caches","anchor":"caches","htmlText":"Caches"},{"level":3,"text":"Processes and Threads","anchor":"processes-and-threads","htmlText":"Processes and Threads"},{"level":3,"text":"Testing","anchor":"testing","htmlText":"Testing"},{"level":3,"text":"String searching \u0026 manipulations","anchor":"string-searching--manipulations","htmlText":"String searching \u0026amp; manipulations"},{"level":3,"text":"Tries","anchor":"tries","htmlText":"Tries"},{"level":3,"text":"Floating Point Numbers","anchor":"floating-point-numbers","htmlText":"Floating Point Numbers"},{"level":3,"text":"Unicode","anchor":"unicode","htmlText":"Unicode"},{"level":3,"text":"Endianness","anchor":"endianness","htmlText":"Endianness"},{"level":3,"text":"Networking","anchor":"networking","htmlText":"Networking"},{"level":2,"text":"Final Review","anchor":"final-review","htmlText":"Final Review"},{"level":2,"text":"Update Your Resume","anchor":"update-your-resume","htmlText":"Update Your Resume"},{"level":2,"text":"Interview Process \u0026 General Interview Prep","anchor":"interview-process--general-interview-prep","htmlText":"Interview Process \u0026amp; General Interview Prep"},{"level":2,"text":"Be thinking of for when the interview comes","anchor":"be-thinking-of-for-when-the-interview-comes","htmlText":"Be thinking of for when the interview comes"},{"level":2,"text":"Have questions for the interviewer","anchor":"have-questions-for-the-interviewer","htmlText":"Have questions for the interviewer"},{"level":2,"text":"Once You've Got The Job","anchor":"once-youve-got-the-job","htmlText":"Once You've Got The Job"},{"level":2,"text":"Additional Books","anchor":"additional-books","htmlText":"Additional Books"},{"level":2,"text":"System Design, Scalability, Data Handling","anchor":"system-design-scalability-data-handling","htmlText":"System Design, Scalability, Data Handling"},{"level":2,"text":"Additional Learning","anchor":"additional-learning","htmlText":"Additional Learning"},{"level":3,"text":"Compilers","anchor":"compilers","htmlText":"Compilers"},{"level":3,"text":"Emacs and vi(m)","anchor":"emacs-and-vim","htmlText":"Emacs and vi(m)"},{"level":3,"text":"Unix/Linux command line tools","anchor":"unixlinux-command-line-tools","htmlText":"Unix/Linux command line tools"},{"level":3,"text":"DevOps","anchor":"devops","htmlText":"DevOps"},{"level":3,"text":"Information theory (videos)","anchor":"information-theory-videos","htmlText":"Information theory (videos)"},{"level":3,"text":"Parity \u0026 Hamming Code (videos)","anchor":"parity--hamming-code-videos","htmlText":"Parity \u0026amp; Hamming Code (videos)"},{"level":3,"text":"Entropy","anchor":"entropy","htmlText":"Entropy"},{"level":3,"text":"Cryptography","anchor":"cryptography","htmlText":"Cryptography"},{"level":3,"text":"Compression","anchor":"compression","htmlText":"Compression"},{"level":3,"text":"Computer Security","anchor":"computer-security","htmlText":"Computer Security"},{"level":3,"text":"Garbage collection","anchor":"garbage-collection","htmlText":"Garbage collection"},{"level":3,"text":"Parallel Programming","anchor":"parallel-programming","htmlText":"Parallel Programming"},{"level":3,"text":"Messaging, Serialization, and Queueing Systems","anchor":"messaging-serialization-and-queueing-systems","htmlText":"Messaging, Serialization, and Queueing Systems"},{"level":3,"text":"A*","anchor":"a","htmlText":"A*"},{"level":3,"text":"Fast Fourier Transform","anchor":"fast-fourier-transform","htmlText":"Fast Fourier Transform"},{"level":3,"text":"Bloom Filter","anchor":"bloom-filter","htmlText":"Bloom Filter"},{"level":3,"text":"HyperLogLog","anchor":"hyperloglog","htmlText":"HyperLogLog"},{"level":3,"text":"Locality-Sensitive Hashing","anchor":"locality-sensitive-hashing","htmlText":"Locality-Sensitive Hashing"},{"level":3,"text":"van Emde Boas Trees","anchor":"van-emde-boas-trees","htmlText":"van Emde Boas Trees"},{"level":3,"text":"Augmented Data Structures","anchor":"augmented-data-structures","htmlText":"Augmented Data Structures"},{"level":3,"text":"Balanced search trees","anchor":"balanced-search-trees","htmlText":"Balanced search trees"},{"level":3,"text":"k-D Trees","anchor":"k-d-trees","htmlText":"k-D Trees"},{"level":3,"text":"Skip lists","anchor":"skip-lists","htmlText":"Skip lists"},{"level":3,"text":"Network Flows","anchor":"network-flows","htmlText":"Network Flows"},{"level":3,"text":"Disjoint Sets \u0026 Union Find","anchor":"disjoint-sets--union-find","htmlText":"Disjoint Sets \u0026amp; Union Find"},{"level":3,"text":"Math for Fast Processing","anchor":"math-for-fast-processing","htmlText":"Math for Fast Processing"},{"level":3,"text":"Treap","anchor":"treap","htmlText":"Treap"},{"level":3,"text":"Linear Programming (videos)","anchor":"linear-programming-videos","htmlText":"Linear Programming (videos)"},{"level":3,"text":"Geometry, Convex hull (videos)","anchor":"geometry-convex-hull-videos","htmlText":"Geometry, Convex hull (videos)"},{"level":3,"text":"Discrete math","anchor":"discrete-math","htmlText":"Discrete math"},{"level":2,"text":"Additional Detail on Some Subjects","anchor":"additional-detail-on-some-subjects","htmlText":"Additional Detail on Some Subjects"},{"level":2,"text":"Video Series","anchor":"video-series","htmlText":"Video Series"},{"level":2,"text":"Computer Science Courses","anchor":"computer-science-courses","htmlText":"Computer Science Courses"},{"level":2,"text":"Algorithms implementation","anchor":"algorithms-implementation","htmlText":"Algorithms implementation"},{"level":2,"text":"Papers","anchor":"papers","htmlText":"Papers"},{"level":2,"text":"LICENSE","anchor":"license","htmlText":"LICENSE"}],"siteNavLoginPath":"/login?return_to=https%3A%2F%2Fgithub.com%2Fjwasham%2Fcoding-interview-university"}},{"displayName":"LICENSE.txt","repoName":"coding-interview-university","refName":"main","path":"LICENSE.txt","preferredFileType":"license","tabName":"CC-BY-SA-4.0","richText":null,"loaded":false,"timedOut":false,"errorMessage":null,"headerInfo":{"toc":null,"siteNavLoginPath":"/login?return_to=https%3A%2F%2Fgithub.com%2Fjwasham%2Fcoding-interview-university"}}],"overviewFilesProcessingTime":0}},"appPayload":{"helpUrl":"https://docs.github.com","findFileWorkerPath":"/assets-cdn/worker/find-file-worker-9f8a877aa99f.js","findInFileWorkerPath":"/assets-cdn/worker/find-in-file-worker-96e76d5fdb2c.js","githubDevUrl":null,"enabled_features":{"copilot_workspace":null,"code_nav_ui_events":false,"overview_shared_code_dropdown_button":false,"react_blob_overlay":false,"copilot_conversational_ux_embedding_update":false,"copilot_smell_icebreaker_ux":true,"accessible_code_button":true}}}}</script> <div data-target="react-partial.reactRoot"><style data-styled="true" data-styled-version="5.3.11">.iVEunk{margin-top:16px;margin-bottom:16px;}/*!sc*/ .jzuOtQ{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:column;-ms-flex-direction:column;flex-direction:column;-webkit-box-pack:justify;-webkit-justify-content:space-between;-ms-flex-pack:justify;justify-content:space-between;}/*!sc*/ .bGojzy{margin-bottom:0;display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:column;-ms-flex-direction:column;flex-direction:column;row-gap:16px;}/*!sc*/ .iNSVHo{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-box-pack:justify;-webkit-justify-content:space-between;-ms-flex-pack:justify;justify-content:space-between;-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;padding-bottom:16px;padding-top:8px;}/*!sc*/ .bVgnfw{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:row;-ms-flex-direction:row;flex-direction:row;gap:8px;}/*!sc*/ @media screen and (max-width:320px){.bVgnfw{-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;}}/*!sc*/ .CEgMp{position:relative;}/*!sc*/ @media screen and (max-width:380px){.CEgMp .ref-selector-button-text-container{max-width:80px;}}/*!sc*/ @media screen and (max-width:320px){.CEgMp{-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;}.CEgMp .overview-ref-selector{width:100%;}.CEgMp .overview-ref-selector > span{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-box-pack:start;-webkit-justify-content:flex-start;-ms-flex-pack:start;justify-content:flex-start;}.CEgMp .overview-ref-selector > span > span[data-component="text"]{-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;}}/*!sc*/ .gMOVLe[data-size="medium"]{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;min-width:0;}/*!sc*/ .gMOVLe[data-size="medium"] svg{color:var(--fgColor-muted,var(--color-fg-muted,#656d76));}/*!sc*/ .gMOVLe[data-size="medium"] > span{width:inherit;}/*!sc*/ .gUkoLg{-webkit-box-pack:center;-webkit-justify-content:center;-ms-flex-pack:center;justify-content:center;}/*!sc*/ .bZBlpz{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;width:100%;}/*!sc*/ .lhTYNA{margin-right:4px;color:var(--fgColor-muted,var(--color-fg-muted,#656d76));}/*!sc*/ .ffLUq{font-size:14px;min-width:0;overflow:hidden;text-overflow:ellipsis;white-space:nowrap;}/*!sc*/ .fLXEGX{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;}/*!sc*/ @media screen and (max-width:1079px){.fLXEGX{display:none;}}/*!sc*/ .lmSMZJ[data-size="medium"]{color:var(--fgColor-muted,var(--color-fg-muted,#656d76));padding-left:4px;padding-right:4px;}/*!sc*/ .lmSMZJ[data-size="medium"] span[data-component="leadingVisual"]{margin-right:4px !important;}/*!sc*/ .dqfxud{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;}/*!sc*/ @media screen and (min-width:1080px){.dqfxud{display:none;}}/*!sc*/ @media screen and (max-width:543px){.dqfxud{display:none;}}/*!sc*/ .fGwBZA[data-size="medium"][data-no-visuals]{color:var(--fgColor-muted,var(--color-fg-muted,#656d76));}/*!sc*/ .jxTzTd{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;padding-left:8px;gap:8px;}/*!sc*/ .gqqBXN{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;gap:8px;}/*!sc*/ @media screen and (max-width:543px){.gqqBXN{display:none;}}/*!sc*/ .dzXgxt{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;}/*!sc*/ @media screen and (max-width:1011px){.dzXgxt{display:none;}}/*!sc*/ .iWFGlI{margin-left:8px;margin-right:8px;margin:0;}/*!sc*/ .YUPas{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;}/*!sc*/ @media screen and (min-width:1012px){.YUPas{display:none;}}/*!sc*/ .izFOf{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;}/*!sc*/ @media screen and (min-width:544px){.izFOf{display:none;}}/*!sc*/ .vIPPs{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:column;-ms-flex-direction:column;flex-direction:column;gap:16px;}/*!sc*/ .fdROMU{width:100%;border-collapse:separate;border-spacing:0;border:1px solid;border-color:var(--borderColor-default,var(--color-border-default,#d0d7de));border-radius:6px;table-layout:fixed;overflow:unset;}/*!sc*/ .jGKpsv{height:0px;line-height:0px;}/*!sc*/ .jGKpsv tr{height:0px;font-size:0px;}/*!sc*/ .jdgHnn{padding:16px;color:var(--fgColor-muted,var(--color-fg-muted,#656d76));font-size:12px;text-align:left;height:40px;}/*!sc*/ .jdgHnn th{padding-left:16px;background-color:var(--bgColor-muted,var(--color-canvas-subtle,#f6f8fa));}/*!sc*/ .bQivRW{width:100%;border-top-left-radius:6px;}/*!sc*/ @media screen and (min-width:544px){.bQivRW{display:none;}}/*!sc*/ .ldkMIO{width:40%;border-top-left-radius:6px;}/*!sc*/ @media screen and (max-width:543px){.ldkMIO{display:none;}}/*!sc*/ .jMbWeI{text-align:right;padding-right:16px;width:136px;border-top-right-radius:6px;}/*!sc*/ .gpqjiB{color:var(--fgColor-muted,var(--color-fg-muted,#656d76));font-size:12px;height:40px;}/*!sc*/ .dzCJzi{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:row;-ms-flex-direction:row;flex-direction:row;-webkit-flex-wrap:wrap;-ms-flex-wrap:wrap;flex-wrap:wrap;-webkit-box-pack:justify;-webkit-justify-content:space-between;-ms-flex-pack:justify;justify-content:space-between;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;gap:8px;min-width:273px;padding:8px;}/*!sc*/ @media screen and (min-width:544px){.dzCJzi{-webkit-flex-wrap:nowrap;-ms-flex-wrap:nowrap;flex-wrap:nowrap;}}/*!sc*/ .eNCcrz{text-align:center;vertical-align:center;height:40px;border-top:1px solid;border-color:var(--borderColor-default,var(--color-border-default,#d0d7de));}/*!sc*/ .bHTcCe{border-top:1px solid var(--borderColor-default,var(--color-border-default));cursor:pointer;}/*!sc*/ .csrIcr{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;gap:16px;}/*!sc*/ .bUQNHB{border:1px solid;border-color:var(--borderColor-default,var(--color-border-default,#d0d7de));border-radius:6px;display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:column;-ms-flex-direction:column;flex-direction:column;-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;}/*!sc*/ @media screen and (max-width:543px){.bUQNHB{margin-left:-16px;margin-right:-16px;max-width:calc(100% + 32px);}}/*!sc*/ @media screen and (min-width:544px){.bUQNHB{max-width:100%;}}/*!sc*/ .jPdcfu{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;border-bottom:1px solid;border-bottom-color:var(--borderColor-default,var(--color-border-default,#d0d7de));-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;padding-right:8px;position:-webkit-sticky;position:sticky;top:0;background-color:var(--bgColor-default,var(--color-canvas-default,#ffffff));z-index:1;border-top-left-radius:6px;border-top-right-radius:6px;}/*!sc*/ .hUCRAk{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-flex-direction:column;-ms-flex-direction:column;flex-direction:column;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}/*!sc*/ .cwoBXV[data-size="medium"]{color:var(--fgColor-muted,var(--color-fg-subtle,#6e7781));padding-left:8px;padding-right:8px;}/*!sc*/ .QkQOb{padding:32px;overflow:auto;}/*!sc*/ data-styled.g1[id="Box-sc-g0xbh4-0"]{content:"iVEunk,jzuOtQ,bGojzy,iNSVHo,bVgnfw,CEgMp,gMOVLe,gUkoLg,bZBlpz,lhTYNA,ffLUq,fLXEGX,lmSMZJ,dqfxud,fGwBZA,jxTzTd,gqqBXN,dzXgxt,iWFGlI,YUPas,izFOf,vIPPs,fdROMU,jGKpsv,jdgHnn,bQivRW,ldkMIO,jMbWeI,gpqjiB,dzCJzi,eNCcrz,bHTcCe,csrIcr,bUQNHB,jPdcfu,hUCRAk,cwoBXV,QkQOb,"}/*!sc*/ .eMMFM{min-width:0;}/*!sc*/ .eMMFM:where([data-size='small']){font-size:var(--text-body-size-small,0.75rem);line-height:var(--text-body-lineHeight-small,1.6666);}/*!sc*/ .eMMFM:where([data-size='medium']){font-size:var(--text-body-size-medium,0.875rem);line-height:var(--text-body-lineHeight-medium,1.4285);}/*!sc*/ .eMMFM:where([data-size='large']){font-size:var(--text-body-size-large,1rem);line-height:var(--text-body-lineHeight-large,1.5);}/*!sc*/ .eMMFM:where([data-weight='light']){font-weight:var(--base-text-weight-light,300);}/*!sc*/ .eMMFM:where([data-weight='normal']){font-weight:var(--base-text-weight-normal,400);}/*!sc*/ .eMMFM:where([data-weight='medium']){font-weight:var(--base-text-weight-medium,500);}/*!sc*/ .eMMFM:where([data-weight='semibold']){font-weight:var(--base-text-weight-semibold,600);}/*!sc*/ data-styled.g3[id="Text__StyledText-sc-17v1xeu-0"]{content:"eMMFM,"}/*!sc*/ .brGdpi{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;-webkit-clip:rect(0,0,0,0);clip:rect(0,0,0,0);white-space:nowrap;border-width:0;}/*!sc*/ data-styled.g4[id="_VisuallyHidden__VisuallyHidden-sc-11jhm7a-0"]{content:"brGdpi,"}/*!sc*/ .jkNcAv{border:0;font-size:inherit;font-family:inherit;background-color:transparent;-webkit-appearance:none;color:inherit;width:100%;}/*!sc*/ .jkNcAv:focus{outline:0;}/*!sc*/ data-styled.g13[id="UnstyledTextInput__ToggledUnstyledTextInput-sc-14ypya-0"]{content:"jkNcAv,"}/*!sc*/ .hLzFvi{font-size:14px;line-height:var(--base-size-20);color:var(--fgColor-default,var(--color-fg-default,#1F2328));vertical-align:middle;background-color:var(--bgColor-default,var(--color-canvas-default,#ffffff));border:1px solid var(--control-borderColor-rest,var(--borderColor-default,var(--color-border-default,#d0d7de)));border-radius:6px;outline:none;box-shadow:var(--shadow-inset,var(--color-primer-shadow-inset,inset 0 1px 0 rgba(208,215,222,0.2)));display:-webkit-inline-box;display:-webkit-inline-flex;display:-ms-inline-flexbox;display:inline-flex;-webkit-align-items:stretch;-webkit-box-align:stretch;-ms-flex-align:stretch;align-items:stretch;min-height:var(--base-size-32);overflow:hidden;--inner-action-size:var(--base-size-24);}/*!sc*/ .hLzFvi input,.hLzFvi textarea{cursor:text;}/*!sc*/ .hLzFvi select{cursor:pointer;}/*!sc*/ .hLzFvi input::-webkit-input-placeholder,.hLzFvi textarea::-webkit-input-placeholder,.hLzFvi select::-webkit-input-placeholder{color:var(---control-fgColor-placeholder,var(--fgColor-muted,var(--color-fg-muted,#656d76)));}/*!sc*/ .hLzFvi input::-moz-placeholder,.hLzFvi textarea::-moz-placeholder,.hLzFvi select::-moz-placeholder{color:var(---control-fgColor-placeholder,var(--fgColor-muted,var(--color-fg-muted,#656d76)));}/*!sc*/ .hLzFvi input:-ms-input-placeholder,.hLzFvi textarea:-ms-input-placeholder,.hLzFvi select:-ms-input-placeholder{color:var(---control-fgColor-placeholder,var(--fgColor-muted,var(--color-fg-muted,#656d76)));}/*!sc*/ .hLzFvi input::placeholder,.hLzFvi textarea::placeholder,.hLzFvi select::placeholder{color:var(---control-fgColor-placeholder,var(--fgColor-muted,var(--color-fg-muted,#656d76)));}/*!sc*/ .hLzFvi:where([data-trailing-action][data-focused]),.hLzFvi:where(:not([data-trailing-action]):focus-within){border-color:var(--fgColor-accent,var(--color-accent-fg,#0969da));outline:2px solid var(--fgColor-accent,var(--color-accent-fg,#0969da));outline-offset:-1px;}/*!sc*/ .hLzFvi > textarea{padding:var(--base-size-12);}/*!sc*/ .hLzFvi:where([data-contrast]){background-color:var(--bgColor-inset,var(--color-canvas-inset,#f6f8fa));}/*!sc*/ .hLzFvi:where([data-disabled]){color:var(--fgColor-disabled,var(--color-primer-fg-disabled,#8c959f));background-color:var(--control-bgColor-disabled,var(--color-input-disabled-bg,rgba(175,184,193,0.2)));box-shadow:none;border-color:var(--control-borderColor-disabled,var(--borderColor-default,var(--color-border-default,#d0d7de)));}/*!sc*/ .hLzFvi:where([data-disabled]) input,.hLzFvi:where([data-disabled]) textarea,.hLzFvi:where([data-disabled]) select{cursor:not-allowed;}/*!sc*/ .hLzFvi:where([data-monospace]){font-family:var(--fontStack-monospace,SFMono-Regular,Consolas,"Liberation Mono",Menlo,Courier,monospace);}/*!sc*/ .hLzFvi:where([data-validation='error']){border-color:var(--borderColor-danger-emphasis,var(--color-danger-emphasis,#cf222e));}/*!sc*/ .hLzFvi:where([data-validation='error']):where([data-trailing-action][data-focused]),.hLzFvi:where([data-validation='error']):where(:not([data-trailing-action])):focus-within{border-color:var(--fgColor-accent,var(--color-accent-fg,#0969da));outline:2px solid var(--fgColor-accent,var(--color-accent-fg,#0969da));outline-offset:-1px;}/*!sc*/ .hLzFvi:where([data-validation='success']){border-color:var(--bgColor-success-emphasis,var(--color-success-emphasis,#1f883d));}/*!sc*/ .hLzFvi:where([data-block]){width:100%;display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-self:stretch;-ms-flex-item-align:stretch;align-self:stretch;}/*!sc*/ @media (min-width:768px){.hLzFvi{font-size:var(--text-body-size-medium);}}/*!sc*/ .hLzFvi:where([data-size='small']){--inner-action-size:var(--base-size-20);min-height:var(--base-size-28);padding-top:3px;padding-right:var(--base-size-8);padding-bottom:3px;padding-left:var(--base-size-8);font-size:var(--text-body-size-small);line-height:var(--base-size-20);}/*!sc*/ .hLzFvi:where([data-size='large']){--inner-action-size:var(--base-size-28);height:var(--base-size-40);padding-top:10px;padding-right:var(--base-size-8);padding-bottom:10px;padding-left:var(--base-size-8);}/*!sc*/ .hLzFvi:where([data-variant='small']){min-height:28px;padding-top:3px;padding-right:var(--base-size-8);padding-bottom:3px;padding-left:var(--base-size-8);font-size:(--text-body-size-small);line-height:var(--base-size-20);}/*!sc*/ .hLzFvi:where([data-variant='large']){padding-top:10px;padding-right:var(--base-size-8);padding-bottom:10px;padding-left:var(--base-size-8);font-size:var(--text-title-size-medium);}/*!sc*/ .hLzFvi{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;min-width:160px;}/*!sc*/ data-styled.g14[id="TextInputWrapper__StyledTextInputBaseWrapper-sc-1mqhpbi-0"]{content:"hLzFvi,"}/*!sc*/ .iHYdQq{background-repeat:no-repeat;background-position:right 8px center;padding-right:0;padding-left:0;}/*!sc*/ .iHYdQq > :not(:last-child){margin-right:8px;}/*!sc*/ .iHYdQq .TextInput-icon,.iHYdQq .TextInput-action{-webkit-align-self:center;-ms-flex-item-align:center;align-self:center;color:var(--fgColor-muted,var(--color-fg-muted,#656d76));-webkit-flex-shrink:0;-ms-flex-negative:0;flex-shrink:0;}/*!sc*/ .iHYdQq > input,.iHYdQq > select{padding-right:0;padding-left:0;}/*!sc*/ .iHYdQq:where([data-leading-visual]){padding-left:var(--base-size-12);}/*!sc*/ .iHYdQq:where([data-trailing-visual]:not([data-trailing-action])){padding-right:var(--base-size-12);}/*!sc*/ .iHYdQq:where(:not([data-leading-visual])) > input,.iHYdQq:where(:not([data-leading-visual])) > select{padding-left:var(--base-size-12);}/*!sc*/ .iHYdQq:where(:not([data-trailing-visual]):not([data-trailing-action])) > input,.iHYdQq:where(:not([data-trailing-visual]):not([data-trailing-action])) > select{padding-right:var(--base-size-12);}/*!sc*/ .iHYdQq{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;min-width:160px;}/*!sc*/ data-styled.g15[id="TextInputWrapper__StyledTextInputWrapper-sc-1mqhpbi-1"]{content:"iHYdQq,"}/*!sc*/ .hWlpPn{position:relative;display:inline-block;}/*!sc*/ .hWlpPn::after{position:absolute;z-index:1000000;display:none;padding:0.5em 0.75em;font:normal normal 11px/1.5 -apple-system,BlinkMacSystemFont,"Segoe UI","Noto Sans",Helvetica,Arial,sans-serif,"Apple Color Emoji","Segoe UI Emoji";-webkit-font-smoothing:subpixel-antialiased;color:var(--tooltip-fgColor,var(--fgColor-onEmphasis,var(--color-fg-on-emphasis,#ffffff)));text-align:center;-webkit-text-decoration:none;text-decoration:none;text-shadow:none;text-transform:none;-webkit-letter-spacing:normal;-moz-letter-spacing:normal;-ms-letter-spacing:normal;letter-spacing:normal;word-wrap:break-word;white-space:pre;pointer-events:none;content:attr(aria-label);background:var(--tooltip-bgColor,var(--bgColor-emphasis,var(--color-neutral-emphasis-plus,#24292f)));border-radius:6px;opacity:0;}/*!sc*/ @-webkit-keyframes tooltip-appear{from{opacity:0;}to{opacity:1;}}/*!sc*/ @keyframes tooltip-appear{from{opacity:0;}to{opacity:1;}}/*!sc*/ .hWlpPn:hover::after,.hWlpPn:active::after,.hWlpPn:focus::after,.hWlpPn:focus-within::after{display:inline-block;-webkit-text-decoration:none;text-decoration:none;-webkit-animation-name:tooltip-appear;animation-name:tooltip-appear;-webkit-animation-duration:0.1s;animation-duration:0.1s;-webkit-animation-fill-mode:forwards;animation-fill-mode:forwards;-webkit-animation-timing-function:ease-in;animation-timing-function:ease-in;-webkit-animation-delay:0s;animation-delay:0s;}/*!sc*/ .hWlpPn.tooltipped-no-delay:hover::after,.hWlpPn.tooltipped-no-delay:active::after,.hWlpPn.tooltipped-no-delay:focus::after,.hWlpPn.tooltipped-no-delay:focus-within::after{-webkit-animation-delay:0s;animation-delay:0s;}/*!sc*/ .hWlpPn.tooltipped-multiline:hover::after,.hWlpPn.tooltipped-multiline:active::after,.hWlpPn.tooltipped-multiline:focus::after,.hWlpPn.tooltipped-multiline:focus-within::after{display:table-cell;}/*!sc*/ .hWlpPn.tooltipped-s::after,.hWlpPn.tooltipped-se::after,.hWlpPn.tooltipped-sw::after{top:100%;right:50%;margin-top:6px;}/*!sc*/ .hWlpPn.tooltipped-se::after{right:auto;left:50%;margin-left:-16px;}/*!sc*/ .hWlpPn.tooltipped-sw::after{margin-right:-16px;}/*!sc*/ .hWlpPn.tooltipped-n::after,.hWlpPn.tooltipped-ne::after,.hWlpPn.tooltipped-nw::after{right:50%;bottom:100%;margin-bottom:6px;}/*!sc*/ .hWlpPn.tooltipped-ne::after{right:auto;left:50%;margin-left:-16px;}/*!sc*/ .hWlpPn.tooltipped-nw::after{margin-right:-16px;}/*!sc*/ .hWlpPn.tooltipped-s::after,.hWlpPn.tooltipped-n::after{-webkit-transform:translateX(50%);-ms-transform:translateX(50%);transform:translateX(50%);}/*!sc*/ .hWlpPn.tooltipped-w::after{right:100%;bottom:50%;margin-right:6px;-webkit-transform:translateY(50%);-ms-transform:translateY(50%);transform:translateY(50%);}/*!sc*/ .hWlpPn.tooltipped-e::after{bottom:50%;left:100%;margin-left:6px;-webkit-transform:translateY(50%);-ms-transform:translateY(50%);transform:translateY(50%);}/*!sc*/ .hWlpPn.tooltipped-multiline::after{width:-webkit-max-content;width:-moz-max-content;width:max-content;max-width:250px;word-wrap:break-word;white-space:pre-line;border-collapse:separate;}/*!sc*/ .hWlpPn.tooltipped-multiline.tooltipped-s::after,.hWlpPn.tooltipped-multiline.tooltipped-n::after{right:auto;left:50%;-webkit-transform:translateX(-50%);-ms-transform:translateX(-50%);transform:translateX(-50%);}/*!sc*/ .hWlpPn.tooltipped-multiline.tooltipped-w::after,.hWlpPn.tooltipped-multiline.tooltipped-e::after{right:100%;}/*!sc*/ .hWlpPn.tooltipped-align-right-2::after{right:0;margin-right:0;}/*!sc*/ .hWlpPn.tooltipped-align-left-2::after{left:0;margin-left:0;}/*!sc*/ data-styled.g17[id="Tooltip__TooltipBase-sc-17tf59c-0"]{content:"hWlpPn,"}/*!sc*/ .liVpTx{display:inline-block;overflow:hidden;text-overflow:ellipsis;vertical-align:top;white-space:nowrap;max-width:125px;}/*!sc*/ data-styled.g19[id="Truncate__StyledTruncate-sc-23o1d2-0"]{content:"liVpTx,"}/*!sc*/ .eBevHz{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;padding-inline:var(--stack-padding-normal,16px);-webkit-box-pack:start;-webkit-justify-content:flex-start;-ms-flex-pack:start;justify-content:flex-start;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;min-height:var(--control-xlarge-size,48px);box-shadow:inset 0px -1px var(--borderColor-muted,var(--borderColor-muted,var(--color-border-muted,hsla(210,18%,87%,1))));-webkit-box-flex:1;-webkit-flex-grow:1;-ms-flex-positive:1;flex-grow:1;border-bottom:none;max-width:100%;padding-left:8px;padding-right:8px;}/*!sc*/ data-styled.g99[id="UnderlineTabbedInterface__StyledComponentUnderlineWrapper-sc-4ilrg0-0"]{content:"eBevHz,"}/*!sc*/ .ehEdWC{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;list-style:none;white-space:nowrap;padding:0;margin:0;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;gap:8px;position:relative;}/*!sc*/ data-styled.g100[id="UnderlineTabbedInterface__StyledComponentUnderlineItemList-sc-4ilrg0-1"]{content:"ehEdWC,"}/*!sc*/ .beOdPj{-webkit-appearance:none;-moz-appearance:none;appearance:none;background-color:transparent;border:0;cursor:pointer;font:inherit;position:relative;display:-webkit-inline-box;display:-webkit-inline-flex;display:-ms-inline-flexbox;display:inline-flex;color:var(--fgColor-default,var(--color-fg-default,#1F2328));text-align:center;-webkit-text-decoration:none;text-decoration:none;line-height:var(--text-body-lineHeight-medium,1.4285);border-radius:var(--borderRadius-medium,6px);font-size:var(--text-body-size-medium,14px);padding-inline:var(--control-medium-paddingInline-condensed,8px);padding-block:var(--control-medium-paddingBlock,6px);-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}/*!sc*/ @media (hover:hover){.beOdPj:hover{background-color:var(--bgColor-neutral-muted,var(--bgColor-neutral-muted,var(--color-neutral-subtle,rgba(234,238,242,0.5))));-webkit-transition:background 0.12s ease-out;transition:background 0.12s ease-out;-webkit-text-decoration:none;text-decoration:none;}}/*!sc*/ .beOdPj:focus:{outline:2px solid transparent;box-shadow:inset 0 0 0 2px var(--fgColor-accent,var(--fgColor-accent,var(--color-accent-fg,#0969da)));}/*!sc*/ .beOdPj:focus::not(:focus-visible){box-shadow:none;}/*!sc*/ .beOdPj:focus-visible{outline:2px solid transparent;box-shadow:inset 0 0 0 2px var(--fgColor-accent,var(--fgColor-accent,var(--color-accent-fg,#0969da)));}/*!sc*/ .beOdPj [data-content]::before{content:attr(data-content);display:block;height:0;font-weight:var(--base-text-weight-semibold,500);visibility:hidden;white-space:nowrap;}/*!sc*/ .beOdPj [data-component='icon']{color:var(--fgColor-muted,var(--fgColor-muted,var(--color-fg-muted,#656d76)));-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;display:-webkit-inline-box;display:-webkit-inline-flex;display:-ms-inline-flexbox;display:inline-flex;margin-inline-end:var(--control-medium-gap,8px);}/*!sc*/ .beOdPj [data-component='counter']{margin-inline-start:var(--control-medium-gap,8px);display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}/*!sc*/ .beOdPj::after{position:absolute;right:50%;bottom:calc(50% - calc(var(--control-xlarge-size,48px) / 2 + 1px));width:100%;height:2px;content:'';background-color:transparent;border-radius:0;-webkit-transform:translate(50%,-50%);-ms-transform:translate(50%,-50%);transform:translate(50%,-50%);}/*!sc*/ .beOdPj[aria-current]:not([aria-current='false']) [data-component='text'],.beOdPj[aria-selected='true'] [data-component='text']{font-weight:var(--base-text-weight-semibold,500);}/*!sc*/ .beOdPj[aria-current]:not([aria-current='false'])::after,.beOdPj[aria-selected='true']::after{background-color:var(--underlineNav-borderColor-active,var(--color-primer-border-active,#fd8c73));}/*!sc*/ @media (forced-colors:active){.beOdPj[aria-current]:not([aria-current='false'])::after,.beOdPj[aria-selected='true']::after{background-color:LinkText;}}/*!sc*/ data-styled.g101[id="UnderlineTabbedInterface__StyledUnderlineItem-sc-4ilrg0-2"]{content:"beOdPj,"}/*!sc*/ </style> <!-- --> <!-- --> <div class="Box-sc-g0xbh4-0 iVEunk"><div class="Box-sc-g0xbh4-0 jzuOtQ"><div class="Box-sc-g0xbh4-0 bGojzy"></div></div><div class="Box-sc-g0xbh4-0 iNSVHo"><div class="Box-sc-g0xbh4-0 bVgnfw"><div class="Box-sc-g0xbh4-0 CEgMp"><button type="button" aria-haspopup="true" aria-expanded="false" tabindex="0" aria-label="main branch" data-testid="anchor-button" class="Box-sc-g0xbh4-0 gMOVLe prc-Button-ButtonBase-c50BI overview-ref-selector width-full" data-loading="false" data-size="medium" data-variant="default" aria-describedby="branch-picker-repos-header-ref-selector-loading-announcement" id="branch-picker-repos-header-ref-selector"><span data-component="buttonContent" class="Box-sc-g0xbh4-0 gUkoLg prc-Button-ButtonContent-HKbr-"><span data-component="text" class="prc-Button-Label-pTQ3x"><div class="Box-sc-g0xbh4-0 bZBlpz"><div class="Box-sc-g0xbh4-0 lhTYNA"><svg aria-hidden="true" focusable="false" class="octicon octicon-git-branch" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M9.5 3.25a2.25 2.25 0 1 1 3 2.122V6A2.5 2.5 0 0 1 10 8.5H6a1 1 0 0 0-1 1v1.128a2.251 2.251 0 1 1-1.5 0V5.372a2.25 2.25 0 1 1 1.5 0v1.836A2.493 2.493 0 0 1 6 7h4a1 1 0 0 0 1-1v-.628A2.25 2.25 0 0 1 9.5 3.25Zm-6 0a.75.75 0 1 0 1.5 0 .75.75 0 0 0-1.5 0Zm8.25-.75a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5ZM4.25 12a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Z"></path></svg></div><div class="Box-sc-g0xbh4-0 ffLUq ref-selector-button-text-container"><span class="Text__StyledText-sc-17v1xeu-0 eMMFM"> <!-- -->main</span></div></div></span><span data-component="trailingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="octicon octicon-triangle-down" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="m4.427 7.427 3.396 3.396a.25.25 0 0 0 .354 0l3.396-3.396A.25.25 0 0 0 11.396 7H4.604a.25.25 0 0 0-.177.427Z"></path></svg></span></span></button><button hidden="" data-hotkey-scope="read-only-cursor-text-area"></button></div><div class="Box-sc-g0xbh4-0 fLXEGX"><a style="--button-color:fg.muted" type="button" href="/jwasham/coding-interview-university/branches" class="Box-sc-g0xbh4-0 lmSMZJ prc-Button-ButtonBase-c50BI" data-loading="false" data-size="medium" data-variant="invisible" aria-describedby=":Rclab:-loading-announcement"><span data-component="buttonContent" class="Box-sc-g0xbh4-0 gUkoLg prc-Button-ButtonContent-HKbr-"><span data-component="leadingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="octicon octicon-git-branch" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M9.5 3.25a2.25 2.25 0 1 1 3 2.122V6A2.5 2.5 0 0 1 10 8.5H6a1 1 0 0 0-1 1v1.128a2.251 2.251 0 1 1-1.5 0V5.372a2.25 2.25 0 1 1 1.5 0v1.836A2.493 2.493 0 0 1 6 7h4a1 1 0 0 0 1-1v-.628A2.25 2.25 0 0 1 9.5 3.25Zm-6 0a.75.75 0 1 0 1.5 0 .75.75 0 0 0-1.5 0Zm8.25-.75a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5ZM4.25 12a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Z"></path></svg></span><span data-component="text" class="prc-Button-Label-pTQ3x">Branches</span></span></a><a style="--button-color:fg.muted" type="button" href="/jwasham/coding-interview-university/tags" class="Box-sc-g0xbh4-0 lmSMZJ prc-Button-ButtonBase-c50BI" data-loading="false" data-size="medium" data-variant="invisible" aria-describedby=":Rklab:-loading-announcement"><span data-component="buttonContent" class="Box-sc-g0xbh4-0 gUkoLg prc-Button-ButtonContent-HKbr-"><span data-component="leadingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="octicon octicon-tag" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1 7.775V2.75C1 1.784 1.784 1 2.75 1h5.025c.464 0 .91.184 1.238.513l6.25 6.25a1.75 1.75 0 0 1 0 2.474l-5.026 5.026a1.75 1.75 0 0 1-2.474 0l-6.25-6.25A1.752 1.752 0 0 1 1 7.775Zm1.5 0c0 .066.026.13.073.177l6.25 6.25a.25.25 0 0 0 .354 0l5.025-5.025a.25.25 0 0 0 0-.354l-6.25-6.25a.25.25 0 0 0-.177-.073H2.75a.25.25 0 0 0-.25.25ZM6 5a1 1 0 1 1 0 2 1 1 0 0 1 0-2Z"></path></svg></span><span data-component="text" class="prc-Button-Label-pTQ3x">Tags</span></span></a></div><div class="Box-sc-g0xbh4-0 dqfxud"><a style="--button-color:fg.muted" type="button" aria-label="Go to Branches page" href="/jwasham/coding-interview-university/branches" class="Box-sc-g0xbh4-0 fGwBZA prc-Button-ButtonBase-c50BI" data-loading="false" data-no-visuals="true" data-size="medium" data-variant="invisible" aria-describedby=":Relab:-loading-announcement"><svg aria-hidden="true" focusable="false" class="octicon octicon-git-branch" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M9.5 3.25a2.25 2.25 0 1 1 3 2.122V6A2.5 2.5 0 0 1 10 8.5H6a1 1 0 0 0-1 1v1.128a2.251 2.251 0 1 1-1.5 0V5.372a2.25 2.25 0 1 1 1.5 0v1.836A2.493 2.493 0 0 1 6 7h4a1 1 0 0 0 1-1v-.628A2.25 2.25 0 0 1 9.5 3.25Zm-6 0a.75.75 0 1 0 1.5 0 .75.75 0 0 0-1.5 0Zm8.25-.75a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5ZM4.25 12a.75.75 0 1 0 0 1.5.75.75 0 0 0 0-1.5Z"></path></svg></a><a style="--button-color:fg.muted" type="button" aria-label="Go to Tags page" href="/jwasham/coding-interview-university/tags" class="Box-sc-g0xbh4-0 fGwBZA prc-Button-ButtonBase-c50BI" data-loading="false" data-no-visuals="true" data-size="medium" data-variant="invisible" aria-describedby=":Rmlab:-loading-announcement"><svg aria-hidden="true" focusable="false" class="octicon octicon-tag" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1 7.775V2.75C1 1.784 1.784 1 2.75 1h5.025c.464 0 .91.184 1.238.513l6.25 6.25a1.75 1.75 0 0 1 0 2.474l-5.026 5.026a1.75 1.75 0 0 1-2.474 0l-6.25-6.25A1.752 1.752 0 0 1 1 7.775Zm1.5 0c0 .066.026.13.073.177l6.25 6.25a.25.25 0 0 0 .354 0l5.025-5.025a.25.25 0 0 0 0-.354l-6.25-6.25a.25.25 0 0 0-.177-.073H2.75a.25.25 0 0 0-.25.25ZM6 5a1 1 0 1 1 0 2 1 1 0 0 1 0-2Z"></path></svg></a></div></div><div class="Box-sc-g0xbh4-0 jxTzTd"><div class="Box-sc-g0xbh4-0 gqqBXN"><div class="Box-sc-g0xbh4-0 dzXgxt"><!--$--><div class="Box-sc-g0xbh4-0 iWFGlI"><span class="TextInputWrapper__StyledTextInputBaseWrapper-sc-1mqhpbi-0 hLzFvi TextInputWrapper__StyledTextInputWrapper-sc-1mqhpbi-1 iHYdQq TextInput-wrapper" data-leading-visual="true" data-trailing-visual="true" aria-busy="false"><span class="TextInput-icon" id=":R2j5ab:" aria-hidden="true"><svg aria-hidden="true" focusable="false" class="octicon octicon-search" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M10.68 11.74a6 6 0 0 1-7.922-8.982 6 6 0 0 1 8.982 7.922l3.04 3.04a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215ZM11.5 7a4.499 4.499 0 1 0-8.997 0A4.499 4.499 0 0 0 11.5 7Z"></path></svg></span><input type="text" aria-label="Go to file" role="combobox" aria-controls="file-results-list" aria-expanded="false" aria-haspopup="dialog" autoCorrect="off" spellcheck="false" placeholder="Go to file" aria-describedby=":R2j5ab: :R2j5abH1:" data-component="input" class="UnstyledTextInput__ToggledUnstyledTextInput-sc-14ypya-0 jkNcAv" value=""/><span class="TextInput-icon" id=":R2j5abH1:" aria-hidden="true"></span></span></div><!--/$--></div><div class="Box-sc-g0xbh4-0 YUPas"><button type="button" class="prc-Button-ButtonBase-c50BI" data-loading="false" data-no-visuals="true" data-size="medium" data-variant="default" aria-describedby=":Rr5ab:-loading-announcement"><span data-component="buttonContent" data-align="center" class="prc-Button-ButtonContent-HKbr-"><span data-component="text" class="prc-Button-Label-pTQ3x">Go to file</span></span></button></div><div class="react-directory-add-file-icon"></div><div class="react-directory-remove-file-icon"></div></div><button type="button" aria-haspopup="true" aria-expanded="false" tabindex="0" class="prc-Button-ButtonBase-c50BI" data-loading="false" data-size="medium" data-variant="primary" aria-describedby=":R55ab:-loading-announcement" id=":R55ab:"><span data-component="buttonContent" data-align="center" class="prc-Button-ButtonContent-HKbr-"><span data-component="leadingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="hide-sm" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="m11.28 3.22 4.25 4.25a.75.75 0 0 1 0 1.06l-4.25 4.25a.749.749 0 0 1-1.275-.326.749.749 0 0 1 .215-.734L13.94 8l-3.72-3.72a.749.749 0 0 1 .326-1.275.749.749 0 0 1 .734.215Zm-6.56 0a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042L2.06 8l3.72 3.72a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L.47 8.53a.75.75 0 0 1 0-1.06Z"></path></svg></span><span data-component="text" class="prc-Button-Label-pTQ3x">Code</span><span data-component="trailingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="octicon octicon-triangle-down" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="m4.427 7.427 3.396 3.396a.25.25 0 0 0 .354 0l3.396-3.396A.25.25 0 0 0 11.396 7H4.604a.25.25 0 0 0-.177.427Z"></path></svg></span></span></button><div class="Box-sc-g0xbh4-0 izFOf"><button data-component="IconButton" type="button" aria-label="Open more actions menu" aria-haspopup="true" aria-expanded="false" tabindex="0" class="prc-Button-ButtonBase-c50BI prc-Button-IconButton-szpyj" data-loading="false" data-no-visuals="true" data-size="medium" data-variant="default" aria-describedby=":R75ab:-loading-announcement" id=":R75ab:"><svg aria-hidden="true" focusable="false" class="octicon octicon-kebab-horizontal" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M8 9a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3ZM1.5 9a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Zm13 0a1.5 1.5 0 1 0 0-3 1.5 1.5 0 0 0 0 3Z"></path></svg></button></div></div></div><div class="Box-sc-g0xbh4-0 vIPPs"><div data-hpc="true"><button hidden="" data-testid="focus-next-element-button" data-hotkey="j"></button><button hidden="" data-testid="focus-previous-element-button" data-hotkey="k"></button><h2 class="sr-only ScreenReaderHeading-module__userSelectNone--vW4Cq prc-Heading-Heading-6CmGO" data-testid="screen-reader-heading" id="folders-and-files">Folders and files</h2><table aria-labelledby="folders-and-files" class="Box-sc-g0xbh4-0 fdROMU"><thead class="Box-sc-g0xbh4-0 jGKpsv"><tr class="Box-sc-g0xbh4-0 jdgHnn"><th colSpan="2" class="Box-sc-g0xbh4-0 bQivRW"><span class="text-bold">Name</span></th><th colSpan="1" class="Box-sc-g0xbh4-0 ldkMIO"><span class="text-bold">Name</span></th><th class="hide-sm"><div title="Last commit message" class="Truncate__StyledTruncate-sc-23o1d2-0 liVpTx width-fit"><span class="text-bold">Last commit message</span></div></th><th colSpan="1" class="Box-sc-g0xbh4-0 jMbWeI"><div title="Last commit date" class="Truncate__StyledTruncate-sc-23o1d2-0 liVpTx width-fit"><span class="text-bold">Last commit date</span></div></th></tr></thead><tbody><tr class="Box-sc-g0xbh4-0 gpqjiB"><td colSpan="3" class="bgColor-muted p-1 rounded-top-2"><div class="Box-sc-g0xbh4-0 dzCJzi"><h2 class="sr-only ScreenReaderHeading-module__userSelectNone--vW4Cq prc-Heading-Heading-6CmGO" data-testid="screen-reader-heading">Latest commit</h2><div style="width:120px" class="Skeleton Skeleton--text" data-testid="loading"> </div><div class="d-flex flex-shrink-0 gap-2"><div data-testid="latest-commit-details" class="d-none d-sm-flex flex-items-center"></div><div class="d-flex gap-2"><h2 class="sr-only ScreenReaderHeading-module__userSelectNone--vW4Cq prc-Heading-Heading-6CmGO" data-testid="screen-reader-heading">History</h2><a href="/jwasham/coding-interview-university/commits/main/" class="prc-Button-ButtonBase-c50BI d-none d-lg-flex LinkButton-module__code-view-link-button--xvCGA flex-items-center fgColor-default" data-loading="false" data-size="small" data-variant="invisible" aria-describedby=":Raqj8pab:-loading-announcement"><span data-component="buttonContent" data-align="center" class="prc-Button-ButtonContent-HKbr-"><span data-component="leadingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="octicon octicon-history" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="m.427 1.927 1.215 1.215a8.002 8.002 0 1 1-1.6 5.685.75.75 0 1 1 1.493-.154 6.5 6.5 0 1 0 1.18-4.458l1.358 1.358A.25.25 0 0 1 3.896 6H.25A.25.25 0 0 1 0 5.75V2.104a.25.25 0 0 1 .427-.177ZM7.75 4a.75.75 0 0 1 .75.75v2.992l2.028.812a.75.75 0 0 1-.557 1.392l-2.5-1A.751.751 0 0 1 7 8.25v-3.5A.75.75 0 0 1 7.75 4Z"></path></svg></span><span data-component="text" class="prc-Button-Label-pTQ3x"><span class="fgColor-default">2,511 Commits</span></span></span></a><div class="d-sm-none"></div><div class="d-flex d-lg-none"><span role="tooltip" aria-label="2,511 Commits" id="history-icon-button-tooltip" class="Tooltip__TooltipBase-sc-17tf59c-0 hWlpPn tooltipped-n"><a href="/jwasham/coding-interview-university/commits/main/" class="prc-Button-ButtonBase-c50BI LinkButton-module__code-view-link-button--xvCGA flex-items-center fgColor-default" data-loading="false" data-size="small" data-variant="invisible" aria-describedby=":R1iqj8pab:-loading-announcement history-icon-button-tooltip"><span data-component="buttonContent" data-align="center" class="prc-Button-ButtonContent-HKbr-"><span data-component="leadingVisual" class="prc-Button-Visual-2epfX prc-Button-VisualWrap-Db-eB"><svg aria-hidden="true" focusable="false" class="octicon octicon-history" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="m.427 1.927 1.215 1.215a8.002 8.002 0 1 1-1.6 5.685.75.75 0 1 1 1.493-.154 6.5 6.5 0 1 0 1.18-4.458l1.358 1.358A.25.25 0 0 1 3.896 6H.25A.25.25 0 0 1 0 5.75V2.104a.25.25 0 0 1 .427-.177ZM7.75 4a.75.75 0 0 1 .75.75v2.992l2.028.812a.75.75 0 0 1-.557 1.392l-2.5-1A.751.751 0 0 1 7 8.25v-3.5A.75.75 0 0 1 7.75 4Z"></path></svg></span></span></a></span></div></div></div></div></td></tr><tr class="react-directory-row undefined" id="folder-row-0"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="icon-directory" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1.75 1A1.75 1.75 0 0 0 0 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0 0 16 13.25v-8.5A1.75 1.75 0 0 0 14.25 3H7.5a.25.25 0 0 1-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="This path skips through empty directories" aria-label=".github/workflows, (Directory)" class="Link--primary" href="/jwasham/coding-interview-university/tree/main/.github/workflows"><span class="react-directory-default-color" data-testid="path-name-segment">.github/</span><span class="" data-testid="path-name-segment">workflows</span></a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="icon-directory" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1.75 1A1.75 1.75 0 0 0 0 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0 0 16 13.25v-8.5A1.75 1.75 0 0 0 14.25 3H7.5a.25.25 0 0 1-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="This path skips through empty directories" aria-label=".github/workflows, (Directory)" class="Link--primary" href="/jwasham/coding-interview-university/tree/main/.github/workflows"><span class="react-directory-default-color" data-testid="path-name-segment">.github/</span><span class="" data-testid="path-name-segment">workflows</span></a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="react-directory-row undefined" id="folder-row-1"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="icon-directory" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1.75 1A1.75 1.75 0 0 0 0 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0 0 16 13.25v-8.5A1.75 1.75 0 0 0 14.25 3H7.5a.25.25 0 0 1-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="This path skips through empty directories" aria-label="extras/cheat sheets, (Directory)" class="Link--primary" href="/jwasham/coding-interview-university/tree/main/extras/cheat%20sheets"><span class="react-directory-default-color" data-testid="path-name-segment">extras/</span><span class="" data-testid="path-name-segment">cheat sheets</span></a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="icon-directory" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1.75 1A1.75 1.75 0 0 0 0 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0 0 16 13.25v-8.5A1.75 1.75 0 0 0 14.25 3H7.5a.25.25 0 0 1-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="This path skips through empty directories" aria-label="extras/cheat sheets, (Directory)" class="Link--primary" href="/jwasham/coding-interview-university/tree/main/extras/cheat%20sheets"><span class="react-directory-default-color" data-testid="path-name-segment">extras/</span><span class="" data-testid="path-name-segment">cheat sheets</span></a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="react-directory-row undefined" id="folder-row-2"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="icon-directory" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1.75 1A1.75 1.75 0 0 0 0 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0 0 16 13.25v-8.5A1.75 1.75 0 0 0 14.25 3H7.5a.25.25 0 0 1-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="translations" aria-label="translations, (Directory)" class="Link--primary" href="/jwasham/coding-interview-university/tree/main/translations">translations</a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="icon-directory" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M1.75 1A1.75 1.75 0 0 0 0 2.75v10.5C0 14.216.784 15 1.75 15h12.5A1.75 1.75 0 0 0 16 13.25v-8.5A1.75 1.75 0 0 0 14.25 3H7.5a.25.25 0 0 1-.2-.1l-.9-1.2C6.07 1.26 5.55 1 5 1H1.75Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="translations" aria-label="translations, (Directory)" class="Link--primary" href="/jwasham/coding-interview-university/tree/main/translations">translations</a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="react-directory-row undefined" id="folder-row-3"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title=".gitignore" aria-label=".gitignore, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/.gitignore">.gitignore</a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title=".gitignore" aria-label=".gitignore, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/.gitignore">.gitignore</a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="react-directory-row undefined" id="folder-row-4"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="LICENSE.txt" aria-label="LICENSE.txt, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/LICENSE.txt">LICENSE.txt</a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="LICENSE.txt" aria-label="LICENSE.txt, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/LICENSE.txt">LICENSE.txt</a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="react-directory-row undefined" id="folder-row-5"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="README.md" aria-label="README.md, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/README.md">README.md</a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="README.md" aria-label="README.md, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/README.md">README.md</a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="react-directory-row undefined" id="folder-row-6"><td class="react-directory-row-name-cell-small-screen" colSpan="2"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="programming-language-resources.md" aria-label="programming-language-resources.md, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/programming-language-resources.md">programming-language-resources.md</a></div></div></div></div></td><td class="react-directory-row-name-cell-large-screen" colSpan="1"><div class="react-directory-filename-column"><svg aria-hidden="true" focusable="false" class="color-fg-muted" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M2 1.75C2 .784 2.784 0 3.75 0h6.586c.464 0 .909.184 1.237.513l2.914 2.914c.329.328.513.773.513 1.237v9.586A1.75 1.75 0 0 1 13.25 16h-9.5A1.75 1.75 0 0 1 2 14.25Zm1.75-.25a.25.25 0 0 0-.25.25v12.5c0 .138.112.25.25.25h9.5a.25.25 0 0 0 .25-.25V6h-2.75A1.75 1.75 0 0 1 9 4.25V1.5Zm6.75.062V4.25c0 .138.112.25.25.25h2.688l-.011-.013-2.914-2.914-.013-.011Z"></path></svg><div class="overflow-hidden"><div class="react-directory-filename-cell"><div class="react-directory-truncate"><a title="programming-language-resources.md" aria-label="programming-language-resources.md, (File)" class="Link--primary" href="/jwasham/coding-interview-university/blob/main/programming-language-resources.md">programming-language-resources.md</a></div></div></div></div></td><td class="react-directory-row-commit-cell"><div class="Skeleton Skeleton--text"> </div></td><td><div class="Skeleton Skeleton--text"> </div></td></tr><tr class="Box-sc-g0xbh4-0 eNCcrz d-none" data-testid="view-all-files-row"><td colSpan="3" class="Box-sc-g0xbh4-0 bHTcCe"><div><button class="prc-Link-Link-85e08">View all files</button></div></td></tr></tbody></table></div><div class="Box-sc-g0xbh4-0 csrIcr"><div class="Box-sc-g0xbh4-0 bUQNHB"><div itemscope="" itemType="https://schema.org/abstract" class="Box-sc-g0xbh4-0 jPdcfu"><h2 class="_VisuallyHidden__VisuallyHidden-sc-11jhm7a-0 brGdpi">Repository files navigation</h2><nav class="UnderlineTabbedInterface__StyledComponentUnderlineWrapper-sc-4ilrg0-0 eBevHz" aria-label="Repository files"><ul role="list" class="UnderlineTabbedInterface__StyledComponentUnderlineItemList-sc-4ilrg0-1 ehEdWC"><li class="Box-sc-g0xbh4-0 hUCRAk"><a href="#" aria-current="page" class="UnderlineTabbedInterface__StyledUnderlineItem-sc-4ilrg0-2 beOdPj"><span data-component="icon"><svg aria-hidden="true" focusable="false" class="octicon octicon-book" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M0 1.75A.75.75 0 0 1 .75 1h4.253c1.227 0 2.317.59 3 1.501A3.743 3.743 0 0 1 11.006 1h4.245a.75.75 0 0 1 .75.75v10.5a.75.75 0 0 1-.75.75h-4.507a2.25 2.25 0 0 0-1.591.659l-.622.621a.75.75 0 0 1-1.06 0l-.622-.621A2.25 2.25 0 0 0 5.258 13H.75a.75.75 0 0 1-.75-.75Zm7.251 10.324.004-5.073-.002-2.253A2.25 2.25 0 0 0 5.003 2.5H1.5v9h3.757a3.75 3.75 0 0 1 1.994.574ZM8.755 4.75l-.004 7.322a3.752 3.752 0 0 1 1.992-.572H14.5v-9h-3.495a2.25 2.25 0 0 0-2.25 2.25Z"></path></svg></span><span data-component="text" data-content="README">README</span></a></li><li class="Box-sc-g0xbh4-0 hUCRAk"><a href="#" class="UnderlineTabbedInterface__StyledUnderlineItem-sc-4ilrg0-2 beOdPj"><span data-component="icon"><svg aria-hidden="true" focusable="false" class="octicon octicon-law" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M8.75.75V2h.985c.304 0 .603.08.867.231l1.29.736c.038.022.08.033.124.033h2.234a.75.75 0 0 1 0 1.5h-.427l2.111 4.692a.75.75 0 0 1-.154.838l-.53-.53.529.531-.001.002-.002.002-.006.006-.006.005-.01.01-.045.04c-.21.176-.441.327-.686.45C14.556 10.78 13.88 11 13 11a4.498 4.498 0 0 1-2.023-.454 3.544 3.544 0 0 1-.686-.45l-.045-.04-.016-.015-.006-.006-.004-.004v-.001a.75.75 0 0 1-.154-.838L12.178 4.5h-.162c-.305 0-.604-.079-.868-.231l-1.29-.736a.245.245 0 0 0-.124-.033H8.75V13h2.5a.75.75 0 0 1 0 1.5h-6.5a.75.75 0 0 1 0-1.5h2.5V3.5h-.984a.245.245 0 0 0-.124.033l-1.289.737c-.265.15-.564.23-.869.23h-.162l2.112 4.692a.75.75 0 0 1-.154.838l-.53-.53.529.531-.001.002-.002.002-.006.006-.016.015-.045.04c-.21.176-.441.327-.686.45C4.556 10.78 3.88 11 3 11a4.498 4.498 0 0 1-2.023-.454 3.544 3.544 0 0 1-.686-.45l-.045-.04-.016-.015-.006-.006-.004-.004v-.001a.75.75 0 0 1-.154-.838L2.178 4.5H1.75a.75.75 0 0 1 0-1.5h2.234a.249.249 0 0 0 .125-.033l1.288-.737c.265-.15.564-.23.869-.23h.984V.75a.75.75 0 0 1 1.5 0Zm2.945 8.477c.285.135.718.273 1.305.273s1.02-.138 1.305-.273L13 6.327Zm-10 0c.285.135.718.273 1.305.273s1.02-.138 1.305-.273L3 6.327Z"></path></svg></span><span data-component="text" data-content="CC-BY-SA-4.0 license">CC-BY-SA-4.0 license</span></a></li></ul></nav><button style="--button-color:fg.subtle" type="button" aria-label="Outline" aria-haspopup="true" aria-expanded="false" tabindex="0" class="Box-sc-g0xbh4-0 cwoBXV prc-Button-ButtonBase-c50BI" data-loading="false" data-size="medium" data-variant="invisible" aria-describedby=":Rr9ab:-loading-announcement" id=":Rr9ab:"><svg aria-hidden="true" focusable="false" class="octicon octicon-list-unordered" viewBox="0 0 16 16" width="16" height="16" fill="currentColor" style="display:inline-block;user-select:none;vertical-align:text-bottom;overflow:visible"><path d="M5.75 2.5h8.5a.75.75 0 0 1 0 1.5h-8.5a.75.75 0 0 1 0-1.5Zm0 5h8.5a.75.75 0 0 1 0 1.5h-8.5a.75.75 0 0 1 0-1.5Zm0 5h8.5a.75.75 0 0 1 0 1.5h-8.5a.75.75 0 0 1 0-1.5ZM2 14a1 1 0 1 1 0-2 1 1 0 0 1 0 2Zm1-6a1 1 0 1 1-2 0 1 1 0 0 1 2 0ZM2 4a1 1 0 1 1 0-2 1 1 0 0 1 0 2Z"></path></svg></button></div><div class="Box-sc-g0xbh4-0 QkQOb js-snippet-clipboard-copy-unpositioned undefined" data-hpc="true"><article class="markdown-body entry-content container-lg" itemprop="text"><div class="markdown-heading" dir="auto"><h1 tabindex="-1" class="heading-element" dir="auto">Coding Interview University</h1><a id="user-content-coding-interview-university" class="anchor" aria-label="Permalink: Coding Interview University" href="#coding-interview-university"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <blockquote> <p dir="auto">I originally created this as a short to-do list of study topics for becoming a software engineer, but it grew to the large list you see today. After going through this study plan, <a href="https://startupnextdoor.com/ive-been-acquired-by-amazon/?src=ciu" rel="nofollow">I got hired as a Software Development Engineer at Amazon</a>! You probably won't have to study as much as I did. Anyway, everything you need is here.</p> <p dir="auto">I studied about 8-12 hours a day, for several months. This is my story: <a href="https://medium.freecodecamp.org/why-i-studied-full-time-for-8-months-for-a-google-interview-cc662ce9bb13" rel="nofollow">Why I studied full-time for 8 months for a Google interview</a></p> <p dir="auto"><strong>Please Note:</strong> You won't need to study as much as I did. I wasted a lot of time on things I didn't need to know. More info about that is below. I'll help you get there without wasting your precious time.</p> <p dir="auto">The items listed here will prepare you well for a technical interview at just about any software company, including the giants: Amazon, Facebook, Google, and Microsoft.</p> <p dir="auto"><em>Best of luck to you!</em></p> </blockquote> <details> <summary>Translations:</summary> <ul dir="auto"> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-id.md">Bahasa Indonesia</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-bg.md">Bulgarian</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-es.md">Español</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-de.md">German</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-ja.md">Japanese (日本語)</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-mr.md">Marathi</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-pl.md">Polish</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-ptbr.md">Português Brasileiro</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-ru.md">Russian</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-vi.md">Tiếng Việt - Vietnamese</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-ur.md">Urdu - اردو</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-uz.md">Uzbek</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-bn.md">বাংলা - Bangla</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-kh.md">ខ្មែរ - Khmer</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-cn.md">简体中文</a></li> <li><a href="/jwasham/coding-interview-university/blob/main/translations/README-tw.md">繁體中文</a></li> </ul> </details> <details> <summary>Translations in progress:</summary> <ul dir="auto"> <li><a href="https://github.com/jwasham/coding-interview-university/issues/1164" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/1164/hovercard">Afrikaans</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/98" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/98/hovercard">Arabic</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/89" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/89/hovercard">French</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/166" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/166/hovercard">Greek</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/1030" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/1030/hovercard">Italian</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/118" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/118/hovercard">Korean(한국어)</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/239" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/239/hovercard">Malayalam</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/186" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/186/hovercard">Persian - Farsi</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/117" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/117/hovercard">Telugu</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/156" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/156/hovercard">Thai</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/90" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/90/hovercard">Turkish</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/106" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/106/hovercard">Українська</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/82" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/82/hovercard">עברית</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/issues/81" data-hovercard-type="issue" data-hovercard-url="/jwasham/coding-interview-university/issues/81/hovercard">हिन्दी</a></li> </ul> </details> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">What is it?</h2><a id="user-content-what-is-it" class="anchor" aria-label="Permalink: What is it?" href="#what-is-it"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto"><a target="_blank" rel="noopener noreferrer nofollow" href="https://camo.githubusercontent.com/8c889e19270293b87b4569c4edb3a024d4a586a37d6529c74a9f26d276f364de/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f636f64696e672d61742d7468652d7768697465626f6172642d73696c69636f6e2d76616c6c65792e706e67"><img src="https://camo.githubusercontent.com/8c889e19270293b87b4569c4edb3a024d4a586a37d6529c74a9f26d276f364de/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f636f64696e672d61742d7468652d7768697465626f6172642d73696c69636f6e2d76616c6c65792e706e67" alt="Coding at the whiteboard - from HBO's Silicon Valley" data-canonical-src="https://d3j2pkmjtin6ou.cloudfront.net/coding-at-the-whiteboard-silicon-valley.png" style="max-width: 100%;"></a></p> <p dir="auto">This is my multi-month study plan for becoming a software engineer for a large company.</p> <p dir="auto"><strong>Required:</strong></p> <ul dir="auto"> <li>A little experience with coding (variables, loops, methods/functions, etc)</li> <li>Patience</li> <li>Time</li> </ul> <p dir="auto">Note this is a study plan for <strong>software engineering</strong>, not frontend engineering or full-stack development. There are really super roadmaps and coursework for those career paths elsewhere (see <a href="https://roadmap.sh/" rel="nofollow">https://roadmap.sh/</a> for more info).</p> <p dir="auto">There is a lot to learn in a university Computer Science program, but only knowing about 75% is good enough for an interview, so that's what I cover here. For a complete CS self-taught program, the resources for my study plan have been included in Kamran Ahmed's Computer Science Roadmap: <a href="https://roadmap.sh/computer-science" rel="nofollow">https://roadmap.sh/computer-science</a></p> <hr> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Table of Contents</h2><a id="user-content-table-of-contents" class="anchor" aria-label="Permalink: Table of Contents" href="#table-of-contents"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">The Study Plan</h3><a id="user-content-the-study-plan" class="anchor" aria-label="Permalink: The Study Plan" href="#the-study-plan"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="#what-is-it">What is it?</a></li> <li><a href="#why-use-it">Why use it?</a></li> <li><a href="#how-to-use-it">How to use it</a></li> <li><a href="#dont-feel-you-arent-smart-enough">Don't feel you aren't smart enough</a></li> <li><a href="#a-note-about-video-resources">A Note About Video Resources</a></li> <li><a href="#choose-a-programming-language">Choose a Programming Language</a></li> <li><a href="#books-for-data-structures-and-algorithms">Books for Data Structures and Algorithms</a></li> <li><a href="#interview-prep-books">Interview Prep Books</a></li> <li><a href="#dont-make-my-mistakes">Don't Make My Mistakes</a></li> <li><a href="#what-you-wont-see-covered">What you Won't See Covered</a></li> <li><a href="#the-daily-plan">The Daily Plan</a></li> <li><a href="#coding-question-practice">Coding Question Practice</a></li> <li><a href="#coding-problems">Coding Problems</a></li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Topics of Study</h3><a id="user-content-topics-of-study" class="anchor" aria-label="Permalink: Topics of Study" href="#topics-of-study"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="#algorithmic-complexity--big-o--asymptotic-analysis">Algorithmic complexity / Big-O / Asymptotic analysis</a></li> <li><a href="#data-structures">Data Structures</a> <ul dir="auto"> <li><a href="#arrays">Arrays</a></li> <li><a href="#linked-lists">Linked Lists</a></li> <li><a href="#stack">Stack</a></li> <li><a href="#queue">Queue</a></li> <li><a href="#hash-table">Hash table</a></li> </ul> </li> <li><a href="#more-knowledge">More Knowledge</a> <ul dir="auto"> <li><a href="#binary-search">Binary search</a></li> <li><a href="#bitwise-operations">Bitwise operations</a></li> </ul> </li> <li><a href="#trees">Trees</a> <ul dir="auto"> <li><a href="#trees---intro">Trees - Intro</a></li> <li><a href="#binary-search-trees-bsts">Binary search trees: BSTs</a></li> <li><a href="#heap--priority-queue--binary-heap">Heap / Priority Queue / Binary Heap</a></li> <li>balanced search trees (general concept, not details)</li> <li>traversals: preorder, inorder, postorder, BFS, DFS</li> </ul> </li> <li><a href="#sorting">Sorting</a> <ul dir="auto"> <li>selection</li> <li>insertion</li> <li>heapsort</li> <li>quicksort</li> <li>mergesort</li> </ul> </li> <li><a href="#graphs">Graphs</a> <ul dir="auto"> <li>directed</li> <li>undirected</li> <li>adjacency matrix</li> <li>adjacency list</li> <li>traversals: BFS, DFS</li> </ul> </li> <li><a href="#even-more-knowledge">Even More Knowledge</a> <ul dir="auto"> <li><a href="#recursion">Recursion</a></li> <li><a href="#dynamic-programming">Dynamic Programming</a></li> <li><a href="#design-patterns">Design Patterns</a></li> <li><a href="#combinatorics-n-choose-k--probability">Combinatorics (n choose k) & Probability</a></li> <li><a href="#np-np-complete-and-approximation-algorithms">NP, NP-Complete and Approximation Algorithms</a></li> <li><a href="#how-computers-process-a-program">How computers process a program</a></li> <li><a href="#caches">Caches</a></li> <li><a href="#processes-and-threads">Processes and Threads</a></li> <li><a href="#testing">Testing</a></li> <li><a href="#string-searching--manipulations">String searching & manipulations</a></li> <li><a href="#tries">Tries</a></li> <li><a href="#floating-point-numbers">Floating Point Numbers</a></li> <li><a href="#unicode">Unicode</a></li> <li><a href="#endianness">Endianness</a></li> <li><a href="#networking">Networking</a></li> </ul> </li> <li><a href="#final-review">Final Review</a></li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Getting the Job</h3><a id="user-content-getting-the-job" class="anchor" aria-label="Permalink: Getting the Job" href="#getting-the-job"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="#update-your-resume">Update Your Resume</a></li> <li><a href="#find-a-job">Find a Job</a></li> <li><a href="#interview-process--general-interview-prep">Interview Process & General Interview Prep</a></li> <li><a href="#be-thinking-of-for-when-the-interview-comes">Be thinking of for when the interview comes</a></li> <li><a href="#have-questions-for-the-interviewer">Have questions for the interviewer</a></li> <li><a href="#once-youve-got-the-job">Once You've Got The Job</a></li> </ul> <p dir="auto"><strong>---------------- Everything below this point is optional ----------------</strong></p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Optional Extra Topics & Resources</h3><a id="user-content-optional-extra-topics--resources" class="anchor" aria-label="Permalink: Optional Extra Topics & Resources" href="#optional-extra-topics--resources"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="#additional-books">Additional Books</a></li> <li><a href="#system-design-scalability-data-handling">System Design, Scalability, Data Handling</a> (if you have 4+ years experience)</li> <li><a href="#additional-learning">Additional Learning</a> <ul dir="auto"> <li><a href="#compilers">Compilers</a></li> <li><a href="#emacs-and-vim">Emacs and vi(m)</a></li> <li><a href="#unix-command-line-tools">Unix command line tools</a></li> <li><a href="#information-theory-videos">Information theory</a></li> <li><a href="#parity--hamming-code-videos">Parity & Hamming Code</a></li> <li><a href="#entropy">Entropy</a></li> <li><a href="#cryptography">Cryptography</a></li> <li><a href="#compression">Compression</a></li> <li><a href="#computer-security">Computer Security</a></li> <li><a href="#garbage-collection">Garbage collection</a></li> <li><a href="#parallel-programming">Parallel Programming</a></li> <li><a href="#messaging-serialization-and-queueing-systems">Messaging, Serialization, and Queueing Systems</a></li> <li><a href="#a">A*</a></li> <li><a href="#fast-fourier-transform">Fast Fourier Transform</a></li> <li><a href="#bloom-filter">Bloom Filter</a></li> <li><a href="#hyperloglog">HyperLogLog</a></li> <li><a href="#locality-sensitive-hashing">Locality-Sensitive Hashing</a></li> <li><a href="#van-emde-boas-trees">van Emde Boas Trees</a></li> <li><a href="#augmented-data-structures">Augmented Data Structures</a></li> <li><a href="#balanced-search-trees">Balanced search trees</a> <ul dir="auto"> <li>AVL trees</li> <li>Splay trees</li> <li>Red/black trees</li> <li>2-3 search trees</li> <li>2-3-4 Trees (aka 2-4 trees)</li> <li>N-ary (K-ary, M-ary) trees</li> <li>B-Trees</li> </ul> </li> <li><a href="#k-d-trees">k-D Trees</a></li> <li><a href="#skip-lists">Skip lists</a></li> <li><a href="#network-flows">Network Flows</a></li> <li><a href="#disjoint-sets--union-find">Disjoint Sets & Union Find</a></li> <li><a href="#math-for-fast-processing">Math for Fast Processing</a></li> <li><a href="#treap">Treap</a></li> <li><a href="#linear-programming-videos">Linear Programming</a></li> <li><a href="#geometry-convex-hull-videos">Geometry, Convex hull</a></li> <li><a href="#discrete-math">Discrete math</a></li> </ul> </li> <li><a href="#additional-detail-on-some-subjects">Additional Detail on Some Subjects</a></li> <li><a href="#video-series">Video Series</a></li> <li><a href="#computer-science-courses">Computer Science Courses</a></li> <li><a href="#papers">Papers</a></li> </ul> <hr> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Why use it?</h2><a id="user-content-why-use-it" class="anchor" aria-label="Permalink: Why use it?" href="#why-use-it"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">If you want to work as a software engineer for a large company, these are the things you have to know.</p> <p dir="auto">If you missed out on getting a degree in computer science, like I did, this will catch you up and save four years of your life.</p> <p dir="auto">When I started this project, I didn't know a stack from a heap, didn't know Big-O anything, or anything about trees, or how to traverse a graph. If I had to code a sorting algorithm, I can tell ya it would have been terrible. Every data structure I had ever used was built into the language, and I didn't know how they worked under the hood at all. I never had to manage memory unless a process I was running would give an "out of memory" error, and then I'd have to find a workaround. I used a few multidimensional arrays in my life and thousands of associative arrays, but I never created data structures from scratch.</p> <p dir="auto">It's a long plan. It may take you months. If you are familiar with a lot of this already it will take you a lot less time.</p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">How to use it</h2><a id="user-content-how-to-use-it" class="anchor" aria-label="Permalink: How to use it" href="#how-to-use-it"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Everything below is an outline, and you should tackle the items in order from top to bottom.</p> <p dir="auto">I'm using GitHub's special markdown flavor, including tasks lists to track progress.</p> <ul dir="auto"> <li><a href="https://guides.github.com/features/mastering-markdown/#GitHub-flavored-markdown">More about GitHub-flavored markdown</a></li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">If you don't want to use git</h3><a id="user-content-if-you-dont-want-to-use-git" class="anchor" aria-label="Permalink: If you don't want to use git" href="#if-you-dont-want-to-use-git"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">On this page, click the Code button near the top, then click "Download ZIP". Unzip the file and you can work with the text files.</p> <p dir="auto">If you're open in a code editor that understands markdown, you'll see everything formatted nicely.</p> <p dir="auto"><a target="_blank" rel="noopener noreferrer nofollow" href="https://camo.githubusercontent.com/d978fd57421706891a262cf334d878f252c956cdde4e04ed839d5651060f5460/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f686f772d746f2d646f776e6c6f61642d61732d7a69702e706e67"><img src="https://camo.githubusercontent.com/d978fd57421706891a262cf334d878f252c956cdde4e04ed839d5651060f5460/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f686f772d746f2d646f776e6c6f61642d61732d7a69702e706e67" alt="How to download the repo as a zip file" data-canonical-src="https://d3j2pkmjtin6ou.cloudfront.net/how-to-download-as-zip.png" style="max-width: 100%;"></a></p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">If you're comfortable with git</h3><a id="user-content-if-youre-comfortable-with-git" class="anchor" aria-label="Permalink: If you're comfortable with git" href="#if-youre-comfortable-with-git"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Create a new branch so you can check items like this, just put an x in the brackets: [x]</p> <ol dir="auto"> <li> <p dir="auto"><em><strong>Fork the GitHub repo:</strong></em> <code>https://github.com/jwasham/coding-interview-university</code> by clicking on the Fork button.</p> <p dir="auto"><a target="_blank" rel="noopener noreferrer nofollow" href="https://camo.githubusercontent.com/f9c7278a5fb5a4cdaec00d3b6e20298a8037411eb5733b23d3c7875b6f1fcc5f/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f666f726b2d627574746f6e2e706e67"><img src="https://camo.githubusercontent.com/f9c7278a5fb5a4cdaec00d3b6e20298a8037411eb5733b23d3c7875b6f1fcc5f/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f666f726b2d627574746f6e2e706e67" alt="Fork the GitHub repo" data-canonical-src="https://d3j2pkmjtin6ou.cloudfront.net/fork-button.png" style="max-width: 100%;"></a></p> </li> <li> <p dir="auto">Clone to your local repo:</p> <div class="highlight highlight-source-shell notranslate position-relative overflow-auto" dir="auto" data-snippet-clipboard-copy-content="git clone https://github.com/<YOUR_GITHUB_USERNAME>/coding-interview-university.git cd coding-interview-university git remote add upstream https://github.com/jwasham/coding-interview-university.git git remote set-url --push upstream DISABLE # so that you don't push your personal progress back to the original repo"><pre>git clone https://github.com/<span class="pl-k"><</span>YOUR_GITHUB_USERNAME<span class="pl-k">></span>/coding-interview-university.git <span class="pl-c1">cd</span> coding-interview-university git remote add upstream https://github.com/jwasham/coding-interview-university.git git remote set-url --push upstream DISABLE <span class="pl-c"><span class="pl-c">#</span> so that you don't push your personal progress back to the original repo</span></pre></div> </li> <li> <p dir="auto">Mark all boxes with X after you completed your changes:</p> <div class="highlight highlight-source-shell notranslate position-relative overflow-auto" dir="auto" data-snippet-clipboard-copy-content="git commit -am "Marked personal progress" git pull upstream main # keep your fork up-to-date with changes from the original repo git push # just pushes to your fork"><pre>git commit -am <span class="pl-s"><span class="pl-pds">"</span>Marked personal progress<span class="pl-pds">"</span></span> git pull upstream main <span class="pl-c"><span class="pl-c">#</span> keep your fork up-to-date with changes from the original repo</span> git push <span class="pl-c"><span class="pl-c">#</span> just pushes to your fork</span></pre></div> </li> </ol> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Don't feel you aren't smart enough</h2><a id="user-content-dont-feel-you-arent-smart-enough" class="anchor" aria-label="Permalink: Don't feel you aren't smart enough" href="#dont-feel-you-arent-smart-enough"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Successful software engineers are smart, but many have an insecurity that they aren't smart enough.</li> <li>The following videos may help you overcome this insecurity: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=0SARbwvhupQ" rel="nofollow">The myth of the Genius Programmer</a></li> <li><a href="https://www.youtube.com/watch?v=1i8ylq4j_EY" rel="nofollow">It's Dangerous to Go Alone: Battling the Invisible Monsters in Tech</a></li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">A Note About Video Resources</h2><a id="user-content-a-note-about-video-resources" class="anchor" aria-label="Permalink: A Note About Video Resources" href="#a-note-about-video-resources"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Some videos are available only by enrolling in a Coursera or EdX class. These are called MOOCs. Sometimes the classes are not in session so you have to wait a couple of months, so you have no access.</p> <p dir="auto">It would be great to replace the online course resources with free and always-available public sources, such as YouTube videos (preferably university lectures), so that you people can study these anytime, not just when a specific online course is in session.</p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Choose a Programming Language</h2><a id="user-content-choose-a-programming-language" class="anchor" aria-label="Permalink: Choose a Programming Language" href="#choose-a-programming-language"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">You'll need to choose a programming language for the coding interviews you do, but you'll also need to find a language that you can use to study computer science concepts.</p> <p dir="auto">Preferably the language would be the same, so that you only need to be proficient in one.</p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">For this Study Plan</h3><a id="user-content-for-this-study-plan" class="anchor" aria-label="Permalink: For this Study Plan" href="#for-this-study-plan"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">When I did the study plan, I used 2 languages for most of it: C and Python</p> <ul dir="auto"> <li>C: Very low level. Allows you to deal with pointers and memory allocation/deallocation, so you feel the data structures and algorithms in your bones. In higher-level languages like Python or Java, these are hidden from you. In day-to-day work, that's terrific, but when you're learning how these low-level data structures are built, it's great to feel close to the metal. <ul dir="auto"> <li>C is everywhere. You'll see examples in books, lectures, videos, <em>everywhere</em> while you're studying.</li> <li><a href="https://www.amazon.com/Programming-Language-Brian-W-Kernighan/dp/0131103628" rel="nofollow">The C Programming Language, 2nd Edition</a> <ul dir="auto"> <li>This is a short book, but it will give you a great handle on the C language and if you practice it a little you'll quickly get proficient. Understanding C helps you understand how programs and memory work.</li> <li>You don't need to go super deep in the book (or even finish it). Just get to where you're comfortable reading and writing in C.</li> </ul> </li> </ul> </li> <li>Python: Modern and very expressive, I learned it because it's just super useful and also allows me to write less code in an interview.</li> </ul> <p dir="auto">This is my preference. You do what you like, of course.</p> <p dir="auto">You may not need it, but here are some sites for learning a new language:</p> <ul dir="auto"> <li><a href="https://exercism.org/tracks" rel="nofollow">Exercism</a></li> <li><a href="http://www.codewars.com" rel="nofollow">Codewars</a></li> <li><a href="https://www.hackerearth.com/for-developers/" rel="nofollow">HackerEarth</a></li> <li><a href="https://www.scaler.com/topics/" rel="nofollow">Scaler Topics (Java, C++)</a></li> <li><a href="https://programiz.pro/" rel="nofollow">Programiz PRO Community Challenges)</a></li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">For your Coding Interview</h3><a id="user-content-for-your-coding-interview" class="anchor" aria-label="Permalink: For your Coding Interview" href="#for-your-coding-interview"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">You can use a language you are comfortable in to do the coding part of the interview, but for large companies, these are solid choices:</p> <ul dir="auto"> <li>C++</li> <li>Java</li> <li>Python</li> </ul> <p dir="auto">You could also use these, but read around first. There may be caveats:</p> <ul dir="auto"> <li>JavaScript</li> <li>Ruby</li> </ul> <p dir="auto">Here is an article I wrote about choosing a language for the interview: <a href="https://startupnextdoor.com/important-pick-one-language-for-the-coding-interview/" rel="nofollow">Pick One Language for the Coding Interview</a>. This is the original article my post was based on: <a href="https://web.archive.org/web/20210516054124/http://blog.codingforinterviews.com/best-programming-language-jobs/" rel="nofollow">Choosing a Programming Language for Interviews</a></p> <p dir="auto">You need to be very comfortable in the language and be knowledgeable.</p> <p dir="auto">Read more about choices:</p> <ul dir="auto"> <li><a href="http://www.byte-by-byte.com/choose-the-right-language-for-your-coding-interview/" rel="nofollow">Choose the Right Language for Your Coding Interview</a></li> </ul> <p dir="auto"><a href="/jwasham/coding-interview-university/blob/main/programming-language-resources.md">See language-specific resources here</a></p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Books for Data Structures and Algorithms</h2><a id="user-content-books-for-data-structures-and-algorithms" class="anchor" aria-label="Permalink: Books for Data Structures and Algorithms" href="#books-for-data-structures-and-algorithms"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">This book will form your foundation for computer science.</p> <p dir="auto">Just choose one, in a language that you will be comfortable with. You'll be doing a lot of reading and coding.</p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Python</h3><a id="user-content-python" class="anchor" aria-label="Permalink: Python" href="#python"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://geni.us/q7svoz" rel="nofollow">Coding Interview Patterns: Nail Your Next Coding Interview</a> (<strong>Main Recommendation</strong>) <ul dir="auto"> <li>An insider’s perspective on what interviewers are truly looking for and why.</li> <li>101 real coding interview problems with detailed solutions.</li> <li>Intuitive explanations that guide you through each problem as if you were solving it in a live interview.</li> <li>1000+ diagrams to illustrate key concepts and patterns.</li> </ul> </li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">C</h3><a id="user-content-c" class="anchor" aria-label="Permalink: C" href="#c"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.amazon.com/Algorithms-Parts-1-5-Bundle-Fundamentals/dp/0201756080" rel="nofollow">Algorithms in C, Parts 1-5 (Bundle), 3rd Edition</a> <ul dir="auto"> <li>Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms</li> </ul> </li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Java</h3><a id="user-content-java" class="anchor" aria-label="Permalink: Java" href="#java"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Your choice:</p> <ul dir="auto"> <li>Goodrich, Tamassia, Goldwasser <ul dir="auto"> <li><a href="https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/1118771338/" rel="nofollow">Data Structures and Algorithms in Java</a></li> </ul> </li> <li>Sedgewick and Wayne: <ul dir="auto"> <li><a href="https://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X/" rel="nofollow">Algorithms</a></li> <li>Free Coursera course that covers the book (taught by the authors!): <ul dir="auto"> <li><a href="https://www.coursera.org/learn/algorithms-part1" rel="nofollow">Algorithms I</a></li> <li><a href="https://www.coursera.org/learn/algorithms-part2" rel="nofollow">Algorithms II</a></li> </ul> </li> </ul> </li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">C++</h3><a id="user-content-c-1" class="anchor" aria-label="Permalink: C++" href="#c-1"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Your choice:</p> <ul dir="auto"> <li>Goodrich, Tamassia, and Mount <ul dir="auto"> <li><a href="https://www.amazon.com/Data-Structures-Algorithms-Michael-Goodrich/dp/0470383275" rel="nofollow">Data Structures and Algorithms in C++, 2nd Edition</a></li> </ul> </li> <li>Sedgewick and Wayne <ul dir="auto"> <li><a href="https://www.amazon.com/Algorithms-Parts-1-4-Fundamentals-Structure/dp/0201350882/" rel="nofollow">Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching</a></li> <li><a href="https://www.amazon.com/Algorithms-Part-Graph-3rd-Pt-5/dp/0201361183/" rel="nofollow">Algorithms in C++ Part 5: Graph Algorithms</a></li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Interview Prep Books</h2><a id="user-content-interview-prep-books" class="anchor" aria-label="Permalink: Interview Prep Books" href="#interview-prep-books"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Here are some recommended books to supplement your learning.</p> <ul dir="auto"> <li> <p dir="auto"><a href="https://geni.us/q7svoz" rel="nofollow">Coding Interview Patterns: Nail Your Next Coding Interview</a></p> </li> <li> <p dir="auto"><a href="https://www.amazon.com/Programming-Interviews-Exposed-Through-Interview/dp/111941847X/" rel="nofollow">Programming Interviews Exposed: Coding Your Way Through the Interview, 4th Edition</a></p> <ul dir="auto"> <li>Answers in C++ and Java</li> <li>This is a good warm-up for Cracking the Coding Interview</li> <li>Not too difficult. Most problems may be easier than what you'll see in an interview (from what I've read)</li> </ul> </li> <li> <p dir="auto"><a href="http://www.amazon.com/Cracking-Coding-Interview-6th-Programming/dp/0984782850/" rel="nofollow">Cracking the Coding Interview, 6th Edition</a></p> <ul dir="auto"> <li>answers in Java</li> </ul> </li> </ul> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">If you have tons of extra time:</h3><a id="user-content-if-you-have-tons-of-extra-time" class="anchor" aria-label="Permalink: If you have tons of extra time:" href="#if-you-have-tons-of-extra-time"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Choose one:</p> <ul dir="auto"> <li><a href="https://www.amazon.com/Elements-Programming-Interviews-Insiders-Guide/dp/1479274836" rel="nofollow">Elements of Programming Interviews (C++ version)</a></li> <li><a href="https://www.amazon.com/Elements-Programming-Interviews-Python-Insiders/dp/1537713949/" rel="nofollow">Elements of Programming Interviews in Python</a></li> <li><a href="https://www.amazon.com/Elements-Programming-Interviews-Java-Insiders/dp/1517435803/" rel="nofollow">Elements of Programming Interviews (Java version)</a> - <a href="https://github.com/gardncl/elements-of-programming-interviews">Companion Project - Method Stub and Test Cases for Every Problem in the Book</a></li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Don't Make My Mistakes</h2><a id="user-content-dont-make-my-mistakes" class="anchor" aria-label="Permalink: Don't Make My Mistakes" href="#dont-make-my-mistakes"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">This list grew over many months, and yes, it got out of hand.</p> <p dir="auto">Here are some mistakes I made so you'll have a better experience. And you'll save months of time.</p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">1. You Won't Remember it All</h3><a id="user-content-1-you-wont-remember-it-all" class="anchor" aria-label="Permalink: 1. You Won't Remember it All" href="#1-you-wont-remember-it-all"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">I watched hours of videos and took copious notes, and months later there was much I didn't remember. I spent 3 days going through my notes and making flashcards, so I could review. I didn't need all of that knowledge.</p> <p dir="auto">Please, read so you won't make my mistakes:</p> <p dir="auto"><a href="https://startupnextdoor.com/retaining-computer-science-knowledge/" rel="nofollow">Retaining Computer Science Knowledge</a>.</p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">2. Use Flashcards</h3><a id="user-content-2-use-flashcards" class="anchor" aria-label="Permalink: 2. Use Flashcards" href="#2-use-flashcards"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">To solve the problem, I made a little flashcard site where I could add flashcards of 2 types: general and code. Each card has a different formatting. I made a mobile-first website, so I could review on my phone or tablet, wherever I am.</p> <p dir="auto">Make your own for free:</p> <ul dir="auto"> <li><a href="https://github.com/jwasham/computer-science-flash-cards">Flashcards site repo</a></li> </ul> <p dir="auto"><strong>I DON'T RECOMMEND using my flashcards.</strong> There are too many and most of them are trivia that you don't need.</p> <p dir="auto">But if you don't want to listen to me, here you go:</p> <ul dir="auto"> <li><a href="https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham.db">My flash cards database (1200 cards)</a>:</li> <li><a href="https://github.com/jwasham/computer-science-flash-cards/blob/main/cards-jwasham-extreme.db">My flash cards database (extreme - 1800 cards)</a>:</li> </ul> <p dir="auto">Keep in mind I went overboard and have cards covering everything from assembly language and Python trivia to machine learning and statistics. It's way too much for what's required.</p> <p dir="auto"><strong>Note on flashcards:</strong> The first time you recognize you know the answer, don't mark it as known. You have to see the same card and answer it several times correctly before you really know it. Repetition will put that knowledge deeper in your brain.</p> <p dir="auto">An alternative to using my flashcard site is <a href="http://ankisrs.net/" rel="nofollow">Anki</a>, which has been recommended to me numerous times. It uses a repetition system to help you remember. It's user-friendly, available on all platforms, and has a cloud sync system. It costs $25 on iOS but is free on other platforms.</p> <p dir="auto">My flashcard database in Anki format: <a href="https://ankiweb.net/shared/info/25173560" rel="nofollow">https://ankiweb.net/shared/info/25173560</a> (thanks <a href="https://github.com/xiewenya">@xiewenya</a>).</p> <p dir="auto">Some students have mentioned formatting issues with white space that can be fixed by doing the following: open the deck, edit the card, click cards, select the "styling" radio button, and add the member "white-space: pre;" to the card class.</p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">3. Do Coding Interview Questions While You're Learning</h3><a id="user-content-3-do-coding-interview-questions-while-youre-learning" class="anchor" aria-label="Permalink: 3. Do Coding Interview Questions While You're Learning" href="#3-do-coding-interview-questions-while-youre-learning"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">THIS IS VERY IMPORTANT.</p> <p dir="auto">Start doing coding interview questions while you're learning data structures and algorithms.</p> <p dir="auto">You need to apply what you're learning to solve problems, or you'll forget. I made this mistake.</p> <p dir="auto">Once you've learned a topic, and feel somewhat comfortable with it, for example, <strong>linked lists</strong>:</p> <ol dir="auto"> <li>Open one of the <a href="#interview-prep-books">coding interview books</a> (or coding problem websites, listed below)</li> <li>Do 2 or 3 questions regarding linked lists.</li> <li>Move on to the next learning topic.</li> <li>Later, go back and do another 2 or 3 linked list problems.</li> <li>Do this with each new topic you learn.</li> </ol> <p dir="auto"><strong>Keep doing problems while you're learning all this stuff, not after.</strong></p> <p dir="auto">You're not being hired for knowledge, but how you apply the knowledge.</p> <p dir="auto">There are many resources for this, listed below. Keep going.</p> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">4. Focus</h3><a id="user-content-4-focus" class="anchor" aria-label="Permalink: 4. Focus" href="#4-focus"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">There are a lot of distractions that can take up valuable time. Focus and concentration are hard. Turn on some music without lyrics and you'll be able to focus pretty well.</p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">What you won't see covered</h2><a id="user-content-what-you-wont-see-covered" class="anchor" aria-label="Permalink: What you won't see covered" href="#what-you-wont-see-covered"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">These are prevalent technologies but not part of this study plan:</p> <ul dir="auto"> <li>Javascript</li> <li>HTML, CSS, and other front-end technologies</li> <li>SQL</li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">The Daily Plan</h2><a id="user-content-the-daily-plan" class="anchor" aria-label="Permalink: The Daily Plan" href="#the-daily-plan"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">This course goes over a lot of subjects. Each will probably take you a few days, or maybe even a week or more. It depends on your schedule.</p> <p dir="auto">Each day, take the next subject in the list, watch some videos about that subject, and then write an implementation of that data structure or algorithm in the language you chose for this course.</p> <p dir="auto">You can see my code here:</p> <ul dir="auto"> <li><a href="https://github.com/jwasham/practice-c">C</a></li> <li><a href="https://github.com/jwasham/practice-cpp">C++</a></li> <li><a href="https://github.com/jwasham/practice-python">Python</a></li> </ul> <p dir="auto">You don't need to memorize every algorithm. You just need to be able to understand it enough to be able to write your own implementation.</p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Coding Question Practice</h2><a id="user-content-coding-question-practice" class="anchor" aria-label="Permalink: Coding Question Practice" href="#coding-question-practice"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <div class="snippet-clipboard-content notranslate position-relative overflow-auto" data-snippet-clipboard-copy-content="Why is this here? I'm not ready to interview."><pre class="notranslate"><code>Why is this here? I'm not ready to interview. </code></pre></div> <p dir="auto"><a href="#3-do-coding-interview-questions-while-youre-learning">Then go back and read this.</a></p> <p dir="auto">Why you need to practice doing programming problems:</p> <ul dir="auto"> <li>Problem recognition, and where the right data structures and algorithms fit in</li> <li>Gathering requirements for the problem</li> <li>Talking your way through the problem like you will in the interview</li> <li>Coding on a whiteboard or paper, not a computer</li> <li>Coming up with time and space complexity for your solutions (see Big-O below)</li> <li>Testing your solutions</li> </ul> <p dir="auto">There is a great intro for methodical, communicative problem-solving in an interview. You'll get this from the programming interview books, too, but I found this outstanding: <a href="http://www.hiredintech.com/algorithm-design/" rel="nofollow">Algorithm design canvas</a></p> <p dir="auto">Write code on a whiteboard or paper, not a computer. Test with some sample inputs. Then type it and test it out on a computer.</p> <p dir="auto">If you don't have a whiteboard at home, pick up a large drawing pad from an art store. You can sit on the couch and practice. This is my "sofa whiteboard". I added the pen in the photo just for scale. If you use a pen, you'll wish you could erase. Gets messy quickly. <strong>I use a pencil and eraser.</strong></p> <p dir="auto"><a target="_blank" rel="noopener noreferrer nofollow" href="https://camo.githubusercontent.com/ad823324fe7b11bda32f23b8a543ad696b8559a6d89f17af4a2196a9efd0c984/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f6172745f626f6172645f736d5f322e6a7067"><img src="https://camo.githubusercontent.com/ad823324fe7b11bda32f23b8a543ad696b8559a6d89f17af4a2196a9efd0c984/68747470733a2f2f64336a32706b6d6a74696e366f752e636c6f756466726f6e742e6e65742f6172745f626f6172645f736d5f322e6a7067" alt="my sofa whiteboard" data-canonical-src="https://d3j2pkmjtin6ou.cloudfront.net/art_board_sm_2.jpg" style="max-width: 100%;"></a></p> <p dir="auto"><strong>Coding question practice is not about memorizing answers to programming problems.</strong></p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Coding Problems</h2><a id="user-content-coding-problems" class="anchor" aria-label="Permalink: Coding Problems" href="#coding-problems"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Don't forget your key coding interview books <a href="#interview-prep-books">here</a>.</p> <p dir="auto">Solving Problems:</p> <ul dir="auto"> <li><a href="https://www.topcoder.com/thrive/articles/How%20To%20Find%20a%20Solution" rel="nofollow">How to Find a Solution</a></li> <li><a href="https://www.topcoder.com/thrive/articles/How%20To%20Dissect%20a%20Topcoder%20Problem%20Statement%20Content" rel="nofollow">How to Dissect a Topcoder Problem Statement</a></li> </ul> <p dir="auto">Coding Interview Question Videos:</p> <ul dir="auto"> <li><a href="https://www.youtube.com/playlist?list=PLamzFoFxwoNjPfxzaWqs7cZGsPYy0x_gI" rel="nofollow">IDeserve (88 videos)</a></li> <li><a href="https://www.youtube.com/user/tusharroy2525/playlists?shelf_id=2&view=50&sort=dd" rel="nofollow">Tushar Roy (5 playlists)</a> <ul dir="auto"> <li>Super for walkthroughs of problem solutions</li> </ul> </li> <li><a href="https://www.youtube.com/playlist?list=PLU_sdQYzUj2keVENTP0a5rdykRSgg9Wp-" rel="nofollow">Nick White - LeetCode Solutions (187 Videos)</a> <ul dir="auto"> <li>Good explanations of the solution and the code</li> <li>You can watch several in a short time</li> </ul> </li> <li><a href="https://youtube.com/FisherCoder" rel="nofollow">FisherCoder - LeetCode Solutions</a></li> </ul> <p dir="auto">Challenge/Practice sites:</p> <ul dir="auto"> <li><a href="https://leetcode.com/" rel="nofollow">LeetCode</a> <ul dir="auto"> <li>My favorite coding problem site. It's worth the subscription money for the 1-2 months you'll likely be preparing.</li> <li>See Nick White and FisherCoder Videos above for code walk-throughs.</li> </ul> </li> <li><a href="https://www.hackerrank.com/" rel="nofollow">HackerRank</a></li> <li><a href="https://www.topcoder.com/" rel="nofollow">TopCoder</a></li> <li><a href="https://codeforces.com/" rel="nofollow">Codeforces</a></li> <li><a href="https://codility.com/programmers/" rel="nofollow">Codility</a></li> <li><a href="https://practice.geeksforgeeks.org/explore/?page=1" rel="nofollow">Geeks for Geeks</a></li> <li><a href="https://www.algoexpert.io/product" rel="nofollow">AlgoExpert</a> <ul dir="auto"> <li>Created by Google engineers, this is also an excellent resource to hone your skills.</li> </ul> </li> <li><a href="https://projecteuler.net/" rel="nofollow">Project Euler</a> <ul dir="auto"> <li>very math-focused, and not really suited for coding interviews</li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Let's Get Started</h2><a id="user-content-lets-get-started" class="anchor" aria-label="Permalink: Let's Get Started" href="#lets-get-started"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Alright, enough talk, let's learn!</p> <p dir="auto">But don't forget to do coding problems from above while you learn!</p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Algorithmic complexity / Big-O / Asymptotic analysis</h2><a id="user-content-algorithmic-complexity--big-o--asymptotic-analysis" class="anchor" aria-label="Permalink: Algorithmic complexity / Big-O / Asymptotic analysis" href="#algorithmic-complexity--big-o--asymptotic-analysis"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li>Nothing to implement here, you're just watching videos and taking notes! Yay!</li> <li>There are a lot of videos here. Just watch enough until you understand it. You can always come back and review.</li> <li>Don't worry if you don't understand all the math behind it.</li> <li>You just need to understand how to express the complexity of an algorithm in terms of Big-O.</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=iOq5kSKqeR4" rel="nofollow">Harvard CS50 - Asymptotic Notation (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=V6mKVRU1evU" rel="nofollow">Big O Notations (general quick tutorial) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ei-A_wy5Yxw&index=2&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN" rel="nofollow">Big O Notation (and Omega and Theta) - best mathematical explanation (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=z1mkCe3kVUA" rel="nofollow">Skiena (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98" rel="nofollow">UC Berkeley Big O (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=B3SpQZaAZP4&index=10&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN" rel="nofollow">Amortized Analysis (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> TopCoder (includes recurrence relations and master theorem): <ul dir="auto"> <li><a href="https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20one" rel="nofollow">Computational Complexity: Section 1</a></li> <li><a href="https://www.topcoder.com/thrive/articles/Computational%20Complexity%20part%20two" rel="nofollow">Computational Complexity: Section 2</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://bigocheatsheet.com/" rel="nofollow">Cheat sheet</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZMxejjIyFHWa-4nKg6sdoIv" rel="nofollow">[Review] Analyzing Algorithms (playlist) in 18 minutes (video)</a></li> </ul> <p dir="auto">Well, that's about enough of that.</p> <p dir="auto">When you go through "Cracking the Coding Interview", there is a chapter on this, and at the end there is a quiz to see if you can identify the runtime complexity of different algorithms. It's a super review and test.</p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Data Structures</h2><a id="user-content-data-structures" class="anchor" aria-label="Permalink: Data Structures" href="#data-structures"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Arrays</h3><a id="user-content-arrays" class="anchor" aria-label="Permalink: Arrays" href="#arrays"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> About Arrays: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=tI_tIZFyKBw&t=3009s" rel="nofollow">Arrays CS50 Harvard University</a></li> <li><a href="https://www.coursera.org/lecture/data-structures/arrays-OsBSF" rel="nofollow">Arrays (video)</a></li> <li><a href="https://archive.org/details/ucberkeley_webcast_Wp8oiO_CZZE" rel="nofollow">UC Berkeley CS61B - Linear and Multi-Dim Arrays (video)</a> (Start watching from 15m 32s)</li> <li><a href="https://www.coursera.org/lecture/data-structures/dynamic-arrays-EwbnV" rel="nofollow">Dynamic Arrays (video)</a></li> <li><a href="https://www.youtube.com/watch?v=1jtrQqYpt7g" rel="nofollow">Jagged Arrays (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement a vector (mutable array with automatic resizing): <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Practice coding using arrays and pointers, and pointer math to jump to an index instead of using indexing.</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> New raw data array with allocated memory <ul dir="auto"> <li>can allocate int array under the hood, just not use its features</li> <li>start with 16, or if the starting number is greater, use power of 2 - 16, 32, 64, 128</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> size() - number of items</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> capacity() - number of items it can hold</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> is_empty()</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> at(index) - returns the item at a given index, blows up if index out of bounds</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> push(item)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> insert(index, item) - inserts item at index, shifts that index's value and trailing elements to the right</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> prepend(item) - can use insert above at index 0</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> pop() - remove from end, return value</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> delete(index) - delete item at index, shifting all trailing elements left</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> remove(item) - looks for value and removes index holding it (even if in multiple places)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> find(item) - looks for value and returns first index with that value, -1 if not found</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> resize(new_capacity) // private function <ul dir="auto"> <li>when you reach capacity, resize to double the size</li> <li>when popping an item, if the size is 1/4 of capacity, resize to half</li> </ul> </li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Time <ul dir="auto"> <li>O(1) to add/remove at end (amortized for allocations for more space), index, or update</li> <li>O(n) to insert/remove elsewhere</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Space <ul dir="auto"> <li>contiguous in memory, so proximity helps performance</li> <li>space needed = (array capacity, which is >= n) * size of item, but even if 2n, still O(n)</li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Linked Lists</h3><a id="user-content-linked-lists" class="anchor" aria-label="Permalink: Linked Lists" href="#linked-lists"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Description: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=2T-A_GFuoTo&t=650s" rel="nofollow">Linked Lists CS50 Harvard University</a> - this builds the intuition.</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/singly-linked-lists-kHhgK" rel="nofollow">Singly Linked Lists (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_htzJdKoEmO0" rel="nofollow">CS 61B - Linked Lists 1 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_-c4I3gFYe3w" rel="nofollow">CS 61B - Linked Lists 2 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/F8AbOfQwl1c" rel="nofollow">[Review] Linked lists in 4 minutes (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=QN6FPiD0Gzo" rel="nofollow">C Code (video)</a> - not the whole video, just portions about Node struct and memory allocation</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Linked List vs Arrays: <ul dir="auto"> <li><a href="https://www.coursera.org/lecture/data-structures-optimizing-performance/core-linked-lists-vs-arrays-rjBs9" rel="nofollow">Core Linked Lists Vs Arrays (video)</a></li> <li><a href="https://www.coursera.org/lecture/data-structures-optimizing-performance/in-the-real-world-lists-vs-arrays-QUaUd" rel="nofollow">In The Real World Linked Lists Vs Arrays (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=YQs6IC-vgmo" rel="nofollow">Why you should avoid linked lists (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Gotcha: you need pointer to pointer knowledge: (for when you pass a pointer to a function that may change the address where that pointer points) This page is just to get a grasp on ptr to ptr. I don't recommend this list traversal style. Readability and maintainability suffer due to cleverness. <ul dir="auto"> <li><a href="https://www.eskimo.com/~scs/cclass/int/sx8.html" rel="nofollow">Pointers to Pointers</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement (I did with tail pointer & without): <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> size() - returns the number of data elements in the list</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> empty() - bool returns true if empty</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> value_at(index) - returns the value of the nth item (starting at 0 for first)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> push_front(value) - adds an item to the front of the list</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> pop_front() - remove the front item and return its value</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> push_back(value) - adds an item at the end</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> pop_back() - removes end item and returns its value</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> front() - get the value of the front item</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> back() - get the value of the end item</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> insert(index, value) - insert value at index, so the current item at that index is pointed to by the new item at the index</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> erase(index) - removes node at given index</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> value_n_from_end(n) - returns the value of the node at the nth position from the end of the list</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> reverse() - reverses the list</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> remove_value(value) - removes the first item in the list with this value</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Doubly-linked List <ul dir="auto"> <li><a href="https://www.coursera.org/lecture/data-structures/doubly-linked-lists-jpGKD" rel="nofollow">Description (video)</a></li> <li>No need to implement</li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Stack</h3><a id="user-content-stack" class="anchor" aria-label="Permalink: Stack" href="#stack"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/stacks-UdKzQ" rel="nofollow">Stacks (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/KcT3aVgrrpU" rel="nofollow">[Review] Stacks in 3 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Will not implement. Implementing with the array is trivial</li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Queue</h3><a id="user-content-queue" class="anchor" aria-label="Permalink: Queue" href="#queue"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/queues-EShpq" rel="nofollow">Queue (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://en.wikipedia.org/wiki/Circular_buffer" rel="nofollow">Circular buffer/FIFO</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/D6gu-_tmEpQ" rel="nofollow">[Review] Queues in 3 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement using linked-list, with tail pointer: <ul dir="auto"> <li>enqueue(value) - adds value at a position at the tail</li> <li>dequeue() - returns value and removes least recently added element (front)</li> <li>empty()</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement using a fixed-sized array: <ul dir="auto"> <li>enqueue(value) - adds item at end of available storage</li> <li>dequeue() - returns value and removes least recently added element</li> <li>empty()</li> <li>full()</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Cost: <ul dir="auto"> <li>a bad implementation using a linked list where you enqueue at the head and dequeue at the tail would be O(n) because you'd need the next to last element, causing a full traversal of each dequeue</li> <li>enqueue: O(1) (amortized, linked list and array [probing])</li> <li>dequeue: O(1) (linked list and array)</li> <li>empty: O(1) (linked list and array)</li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Hash table</h3><a id="user-content-hash-table" class="anchor" aria-label="Permalink: Hash table" href="#hash-table"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Videos:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=0M_kIqhwbFo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=8" rel="nofollow">Hashing with Chaining (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=BRO7mVIFt08&index=9&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb" rel="nofollow">Table Doubling, Karp-Rabin (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=rvdJDijO2Ro&index=10&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb" rel="nofollow">Open Addressing, Cryptographic Hashing (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=C4Kc8xzcA68" rel="nofollow">PyCon 2010: The Mighty Dictionary (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=66P5FMkWoVU" rel="nofollow">PyCon 2017: The Dictionary Even Mightier (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=z0lJ2k0sl1g&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=11" rel="nofollow">(Advanced) Randomization: Universal & Perfect Hashing (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=N0COwN14gt0&list=PL2B4EEwhKD-NbwZ4ezj7gyc_3yNrojKM9&index=4" rel="nofollow">(Advanced) Perfect hashing (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/knV86FlSXJ8" rel="nofollow">[Review] Hash tables in 4 minutes (video)</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Online Courses:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures-optimizing-performance/core-hash-tables-m7UuP" rel="nofollow">Core Hash Tables (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/home/week/4" rel="nofollow">Data Structures (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/phone-book-problem-NYZZP" rel="nofollow">Phone Book Problem (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> distributed hash tables: <ul dir="auto"> <li><a href="https://www.coursera.org/lecture/data-structures/instant-uploads-and-storage-optimization-in-dropbox-DvaIb" rel="nofollow">Instant Uploads And Storage Optimization In Dropbox (video)</a></li> <li><a href="https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H" rel="nofollow">Distributed Hash Tables (video)</a></li> </ul> </li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement with array using linear probing</p> <ul dir="auto"> <li>hash(k, m) - m is the size of the hash table</li> <li>add(key, value) - if the key already exists, update value</li> <li>exists(key)</li> <li>get(key)</li> <li>remove(key)</li> </ul> </li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">More Knowledge</h2><a id="user-content-more-knowledge" class="anchor" aria-label="Permalink: More Knowledge" href="#more-knowledge"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Binary search</h3><a id="user-content-binary-search" class="anchor" aria-label="Permalink: Binary search" href="#binary-search"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=D5SrAga1pno" rel="nofollow">Binary Search (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.khanacademy.org/computing/computer-science/algorithms/binary-search/a/binary-search" rel="nofollow">Binary Search (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.topcoder.com/thrive/articles/Binary%20Search" rel="nofollow">detail</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems" rel="nofollow">blueprint</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/fDKIpRe8GW4" rel="nofollow">[Review] Binary search in 4 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement: <ul dir="auto"> <li>binary search (on a sorted array of integers)</li> <li>binary search using recursion</li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Bitwise operations</h3><a id="user-content-bitwise-operations" class="anchor" aria-label="Permalink: Bitwise operations" href="#bitwise-operations"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/bits-cheat-sheet.pdf">Bits cheat sheet</a> <ul dir="auto"> <li>you should know many of the powers of 2 from (2^1 to 2^16 and 2^32)</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Get a really good understanding of manipulating bits with: &, |, ^, ~, >>, << <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://en.wikipedia.org/wiki/Word_(computer_architecture)" rel="nofollow">words</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Good intro: <a href="https://www.youtube.com/watch?v=7jkIUgLC29I" rel="nofollow">Bit Manipulation (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=d0AwjSpNXR0" rel="nofollow">C Programming Tutorial 2-10: Bitwise Operators (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://en.wikipedia.org/wiki/Bit_manipulation" rel="nofollow">Bit Manipulation</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://en.wikipedia.org/wiki/Bitwise_operation" rel="nofollow">Bitwise Operation</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://graphics.stanford.edu/~seander/bithacks.html" rel="nofollow">Bithacks</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://bits.stephan-brumme.com/" rel="nofollow">The Bit Twiddler</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://bits.stephan-brumme.com/interactive.html" rel="nofollow">The Bit Twiddler Interactive</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ZusiKXcz_ac" rel="nofollow">Bit Hacks (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://pconrad.github.io/old_pconrad_cs16/topics/bitOps/" rel="nofollow">Practice Operations</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> 2s and 1s complement <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=lKTsv6iVxV4" rel="nofollow">Binary: Plusses & Minuses (Why We Use Two's Complement) (video)</a></li> <li><a href="https://en.wikipedia.org/wiki/Ones%27_complement" rel="nofollow">1s Complement</a></li> <li><a href="https://en.wikipedia.org/wiki/Two%27s_complement" rel="nofollow">2s Complement</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Count set bits <ul dir="auto"> <li><a href="https://youtu.be/Hzuzo9NJrlc" rel="nofollow">4 ways to count bits in a byte (video)</a></li> <li><a href="https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan" rel="nofollow">Count Bits</a></li> <li><a href="http://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer" rel="nofollow">How To Count The Number Of Set Bits In a 32 Bit Integer</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Swap values: <ul dir="auto"> <li><a href="https://bits.stephan-brumme.com/swap.html" rel="nofollow">Swap</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Absolute value: <ul dir="auto"> <li><a href="https://bits.stephan-brumme.com/absInteger.html" rel="nofollow">Absolute Integer</a></li> </ul> </li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Trees</h2><a id="user-content-trees" class="anchor" aria-label="Permalink: Trees" href="#trees"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Trees - Intro</h3><a id="user-content-trees---intro" class="anchor" aria-label="Permalink: Trees - Intro" href="#trees---intro"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/trees-95qda" rel="nofollow">Intro to Trees (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/tree-traversal-fr51b" rel="nofollow">Tree Traversal (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=uWL6FJhq5fM" rel="nofollow">BFS(breadth-first search) and DFS(depth-first search) (video)</a> <ul dir="auto"> <li>BFS notes: <ul dir="auto"> <li>level order (BFS, using queue)</li> <li>time complexity: O(n)</li> <li>space complexity: best: O(1), worst: O(n/2)=O(n)</li> </ul> </li> <li>DFS notes: <ul dir="auto"> <li>time complexity: O(n)</li> <li>space complexity: best: O(log n) - avg. height of tree worst: O(n)</li> <li>inorder (DFS: left, self, right)</li> <li>postorder (DFS: left, right, self)</li> <li>preorder (DFS: self, left, right)</li> </ul> </li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/HZ5YTanv5QE" rel="nofollow">[Review] Breadth-first search in 4 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/Urx87-NMm6c" rel="nofollow">[Review] Depth-first search in 4 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZO1JC2RgEi04nLy6D-rKk6b" rel="nofollow">[Review] Tree Traversal (playlist) in 11 minutes (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Binary search trees: BSTs</h3><a id="user-content-binary-search-trees-bsts" class="anchor" aria-label="Permalink: Binary search trees: BSTs" href="#binary-search-trees-bsts"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=x6At0nzX92o&index=1&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6" rel="nofollow">Binary Search Tree Review (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/lecture/E7cXP/introduction" rel="nofollow">Introduction (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=76dhtgZt38A&ab_channel=MITOpenCourseWare" rel="nofollow">MIT (video)</a></li> <li>C/C++: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=COZK7NATh4k&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=28" rel="nofollow">Binary search tree - Implementation in C/C++ (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=hWokyBoo0aI&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=29" rel="nofollow">BST implementation - memory allocation in stack and heap (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Ut90klNN264&index=30&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P" rel="nofollow">Find min and max element in a binary search tree (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=_pnqMz5nrRs&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=31" rel="nofollow">Find the height of a binary tree (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=9RHO6jU--GU&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=32" rel="nofollow">Binary tree traversal - breadth-first and depth-first strategies (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=86g8jAQug04&index=33&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P" rel="nofollow">Binary tree: Level Order Traversal (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P" rel="nofollow">Binary tree traversal: Preorder, Inorder, Postorder (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=yEwSGhSsT0U&index=35&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P" rel="nofollow">Check if a binary tree is a binary search tree or not (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=gcULXE7ViZw&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=36" rel="nofollow">Delete a node from Binary Search Tree (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=5cPbNCrdotA&index=37&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P" rel="nofollow">Inorder Successor in a binary search tree (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://leetcode.com/problems/insert-into-a-binary-search-tree/submissions/987660183/" rel="nofollow">insert // insert value into tree</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> get_node_count // get count of values stored</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> print_values // prints the values in the tree, from min to max</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> delete_tree</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> is_in_tree // returns true if a given value exists in the tree</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.geeksforgeeks.org/find-the-maximum-depth-or-height-of-a-tree/" rel="nofollow">get_height // returns the height in nodes (single node's height is 1)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> get_min // returns the minimum value stored in the tree</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> get_max // returns the maximum value stored in the tree</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://leetcode.com/problems/validate-binary-search-tree/" rel="nofollow">is_binary_search_tree</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> delete_value</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> get_successor // returns the next-highest value in the tree after given value, -1 if none</li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Heap / Priority Queue / Binary Heap</h3><a id="user-content-heap--priority-queue--binary-heap" class="anchor" aria-label="Permalink: Heap / Priority Queue / Binary Heap" href="#heap--priority-queue--binary-heap"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li>visualized as a tree, but is usually linear in storage (array, linked list)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://en.wikipedia.org/wiki/Heap_(data_structure)" rel="nofollow">Heap</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/introduction-2OpTs" rel="nofollow">Introduction (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/lecture/GRV2q/binary-trees" rel="nofollow">Binary Trees (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/supplement/S5xxz/tree-height-remark" rel="nofollow">Tree Height Remark (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/lecture/0g1dl/basic-operations" rel="nofollow">Basic Operations (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/lecture/gl5Ni/complete-binary-trees" rel="nofollow">Complete Binary Trees (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/lecture/HxQo9/pseudocode" rel="nofollow">Pseudocode (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/odNJmw5TOEE?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3291" rel="nofollow">Heap Sort - jumps to start (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/heap-sort-hSzMO" rel="nofollow">Heap Sort (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/data-structures/building-a-heap-dwrOS" rel="nofollow">Building a heap (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Xnpo1atN-Iw&list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY&index=12" rel="nofollow">MIT 6.006 Introduction to Algorithms: Binary Heaps</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_yIUFT6AKBGE" rel="nofollow">CS 61B Lecture 24: Priority Queues (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=MiyLo8adrWw" rel="nofollow">Linear Time BuildHeap (max-heap)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZNsyqgPW-DNwUeT8F8uhWc6" rel="nofollow">[Review] Heap (playlist) in 13 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement a max-heap: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> insert</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> sift_up - needed for insert</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> get_max - returns the max item, without removing it</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> get_size() - return number of elements stored</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> is_empty() - returns true if the heap contains no elements</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> extract_max - returns the max item, removing it</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> sift_down - needed for extract_max</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> remove(x) - removes item at index x</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> heapify - create a heap from an array of elements, needed for heap_sort</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> heap_sort() - take an unsorted array and turn it into a sorted array in place using a max heap or min heap</li> </ul> </li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Sorting</h2><a id="user-content-sorting" class="anchor" aria-label="Permalink: Sorting" href="#sorting"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Notes:</p> <ul class="contains-task-list"> <li>Implement sorts & know best case/worst case, average complexity of each: <ul dir="auto"> <li>no bubble sort - it's terrible - O(n^2), except when n <= 16</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Stability in sorting algorithms ("Is Quicksort stable?") <ul dir="auto"> <li><a href="https://en.wikipedia.org/wiki/Sorting_algorithm#Stability" rel="nofollow">Sorting Algorithm Stability</a></li> <li><a href="http://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms" rel="nofollow">Stability In Sorting Algorithms</a></li> <li><a href="http://www.geeksforgeeks.org/stability-in-sorting-algorithms/" rel="nofollow">Stability In Sorting Algorithms</a></li> <li><a href="http://homepages.math.uic.edu/~leon/cs-mcs401-s08/handouts/stability.pdf" rel="nofollow">Sorting Algorithms - Stability</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Which algorithms can be used on linked lists? Which on arrays? Which of both? <ul dir="auto"> <li>I wouldn't recommend sorting a linked list, but merge sort is doable.</li> <li><a href="http://www.geeksforgeeks.org/merge-sort-for-linked-list/" rel="nofollow">Merge Sort For Linked List</a></li> </ul> </li> </ul> </li> <li> <p dir="auto">For heapsort, see the Heap data structure above. Heap sort is great, but not stable</p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part1/home/week/3" rel="nofollow">Sedgewick - Mergesort (5 videos)</a></p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/mergesort-ARWDq" rel="nofollow">1. Mergesort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part1/lecture/PWNEl/bottom-up-mergesort" rel="nofollow">2. Bottom-up Mergesort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/sorting-complexity-xAltF" rel="nofollow">3. Sorting Complexity</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/comparators-9FYhS" rel="nofollow">4. Comparators</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part1/lecture/pvvLZ/stability" rel="nofollow">5. Stability</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part1/home/week/3" rel="nofollow">Sedgewick - Quicksort (4 videos)</a></p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/quicksort-vjvnC" rel="nofollow">1. Quicksort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/selection-UQxFT" rel="nofollow">2. Selection</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/duplicate-keys-XvjPd" rel="nofollow">3. Duplicate Keys</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part1/system-sorts-QBNZ7" rel="nofollow">4. System Sorts</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> UC Berkeley:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_EiUvYS2DT6I" rel="nofollow">CS 61B Lecture 29: Sorting I (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_2hTY3t80Qsk" rel="nofollow">CS 61B Lecture 30: Sorting II (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_Y6LOLpxg6Dc" rel="nofollow">CS 61B Lecture 32: Sorting III (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_qNMQ4ly43p4" rel="nofollow">CS 61B Lecture 33: Sorting V (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_pvbBMd-3NoI" rel="nofollow">CS 61B 2014-04-21: Radix Sort(video)</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=P00xJgWzz2c&index=1&list=PL89B61F78B552C1AB" rel="nofollow">Bubble Sort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ni_zk257Nqo&index=7&list=PL89B61F78B552C1AB" rel="nofollow">Analyzing Bubble Sort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Kg4bqzAqRBM&index=3&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb" rel="nofollow">Insertion Sort, Merge Sort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=c4BRHC7kTaQ&index=2&list=PL89B61F78B552C1AB" rel="nofollow">Insertion Sort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=GCae1WNvnZM&index=3&list=PL89B61F78B552C1AB" rel="nofollow">Merge Sort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=y_G9BkAm6B8&index=4&list=PL89B61F78B552C1AB" rel="nofollow">Quicksort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=6nDMgr0-Yyo&index=8&list=PL89B61F78B552C1AB" rel="nofollow">Selection Sort (video)</a></p> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Merge sort code:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.cs.yale.edu/homes/aspnes/classes/223/examples/sorting/mergesort.c" rel="nofollow">Using output array (C)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://github.com/jwasham/practice-python/blob/master/merge_sort/merge_sort.py">Using output array (Python)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://github.com/jwasham/practice-cpp/blob/master/merge_sort/merge_sort.cc">In-place (C++)</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Quick sort code:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.cs.yale.edu/homes/aspnes/classes/223/examples/randomization/quick.c" rel="nofollow">Implementation (C)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://github.com/jwasham/practice-c/blob/master/quick_sort/quick_sort.c">Implementation (C)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://github.com/jwasham/practice-python/blob/master/quick_sort/quick_sort.py">Implementation (Python)</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZOZSbGAXAPIq1BeUf4j20pl" rel="nofollow">[Review] Sorting (playlist) in 18 minutes</a></p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/Hoixgm4-P4M" rel="nofollow">Quick sort in 4 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/2DmK_H7IdTo" rel="nofollow">Heap sort in 4 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/4VqmGXwpLqc" rel="nofollow">Merge sort in 3 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/xli_FI7CuzA" rel="nofollow">Bubble sort in 2 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/g-PGLbMth_g" rel="nofollow">Selection sort in 3 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/JU767SDMDvA" rel="nofollow">Insertion sort in 2 minutes (video)</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Implement:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Mergesort: O(n log n) average and worst case</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Quicksort O(n log n) average case</li> <li>Selection sort and insertion sort are both O(n^2) average and worst-case</li> <li>For heapsort, see Heap data structure above</li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Not required, but I recommended them:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/home/week/3" rel="nofollow">Sedgewick - Radix Sorts (6 videos)</a> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/vGHvb/strings-in-java" rel="nofollow">1. Strings in Java</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part2/key-indexed-counting-2pi1Z" rel="nofollow">2. Key Indexed Counting</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/c1U7L/lsd-radix-sort" rel="nofollow">3. Least Significant Digit First String Radix Sort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/gFxwG/msd-radix-sort" rel="nofollow">4. Most Significant Digit First String Radix Sort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part2/3-way-radix-quicksort-crkd5" rel="nofollow">5. 3 Way Radix Quicksort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays" rel="nofollow">6. Suffix Arrays</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#radixSort" rel="nofollow">Radix Sort</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=xhr26ia4k38" rel="nofollow">Radix Sort (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Nz1KZXbghj8&index=7&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb" rel="nofollow">Radix Sort, Counting Sort (linear time given constraints) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=cNB2lADK3_s&index=8&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">Randomization: Matrix Multiply, Quicksort, Freivalds' algorithm (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=pOKy3RZbSws&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=14" rel="nofollow">Sorting in Linear Time (video)</a></li> </ul> </li> </ul> <p dir="auto">As a summary, here is a visual representation of <a href="https://www.youtube.com/watch?v=kPRA0W1kECg" rel="nofollow">15 sorting algorithms</a>. If you need more detail on this subject, see the "Sorting" section in <a href="#additional-detail-on-some-subjects">Additional Detail on Some Subjects</a></p> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Graphs</h2><a id="user-content-graphs" class="anchor" aria-label="Permalink: Graphs" href="#graphs"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Graphs can be used to represent many problems in computer science, so this section is long, like trees and sorting.</p> <ul class="contains-task-list"> <li> <p dir="auto">Notes:</p> <ul dir="auto"> <li>There are 4 basic ways to represent a graph in memory: <ul dir="auto"> <li>objects and pointers</li> <li>adjacency matrix</li> <li>adjacency list</li> <li>adjacency map</li> </ul> </li> <li>Familiarize yourself with each representation and its pros & cons</li> <li>BFS and DFS - know their computational complexity, their trade-offs, and how to implement them in real code</li> <li>When asked a question, look for a graph-based solution first, then move on if none</li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> MIT(videos):</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=oFVYVzlvk9c&t=14s&ab_channel=MITOpenCourseWare" rel="nofollow">Breadth-First Search</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=IBfWDYSffUU&t=32s&ab_channel=MITOpenCourseWare" rel="nofollow">Depth-First Search</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Skiena Lectures - great intro:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Sjk0xqWWPCc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=10" rel="nofollow">CSE373 2020 - Lecture 10 - Graph Data Structures (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ZTwjXj81NVY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=11" rel="nofollow">CSE373 2020 - Lecture 11 - Graph Traversal (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=KyordYB3BOs&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=12" rel="nofollow">CSE373 2020 - Lecture 12 - Depth First Search (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=oolm2VnJUKw&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=13" rel="nofollow">CSE373 2020 - Lecture 13 - Minimum Spanning Trees (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=RktgPx0MarY&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=14" rel="nofollow">CSE373 2020 - Lecture 14 - Minimum Spanning Trees (con't) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=MUe5DXRhyAo&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=15" rel="nofollow">CSE373 2020 - Lecture 15 - Graph Algorithms (con't 2) (video)</a></li> </ul> </li> <li class="task-list-item"> <p dir="auto"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Graphs (review and more):</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Aa2sqUhIn-E&index=15&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb" rel="nofollow">6.006 Single-Source Shortest Paths Problem (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=NSHizBK9JD8&t=1731s&ab_channel=MITOpenCourseWare" rel="nofollow">6.006 Dijkstra (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=f9cVS_URPc0&ab_channel=MITOpenCourseWare" rel="nofollow">6.006 Bellman-Ford (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=CHvQ3q_gJ7E&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=18" rel="nofollow">6.006 Speeding Up Dijkstra (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=i_AQT_XfvD8&index=6&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm" rel="nofollow">Aduni: Graph Algorithms I - Topological Sorting, Minimum Spanning Trees, Prim's Algorithm - Lecture 6 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ufj5_bppBsA&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=7" rel="nofollow">Aduni: Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure - Lecture 7 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=DiedsPsMKXc&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=8" rel="nofollow">Aduni: Graph Algorithms III: Shortest Path - Lecture 8 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=XIAQRlNkJAw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=9" rel="nofollow">Aduni: Graph Alg. IV: Intro to geometric algorithms - Lecture 9 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://archive.org/details/ucberkeley_webcast_zFbq8vOZ_0k" rel="nofollow">CS 61B 2014: Weighted graphs (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=tKwnms5iRBU&index=16&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">Greedy Algorithms: Minimum Spanning Tree (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=RpgcYiky7uw" rel="nofollow">Strongly Connected Components Kosaraju's Algorithm Graph Algorithm (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZO-Y-H3xIC9DGSfVYJng9Yw" rel="nofollow">[Review] Shortest Path Algorithms (playlist) in 16 minutes (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZObEi3Hf6lmyW-CBfs7nkOV" rel="nofollow">[Review] Minimum Spanning Trees (playlist) in 4 minutes (video)</a></li> </ul> </li> <li> <p dir="auto">Full Coursera Course:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-on-graphs/home/welcome" rel="nofollow">Algorithms on Graphs (video)</a></li> </ul> </li> <li> <p dir="auto">I'll implement:</p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> DFS with adjacency list (recursive)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> DFS with adjacency list (iterative with stack)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> DFS with adjacency matrix (recursive)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> DFS with adjacency matrix (iterative with stack)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> BFS with adjacency list</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> BFS with adjacency matrix</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> single-source shortest path (Dijkstra)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> minimum spanning tree</li> <li>DFS-based algorithms (see Aduni videos above): <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> check for a cycle (needed for topological sort, since we'll check for the cycle before starting)</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> topological sort</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> count connected components in a graph</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> list strongly connected components</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> check for bipartite graph</li> </ul> </li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Even More Knowledge</h2><a id="user-content-even-more-knowledge" class="anchor" aria-label="Permalink: Even More Knowledge" href="#even-more-knowledge"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Recursion</h3><a id="user-content-recursion" class="anchor" aria-label="Permalink: Recursion" href="#recursion"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Stanford lectures on recursion & backtracking: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=gl3emqCuueQ&list=PLFE6E58F856038C69&index=8" rel="nofollow">Lecture 8 | Programming Abstractions (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=uFJhEPrbycQ&list=PLFE6E58F856038C69&index=9" rel="nofollow">Lecture 9 | Programming Abstractions (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=NdF1QDTRkck&index=10&list=PLFE6E58F856038C69" rel="nofollow">Lecture 10 | Programming Abstractions (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=p-gpaIGRCQI&list=PLFE6E58F856038C69&index=11" rel="nofollow">Lecture 11 | Programming Abstractions (video)</a></li> </ul> </li> <li>When it is appropriate to use it?</li> <li>How is tail recursion better than not? <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.quora.com/What-is-tail-recursion-Why-is-it-so-bad" rel="nofollow">What Is Tail Recursion Why Is It So Bad?</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/programming-languages/tail-recursion-YZic1" rel="nofollow">Tail Recursion (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/ngCos392W4w" rel="nofollow">5 Simple Steps for Solving Any Recursive Problem(video)</a></li> </ul> <p dir="auto">Backtracking Blueprint: <a href="https://leetcode.com/problems/combination-sum/discuss/16502/A-general-approach-to-backtracking-questions-in-Java-(Subsets-Permutations-Combination-Sum-Palindrome-Partitioning)" rel="nofollow">Java</a> <a href="https://leetcode.com/problems/combination-sum/discuss/429538/General-Backtracking-questions-solutions-in-Python-for-reference-%3A" rel="nofollow">Python</a></p> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Dynamic Programming</h3><a id="user-content-dynamic-programming" class="anchor" aria-label="Permalink: Dynamic Programming" href="#dynamic-programming"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li>You probably won't see any dynamic programming problems in your interview, but it's worth being able to recognize a problem as being a candidate for dynamic programming.</li> <li>This subject can be pretty difficult, as each DP soluble problem must be defined as a recursion relation, and coming up with it can be tricky.</li> <li>I suggest looking at many examples of DP problems until you have a solid understanding of the pattern involved.</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Videos: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=wAA0AMfcJHQ&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=18" rel="nofollow">Skiena: CSE373 2020 - Lecture 19 - Introduction to Dynamic Programming (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=T3A4jlHlhtA&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=19" rel="nofollow">Skiena: CSE373 2020 - Lecture 20 - Edit Distance (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=iPnPVcZmRbE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=20" rel="nofollow">Skiena: CSE373 2020 - Lecture 20 - Edit Distance (continued) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=2xPE4Wq8coQ&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=21" rel="nofollow">Skiena: CSE373 2020 - Lecture 21 - Dynamic Programming (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Yh3RzqQGsyI&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=22" rel="nofollow">Skiena: CSE373 2020 - Lecture 22 - Dynamic Programming and Review (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/J5aJEcOr6Eo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3558" rel="nofollow">Simonson: Dynamic Programming 0 (starts at 59:18) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=0EzHjQ_SOeU&index=11&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm" rel="nofollow">Simonson: Dynamic Programming I - Lecture 11 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=v1qiRwuJU7g&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=12" rel="nofollow">Simonson: Dynamic programming II - Lecture 12 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> List of individual DP problems (each is short): <a href="https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr" rel="nofollow">Dynamic Programming (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Yale Lecture notes: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#dynamicProgramming" rel="nofollow">Dynamic Programming</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Coursera: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithmic-thinking-2/lecture/80RrW/the-rna-secondary-structure-problem" rel="nofollow">The RNA secondary structure problem (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithmic-thinking-2/a-dynamic-programming-algorithm-PSonq" rel="nofollow">A dynamic programming algorithm (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithmic-thinking-2/illustrating-the-dp-algorithm-oUEK2" rel="nofollow">Illustrating the DP algorithm (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithmic-thinking-2/lecture/nfK2r/running-time-of-the-dp-algorithm" rel="nofollow">Running time of the DP algorithm (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithmic-thinking-2/lecture/M999a/dp-vs-recursive-implementation" rel="nofollow">DP vs. recursive implementation (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithmic-thinking-2/global-pairwise-sequence-alignment-UZ7o6" rel="nofollow">Global pairwise sequence alignment (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithmic-thinking-2/lecture/WnNau/local-pairwise-sequence-alignment" rel="nofollow">Local pairwise sequence alignment (video)</a></li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Design patterns</h3><a id="user-content-design-patterns" class="anchor" aria-label="Permalink: Design patterns" href="#design-patterns"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=3cmzqZzwNDM&list=PLGLfVvz_LVvQ5G-LdJ8RLqe-ndo7QITYc&index=3" rel="nofollow">Quick UML review (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Learn these patterns: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> strategy</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> singleton</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> adapter</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> prototype</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> decorator</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> visitor</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> factory, abstract factory</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> facade</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> observer</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> proxy</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> delegate</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> command</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> state</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> memento</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> iterator</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> composite</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> flyweight</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PLF206E906175C7E07" rel="nofollow">Series of videos (27 videos)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.amazon.com/Head-First-Design-Patterns-Freeman/dp/0596007124" rel="nofollow">Book: Head First Design Patterns</a> <ul dir="auto"> <li>I know the canonical book is "Design Patterns: Elements of Reusable Object-Oriented Software", but Head First is great for beginners to OO.</li> </ul> </li> <li><a href="https://sourcemaking.com/design-patterns-and-tips" rel="nofollow">Handy reference: 101 Design Patterns & Tips for Developers</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Combinatorics (n choose k) & Probability</h3><a id="user-content-combinatorics-n-choose-k--probability" class="anchor" aria-label="Permalink: Combinatorics (n choose k) & Probability" href="#combinatorics-n-choose-k--probability"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=8RRo6Ti9d0U" rel="nofollow">Math Skills: How to find Factorial, Permutation, and Combination (Choose) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=sZkAAk9Wwa4" rel="nofollow">Make School: Probability (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=dNaJg-mLobQ" rel="nofollow">Make School: More Probability and Markov Chains (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Khan Academy: <ul dir="auto"> <li>Course layout: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.khanacademy.org/math/probability/probability-and-combinatorics-topic" rel="nofollow">Basic Theoretical Probability</a></li> </ul> </li> <li>Just the videos - 41 (each are simple and each are short): <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=uzkc-qNVoOk&list=PLC58778F28211FA19" rel="nofollow">Probability Explained (video)</a></li> </ul> </li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">NP, NP-Complete and Approximation Algorithms</h3><a id="user-content-np-np-complete-and-approximation-algorithms" class="anchor" aria-label="Permalink: NP, NP-Complete and Approximation Algorithms" href="#np-np-complete-and-approximation-algorithms"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li>Know about the most famous classes of NP-complete problems, such as the traveling salesman and the knapsack problem, and be able to recognize them when an interviewer asks you them in disguise.</li> <li>Know what NP-complete means.</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=moPtwq_cVH8&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=23" rel="nofollow">Computational Complexity (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Simonson: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/qcGnJ47Smlo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=2939" rel="nofollow">Greedy Algs. II & Intro to NP-Completeness (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=e0tGC6ZQdQE&index=16&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm" rel="nofollow">NP Completeness II & Reductions (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=fCX1BGT3wjE&index=17&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm" rel="nofollow">NP Completeness III (Video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=NKLDp3Rch3M&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=18" rel="nofollow">NP Completeness IV (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Skiena: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ItHp5laE1VE&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=23" rel="nofollow">CSE373 2020 - Lecture 23 - NP-Completeness (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=inaFJeCzGxU&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=24" rel="nofollow">CSE373 2020 - Lecture 24 - Satisfiability (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=B-bhKxjZLlc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=25" rel="nofollow">CSE373 2020 - Lecture 25 - More NP-Completeness (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=_EzetTkG_Cc&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=26" rel="nofollow">CSE373 2020 - Lecture 26 - NP-Completeness Challenge (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=eHZifpgyH_4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=22" rel="nofollow">Complexity: P, NP, NP-completeness, Reductions (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=MEz1J9wY2iM&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=24" rel="nofollow">Complexity: Approximation Algorithms (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=4q-jmGrmxKs&index=25&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">Complexity: Fixed-Parameter Algorithms (video)</a></li> <li>Peter Norvig discusses near-optimal solutions to the traveling salesman problem: <ul dir="auto"> <li><a href="http://nbviewer.jupyter.org/url/norvig.com/ipython/TSP.ipynb" rel="nofollow">Jupyter Notebook</a></li> </ul> </li> <li>Pages 1048 - 1140 in CLRS if you have it.</li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">How computers process a program</h3><a id="user-content-how-computers-process-a-program" class="anchor" aria-label="Permalink: How computers process a program" href="#how-computers-process-a-program"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=XM4lGflQFvA" rel="nofollow">How CPU executes a program (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/1I5ZMmrOfnA" rel="nofollow">How computers calculate - ALU (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/fpnE6UAfbtU" rel="nofollow">Registers and RAM (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/FZGugFqdr60" rel="nofollow">The Central Processing Unit (CPU) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://youtu.be/zltgXvg6r3k" rel="nofollow">Instructions and Programs (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Caches</h3><a id="user-content-caches" class="anchor" aria-label="Permalink: Caches" href="#caches"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> LRU cache: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=R5ON3iwx78M" rel="nofollow">The Magic of LRU Cache (100 Days of Google Dev) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=bq6N7Ym81iI" rel="nofollow">Implementing LRU (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=8-FZRAjR7qU" rel="nofollow">LeetCode - 146 LRU Cache (C++) (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> CPU cache: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=vjYF_fAZI5E&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-&index=24" rel="nofollow">MIT 6.004 L15: The Memory Hierarchy (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ajgC3-pyGlk&index=25&list=PLrRW1w6CGAcXbMtDFj205vALOGmiRc82-" rel="nofollow">MIT 6.004 L16: Cache Issues (video)</a></li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Processes and Threads</h3><a id="user-content-processes-and-threads" class="anchor" aria-label="Permalink: Processes and Threads" href="#processes-and-threads"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Computer Science 162 - Operating Systems (25 videos): <ul dir="auto"> <li>for processes and threads see videos 1-11</li> <li><a href="https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iBDyz-ba4yDskqMDY6A1w_c" rel="nofollow">Operating Systems and System Programming (video)</a></li> </ul> </li> <li><a href="https://www.quora.com/What-is-the-difference-between-a-process-and-a-thread" rel="nofollow">What Is The Difference Between A Process And A Thread?</a></li> <li>Covers: <ul dir="auto"> <li>Processes, Threads, Concurrency issues <ul dir="auto"> <li>Difference between processes and threads</li> <li>Processes</li> <li>Threads</li> <li>Locks</li> <li>Mutexes</li> <li>Semaphores</li> <li>Monitors</li> <li>How do they work?</li> <li>Deadlock</li> <li>Livelock</li> </ul> </li> <li>CPU activity, interrupts, context switching</li> <li>Modern concurrency constructs with multicore processors</li> <li><a href="https://youtu.be/O4nwUqQodAg" rel="nofollow">Paging, segmentation, and virtual memory (video)</a></li> <li><a href="https://youtu.be/iKlAWIKEyuw" rel="nofollow">Interrupts (video)</a></li> <li>Process resource needs (memory: code, static storage, stack, heap, and also file descriptors, i/o)</li> <li>Thread resource needs (shares above (minus stack) with other threads in the same process but each has its own PC, stack counter, registers, and stack)</li> <li>Forking is really copy on write (read-only) until the new process writes to memory, then it does a full copy.</li> <li>Context switching <ul dir="auto"> <li><a href="https://www.javatpoint.com/what-is-the-context-switching-in-the-operating-system" rel="nofollow">How context switching is initiated by the operating system and underlying hardware?</a></li> </ul> </li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL5jc9xFGsL8E12so1wlMS0r0hTQoJL74M" rel="nofollow">threads in C++ (series - 10 videos)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PLacuG5pysFbDQU8kKxbUh4K5c1iL5_k7k" rel="nofollow">CS 377 Spring '14: Operating Systems from University of Massachusetts</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> concurrency in Python (videos): <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PL1H1sBF1VAKVMONJWJkmUh6_p8g4F2oy1" rel="nofollow">Short series on threads</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Bs7vPNbB9JM" rel="nofollow">Python Threads</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Obt-vMVdM8s" rel="nofollow">Understanding the Python GIL (2010)</a> <ul dir="auto"> <li><a href="http://www.dabeaz.com/GIL" rel="nofollow">reference</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=MCs5OvhV9S4" rel="nofollow">David Beazley - Python Concurrency From the Ground Up LIVE! - PyCon 2015</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ZzfHjytDceU" rel="nofollow">Keynote David Beazley - Topics of Interest (Python Asyncio)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=0zaPs8OtyKY" rel="nofollow">Mutex in Python</a></li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Testing</h3><a id="user-content-testing" class="anchor" aria-label="Permalink: Testing" href="#testing"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li>To cover: <ul dir="auto"> <li>how unit testing works</li> <li>what are mock objects</li> <li>what is integration testing</li> <li>what is dependency injection</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=SAhJf36_u5U" rel="nofollow">Agile Software Testing with James Bach (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=ILkT_HV9DVU" rel="nofollow">Open Lecture by James Bach on Software Testing (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://vimeo.com/83960706" rel="nofollow">Steve Freeman - Test-Driven Development (that’s not what we meant) (video)</a> <ul dir="auto"> <li><a href="http://gotocon.com/dl/goto-berlin-2013/slides/SteveFreeman_TestDrivenDevelopmentThatsNotWhatWeMeant.pdf" rel="nofollow">slides</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Dependency injection: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=IKD2-MAkXyQ" rel="nofollow">video</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://jasonpolites.github.io/tao-of-testing/ch3-1.1.html" rel="nofollow">Tao Of Testing</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://jasonpolites.github.io/tao-of-testing/ch4-1.1.html" rel="nofollow">How to write tests</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">String searching & manipulations</h3><a id="user-content-string-searching--manipulations" class="anchor" aria-label="Permalink: String searching & manipulations" href="#string-searching--manipulations"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/TH18W/suffix-arrays" rel="nofollow">Sedgewick - Suffix Arrays (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/home/week/4" rel="nofollow">Sedgewick - Substring Search (videos)</a> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part2/introduction-to-substring-search-n3ZpG" rel="nofollow">1. Introduction to Substring Search</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/2Kn5i/brute-force-substring-search" rel="nofollow">2. Brute-Force Substring Search</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/TAtDr/knuth-morris-pratt" rel="nofollow">3. Knuth-Morris Pratt</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/CYxOT/boyer-moore" rel="nofollow">4. Boyer-Moore</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/lecture/algorithms-part2/rabin-karp-3KiqT" rel="nofollow">5. Rabin-Karp</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures/lecture/tAfHI/search-pattern-in-text" rel="nofollow">Search pattern in a text (video)</a></li> </ul> <p dir="auto">If you need more detail on this subject, see the "String Matching" section in <a href="#additional-detail-on-some-subjects">Additional Detail on Some Subjects</a>.</p> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Tries</h3><a id="user-content-tries" class="anchor" aria-label="Permalink: Tries" href="#tries"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li>Note there are different kinds of tries. Some have prefixes, some don't, and some use strings instead of bits to track the path</li> <li>I read through the code, but will not implement</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/home/week/4" rel="nofollow">Sedgewick - Tries (3 videos)</a> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/CPVdr/r-way-tries" rel="nofollow">1. R Way Tries</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/yQM8K/ternary-search-tries" rel="nofollow">2. Ternary Search Tries</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2/lecture/jwNmV/character-based-operations" rel="nofollow">3. Character Based Operations</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Tries" rel="nofollow">Notes on Data Structures and Programming Techniques</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Short course videos: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/08Xyf/core-introduction-to-tries" rel="nofollow">Introduction To Tries (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/PvlZW/core-performance-of-tries" rel="nofollow">Performance Of Tries (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/DFvd3/core-implementing-a-trie" rel="nofollow">Implementing A Trie (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.toptal.com/java/the-trie-a-neglected-data-structure" rel="nofollow">The Trie: A Neglected Data Structure</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.topcoder.com/thrive/articles/Using%20Tries" rel="nofollow">TopCoder - Using Tries</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=TJ8SkcUSdbU" rel="nofollow">Stanford Lecture (real-world use case) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=NinWEPPrkDQ&index=16&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf" rel="nofollow">MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through) (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Floating Point Numbers</h3><a id="user-content-floating-point-numbers" class="anchor" aria-label="Permalink: Floating Point Numbers" href="#floating-point-numbers"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> simple 8-bit: <a href="https://www.youtube.com/watch?v=ji3SfClm8TU" rel="nofollow">Representation of Floating Point Numbers - 1 (video - there is an error in calculations - see video description)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Unicode</h3><a id="user-content-unicode" class="anchor" aria-label="Permalink: Unicode" href="#unicode"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.joelonsoftware.com/articles/Unicode.html" rel="nofollow">The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://kunststube.net/encoding/" rel="nofollow">What Every Programmer Absolutely, Positively Needs To Know About Encodings And Character Sets To Work With Text</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Endianness</h3><a id="user-content-endianness" class="anchor" aria-label="Permalink: Endianness" href="#endianness"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://web.archive.org/web/20180107141940/http://www.cs.umd.edu:80/class/sum2003/cmsc311/Notes/Data/endian.html" rel="nofollow">Big And Little Endian</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=JrNF0KRAlyo" rel="nofollow">Big Endian Vs Little Endian (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=oBSuXP-1Tc0" rel="nofollow">Big And Little Endian Inside/Out (video)</a> <ul dir="auto"> <li>Very technical talk for kernel devs. Don't worry if most is over your head.</li> <li>The first half is enough.</li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Networking</h3><a id="user-content-networking" class="anchor" aria-label="Permalink: Networking" href="#networking"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li><strong>If you have networking experience or want to be a reliability engineer or operations engineer, expect questions</strong></li> <li>Otherwise, this is just good to know</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.khanacademy.org/computing/code-org/computers-and-the-internet" rel="nofollow">Khan Academy</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Vdc8TCESIg8" rel="nofollow">UDP and TCP: Comparison of Transport Protocols (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=e5DEVa9eSN0" rel="nofollow">TCP/IP and the OSI Model Explained! (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=nomyRJehhnM" rel="nofollow">Packet Transmission across the Internet. Networking & TCP/IP tutorial. (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=WGJrLqtX7As" rel="nofollow">HTTP (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=S2iBR2ZlZf0" rel="nofollow">SSL and HTTPS (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=Rp3iZUvXWlM" rel="nofollow">SSL/TLS (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=E9FxNzv1Tr8" rel="nofollow">HTTP 2.0 (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/playlist?list=PLEbnTDJUr_IegfoqO4iPnPYQui46QqT0j" rel="nofollow">Video Series (21 videos) (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=t5xYI0jzOf4" rel="nofollow">Subnetting Demystified - Part 5 CIDR Notation (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Sockets: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=6G_W54zuadg&t=6s" rel="nofollow">Java - Sockets - Introduction (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=G75vN2mnJeQ" rel="nofollow">Socket Programming (video)</a></li> </ul> </li> </ul> </li> </ul> <hr> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Final Review</h2><a id="user-content-final-review" class="anchor" aria-label="Permalink: Final Review" href="#final-review"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <div class="snippet-clipboard-content notranslate position-relative overflow-auto" data-snippet-clipboard-copy-content="This section will have shorter videos that you can watch pretty quickly to review most of the important concepts. It's nice if you want a refresher often."><pre class="notranslate"><code>This section will have shorter videos that you can watch pretty quickly to review most of the important concepts. It's nice if you want a refresher often. </code></pre></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Series of 2-3 minutes short subject videos (23 videos) <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=r4r1DZcx1cM&list=PLmVb1OknmNJuC5POdcDv5oCS7_OUkDgpj&index=22" rel="nofollow">Videos</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Series of 2-5 minutes short subject videos - Michael Sambol (48 videos): <ul dir="auto"> <li><a href="https://www.youtube.com/@MichaelSambol" rel="nofollow">Videos</a></li> <li><a href="https://github.com/msambol/dsa">Code Examples</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part1" rel="nofollow">Sedgewick Videos - Algorithms I</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.coursera.org/learn/algorithms-part2" rel="nofollow">Sedgewick Videos - Algorithms II</a></li> </ul> <hr> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Update Your Resume</h2><a id="user-content-update-your-resume" class="anchor" aria-label="Permalink: Update Your Resume" href="#update-your-resume"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>See Resume prep information in the books: "Cracking The Coding Interview" and "Programming Interviews Exposed"</li> <li><a href="https://www.careercup.com/resume" rel="nofollow">"This Is What A GOOD Resume Should Look Like" by Gayle McDowell (author of Cracking the Coding Interview)</a>, <ul dir="auto"> <li>Note by the author: "This is for a US-focused resume. CVs for India and other countries have different expectations, although many of the points will be the same."</li> </ul> </li> <li><a href="https://www.techinterviewhandbook.org/resume/guide" rel="nofollow">"Step-by-step resume guide" by Tech Interview Handbook</a> <ul dir="auto"> <li>Detailed guide on how to set up your resume from scratch, write effective resume content, optimize it, and test your resume</li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Interview Process & General Interview Prep</h2><a id="user-content-interview-process--general-interview-prep" class="anchor" aria-label="Permalink: Interview Process & General Interview Prep" href="#interview-process--general-interview-prep"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://davidbyttow.medium.com/how-to-pass-the-engineering-interview-in-2021-45f1b389a1" rel="nofollow">How to Pass the Engineering Interview in 2021</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=N233T0epWTs" rel="nofollow">Demystifying Tech Recruiting</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> How to Get a Job at the Big 4: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=YJZCUhxNCv8" rel="nofollow">How to Get a Job at the Big 4 - Amazon, Facebook, Google & Microsoft (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=6790FVXWBw8&feature=youtu.be" rel="nofollow">How to Get a Job at the Big 4.1 (Follow-up video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Cracking The Coding Interview Set 1: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=rEJzOhC5ZtQ" rel="nofollow">Gayle L McDowell - Cracking The Coding Interview (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=aClxtDcdpsQ" rel="nofollow">Cracking the Coding Interview with Author Gayle Laakmann McDowell (video)</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Cracking the Facebook Coding Interview: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=wCl9kvQGHPI" rel="nofollow">The Approach</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=4UWDyJq8jZg" rel="nofollow">Problem Walkthrough</a></li> </ul> </li> <li>Prep Courses: <ul dir="auto"> <li><a href="https://www.udemy.com/python-for-data-structures-algorithms-and-interviews/" rel="nofollow">Python for Data Structures, Algorithms, and Interviews (paid course)</a>: <ul dir="auto"> <li>A Python-centric interview prep course that covers data structures, algorithms, mock interviews, and much more.</li> </ul> </li> <li><a href="https://www.udacity.com/course/data-structures-and-algorithms-in-python--ud513" rel="nofollow">Intro to Data Structures and Algorithms using Python (Udacity free course)</a>: <ul dir="auto"> <li>A free Python-centric data structures and algorithms course.</li> </ul> </li> <li><a href="https://www.udacity.com/course/data-structures-and-algorithms-nanodegree--nd256" rel="nofollow">Data Structures and Algorithms Nanodegree! (Udacity paid Nanodegree)</a>: <ul dir="auto"> <li>Get hands-on practice with over 100 data structures and algorithm exercises and guidance from a dedicated mentor to help prepare you for interviews and on-the-job scenarios.</li> </ul> </li> <li><a href="https://www.educative.io/courses/grokking-the-behavioral-interview" rel="nofollow">Grokking the Behavioral Interview (Educative free course)</a>: <ul dir="auto"> <li>Many times, it’s not your technical competency that holds you back from landing your dream job, it’s how you perform on the behavioral interview.</li> </ul> </li> <li><a href="https://algo.monster/?utm_campaign=jwasham&utm_medium=referral&utm_content=coding-interview-university&utm_source=github" rel="nofollow">AlgoMonster (paid course with free content)</a>: <ul dir="auto"> <li>The crash course for LeetCode. Covers all the patterns condensed from thousands of questions.</li> </ul> </li> </ul> </li> </ul> <p dir="auto">Mock Interviews:</p> <ul dir="auto"> <li><a href="http://www.gainlo.co/#!/" rel="nofollow">Gainlo.co: Mock interviewers from big companies</a> - I used this and it helped me relax for the phone screen and on-site interview</li> <li><a href="https://www.pramp.com/" rel="nofollow">Pramp: Mock interviews from/with peers</a> - a peer-to-peer model to practice interviews</li> <li><a href="https://interviewing.io" rel="nofollow">interviewing.io: Practice mock interview with senior engineers</a> - anonymous algorithmic/systems design interviews with senior engineers from FAANG anonymously</li> <li><a href="https://meetapro.com/?utm_source=ciu" rel="nofollow">Meetapro: Mock interviews with top FAANG interviewers</a> - an Airbnb-style mock interview/coaching platform.</li> <li><a href="https://www.hellointerview.com/?utm_source=ciu" rel="nofollow">Hello Interview: Mock Interviews with Expert Coaches and AI</a> - interview directly with AI or with FAANG staff engineers and managers.</li> <li><a href="https://codemia.io/?utm_source=ciu" rel="nofollow">Codemia: Practice system design problems with AI or community solutions and feedback</a> - Practice system design problems via AI practice tool. Share your solution with the community to get human feedback as well.</li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Be thinking of for when the interview comes</h2><a id="user-content-be-thinking-of-for-when-the-interview-comes" class="anchor" aria-label="Permalink: Be thinking of for when the interview comes" href="#be-thinking-of-for-when-the-interview-comes"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Think of about 20 interview questions you'll get, along with the lines of the items below. Have at least one answer for each. Have a story, not just data, about something you accomplished.</p> <ul dir="auto"> <li>Why do you want this job?</li> <li>What's a tough problem you've solved?</li> <li>Biggest challenges faced?</li> <li>Best/worst designs seen?</li> <li>Ideas for improving an existing product</li> <li>How do you work best, as an individual and as part of a team?</li> <li>Which of your skills or experiences would be assets in the role and why?</li> <li>What did you most enjoy at [job x / project y]?</li> <li>What was the biggest challenge you faced at [job x / project y]?</li> <li>What was the hardest bug you faced at [job x / project y]?</li> <li>What did you learn at [job x / project y]?</li> <li>What would you have done better at [job x / project y]?</li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Have questions for the interviewer</h2><a id="user-content-have-questions-for-the-interviewer" class="anchor" aria-label="Permalink: Have questions for the interviewer" href="#have-questions-for-the-interviewer"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Some of mine (I already may know the answers, but want their opinion or team perspective):</p> <ul dir="auto"> <li>How large is your team?</li> <li>What does your dev cycle look like? Do you do waterfall/sprints/agile?</li> <li>Are rushes to deadlines common? Or is there flexibility?</li> <li>How are decisions made in your team?</li> <li>How many meetings do you have per week?</li> <li>Do you feel your work environment helps you concentrate?</li> <li>What are you working on?</li> <li>What do you like about it?</li> <li>What is the work life like?</li> <li>How is the work/life balance?</li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Once You've Got The Job</h2><a id="user-content-once-youve-got-the-job" class="anchor" aria-label="Permalink: Once You've Got The Job" href="#once-youve-got-the-job"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Congratulations!</p> <p dir="auto">Keep learning.</p> <p dir="auto">You're never really done.</p> <hr> <div class="snippet-clipboard-content notranslate position-relative overflow-auto" data-snippet-clipboard-copy-content="***************************************************************************************************** ***************************************************************************************************** Everything below this point is optional. It is NOT needed for an entry-level interview. However, by studying these, you'll get greater exposure to more CS concepts and will be better prepared for any software engineering job. You'll be a much more well-rounded software engineer. ***************************************************************************************************** *****************************************************************************************************"><pre class="notranslate"><code>***************************************************************************************************** ***************************************************************************************************** Everything below this point is optional. It is NOT needed for an entry-level interview. However, by studying these, you'll get greater exposure to more CS concepts and will be better prepared for any software engineering job. You'll be a much more well-rounded software engineer. ***************************************************************************************************** ***************************************************************************************************** </code></pre></div> <hr> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Additional Books</h2><a id="user-content-additional-books" class="anchor" aria-label="Permalink: Additional Books" href="#additional-books"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <div class="snippet-clipboard-content notranslate position-relative overflow-auto" data-snippet-clipboard-copy-content="These are here so you can dive into a topic you find interesting."><pre class="notranslate"><code>These are here so you can dive into a topic you find interesting. </code></pre></div> <ul dir="auto"> <li><a href="https://www.amazon.com/dp/013937681X" rel="nofollow">The Unix Programming Environment</a> <ul dir="auto"> <li>An oldie but a goodie</li> </ul> </li> <li><a href="https://www.amazon.com/dp/1593273894/" rel="nofollow">The Linux Command Line: A Complete Introduction</a> <ul dir="auto"> <li>A modern option</li> </ul> </li> <li><a href="https://en.wikipedia.org/wiki/TCP/IP_Illustrated" rel="nofollow">TCP/IP Illustrated Series</a></li> <li><a href="https://www.amazon.com/gp/product/0596007124/" rel="nofollow">Head First Design Patterns</a> <ul dir="auto"> <li>A gentle introduction to design patterns</li> </ul> </li> <li><a href="https://www.amazon.com/Design-Patterns-Elements-Reusable-Object-Oriented/dp/0201633612" rel="nofollow">Design Patterns: Elements of Reusable Object-Oriented Software</a> <ul dir="auto"> <li>AKA the "Gang Of Four" book or GOF</li> <li>The canonical design patterns book</li> </ul> </li> <li><a href="http://www.amazon.com/Algorithm-Design-Manual-Steven-Skiena/dp/1849967202" rel="nofollow">Algorithm Design Manual</a> (Skiena) <ul dir="auto"> <li>As a review and problem-recognition</li> <li>The algorithm catalog portion is well beyond the scope of difficulty you'll get in an interview</li> <li>This book has 2 parts: <ul dir="auto"> <li>Class textbook on data structures and algorithms <ul dir="auto"> <li>Pros: <ul dir="auto"> <li>Is a good review as any algorithms textbook would be</li> <li>Nice stories from his experiences solving problems in industry and academia</li> <li>Code examples in C</li> </ul> </li> <li>Cons: <ul dir="auto"> <li>Can be as dense or impenetrable as CLRS, and in some cases, CLRS may be a better alternative for some subjects</li> <li>Chapters 7, 8, and 9 can be painful to try to follow, as some items are not explained well or require more brain than I have</li> <li>Don't get me wrong: I like Skiena, his teaching style, and mannerisms, but I may not be Stony Brook material</li> </ul> </li> </ul> </li> <li>Algorithm catalog: <ul dir="auto"> <li>This is the real reason you buy this book.</li> <li>This book is better as an algorithm reference, and not something you read cover to cover.</li> </ul> </li> </ul> </li> <li>Can rent it on Kindle</li> <li>Answers: <ul dir="auto"> <li><a href="https://web.archive.org/web/20150404194210/http://www.algorithm.cs.sunysb.edu/algowiki/index.php/The_Algorithms_Design_Manual_(Second_Edition)" rel="nofollow">Solutions</a></li> </ul> </li> <li><a href="http://www3.cs.stonybrook.edu/~skiena/algorist/book/errata" rel="nofollow">Errata</a></li> </ul> </li> <li><a href="http://jeffe.cs.illinois.edu/teaching/algorithms/" rel="nofollow">Algorithm</a> (Jeff Erickson)</li> <li><a href="https://www.amazon.com/Write-Great-Code-Understanding-Machine/dp/1593270038" rel="nofollow">Write Great Code: Volume 1: Understanding the Machine</a> <ul dir="auto"> <li>The book was published in 2004, and is somewhat outdated, but it's a terrific resource for understanding a computer in brief</li> <li>The author invented <a href="https://en.wikipedia.org/wiki/High_Level_Assembly" rel="nofollow">HLA</a>, so take mentions and examples in HLA with a grain of salt. Not widely used, but decent examples of what assembly looks like</li> <li>These chapters are worth the read to give you a nice foundation: <ul dir="auto"> <li>Chapter 2 - Numeric Representation</li> <li>Chapter 3 - Binary Arithmetic and Bit Operations</li> <li>Chapter 4 - Floating-Point Representation</li> <li>Chapter 5 - Character Representation</li> <li>Chapter 6 - Memory Organization and Access</li> <li>Chapter 7 - Composite Data Types and Memory Objects</li> <li>Chapter 9 - CPU Architecture</li> <li>Chapter 10 - Instruction Set Architecture</li> <li>Chapter 11 - Memory Architecture and Organization</li> </ul> </li> </ul> </li> <li><a href="https://www.amazon.com/Introduction-Algorithms-fourth-Thomas-Cormen/dp/026204630X" rel="nofollow">Introduction to Algorithms</a> <ul dir="auto"> <li><strong>Important:</strong> Reading this book will only have limited value. This book is a great review of algorithms and data structures, but won't teach you how to write good code. You have to be able to code a decent solution efficiently</li> <li>AKA CLR, sometimes CLRS, because Stein was late to the game</li> </ul> </li> <li><a href="https://www.amazon.com/dp/0128119055" rel="nofollow">Computer Architecture, Sixth Edition: A Quantitative Approach</a> <ul dir="auto"> <li>For a richer, more up-to-date (2017), but longer treatment</li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">System Design, Scalability, Data Handling</h2><a id="user-content-system-design-scalability-data-handling" class="anchor" aria-label="Permalink: System Design, Scalability, Data Handling" href="#system-design-scalability-data-handling"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto"><strong>You can expect system design questions if you have 4+ years of experience.</strong></p> <ul class="contains-task-list"> <li>Scalability and System Design are very large topics with many topics and resources, since there is a lot to consider when designing a software/hardware system that can scale. Expect to spend quite a bit of time on this</li> <li>Considerations: <ul dir="auto"> <li>Scalability <ul dir="auto"> <li>Distill large data sets to single values</li> <li>Transform one data set to another</li> <li>Handling obscenely large amounts of data</li> </ul> </li> <li>System design <ul dir="auto"> <li>features sets</li> <li>interfaces</li> <li>class hierarchies</li> <li>designing a system under certain constraints</li> <li>simplicity and robustness</li> <li>tradeoffs</li> <li>performance analysis and optimization</li> </ul> </li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <strong>START HERE</strong>: <a href="https://github.com/donnemartin/system-design-primer">The System Design Primer</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.hiredintech.com/system-design/" rel="nofollow">System Design from HiredInTech</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.quora.com/How-do-I-prepare-to-answer-design-questions-in-a-technical-interview?redirected_qid=1500023" rel="nofollow">How Do I Prepare To Answer Design Questions In A Technical Interview?</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://javascript.plainenglish.io/8-steps-guide-to-ace-a-system-design-interview-7a5a797f4d7d" rel="nofollow">8 steps guide to ace your system design interview</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=UrYLYV7WSHM" rel="nofollow">Database Normalization - 1NF, 2NF, 3NF and 4NF (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://github.com/checkcheckzz/system-design-interview">System Design Interview</a> - There are a lot of resources in this one. Look through the articles and examples. I put some of them below</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://web.archive.org/web/20120716060051/http://www.palantir.com/2011/10/how-to-rock-a-systems-design-interview/" rel="nofollow">How to ace a systems design interview</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://everythingisdata.wordpress.com/2009/10/17/numbers-everyone-should-know/" rel="nofollow">Numbers Everyone Should Know</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://blog.tsunanet.net/2010/11/how-long-does-it-take-to-make-context.html" rel="nofollow">How long does it take to make a context switch?</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=srOgpXECblk" rel="nofollow">Transactions Across Datacenters (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://ksat.me/a-plain-english-introduction-to-cap-theorem" rel="nofollow">A plain English introduction to CAP Theorem</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=cQP8WApzIQQ&list=PLrw6a1wE39_tb2fErI4-WkMbsvGQk9_UB" rel="nofollow">MIT 6.824: Distributed Systems, Spring 2020 (20 videos)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Consensus Algorithms: <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Paxos - <a href="https://www.youtube.com/watch?v=s8JqcZtvnsM" rel="nofollow">Paxos Agreement - Computerphile (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Raft - <a href="https://www.youtube.com/watch?v=P9Ydif5_qvE" rel="nofollow">An Introduction to the Raft Distributed Consensus Algorithm (video)</a> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://raft.github.io/" rel="nofollow">Easy-to-read paper</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://thesecretlivesofdata.com/raft/" rel="nofollow">Infographic</a></li> </ul> </li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.tom-e-white.com/2007/11/consistent-hashing.html" rel="nofollow">Consistent Hashing</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://horicky.blogspot.com/2009/11/nosql-patterns.html" rel="nofollow">NoSQL Patterns</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Scalability: <ul class="contains-task-list"> <li>You don't need all of these. Just pick a few that interest you.</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=-W9F__D3oY4" rel="nofollow">Great overview (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Short series: <ul dir="auto"> <li><a href="http://www.lecloud.net/post/7295452622/scalability-for-dummies-part-1-clones" rel="nofollow">Clones</a></li> <li><a href="http://www.lecloud.net/post/7994751381/scalability-for-dummies-part-2-database" rel="nofollow">Database</a></li> <li><a href="http://www.lecloud.net/post/9246290032/scalability-for-dummies-part-3-cache" rel="nofollow">Cache</a></li> <li><a href="http://www.lecloud.net/post/9699762917/scalability-for-dummies-part-4-asynchronism" rel="nofollow">Asynchronism</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://www.aosabook.org/en/distsys.html" rel="nofollow">Scalable Web Architecture and Distributed Systems</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://pages.cs.wisc.edu/~zuyu/files/fallacies.pdf" rel="nofollow">Fallacies of Distributed Computing Explained</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=modXC5IWTJI" rel="nofollow">Jeff Dean - Building Software Systems At Google and Lessons Learned (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://lethain.com/introduction-to-architecting-systems-for-scale/" rel="nofollow">Introduction to Architecting Systems for Scale</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=9nWyWwY2Onc" rel="nofollow">Scaling mobile games to a global audience using App Engine and Cloud Datastore (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=H4vMcD7zKM0" rel="nofollow">How Google Does Planet-Scale Engineering for Planet-Scale Infra (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.topcoder.com/thrive/articles/The%20Importance%20of%20Algorithms" rel="nofollow">The Importance of Algorithms</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2009/8/6/an-unorthodox-approach-to-database-design-the-coming-of-the.html" rel="nofollow">Sharding</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=p0jGmgIrf_M&list=PLRXxvay_m8gqVlExPC5DG3TGWJTaBgqSA&index=4" rel="nofollow">Engineering for the Long Game - Astrid Atkinson Keynote(video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2012/3/26/7-years-of-youtube-scalability-lessons-in-30-minutes.html" rel="nofollow">7 Years Of YouTube Scalability Lessons In 30 Minutes</a> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=G-lGCC4KKok" rel="nofollow">video</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/8/15/how-paypal-scaled-to-billions-of-transactions-daily-using-ju.html" rel="nofollow">How PayPal Scaled To Billions Of Transactions Daily Using Just 8VMs</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://blog.clevertap.com/how-to-remove-duplicates-in-large-datasets/" rel="nofollow">How to Remove Duplicates in Large Datasets</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=3vV4YiqKm1o" rel="nofollow">A look inside Etsy's scale and engineering culture with Jon Cowie (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://thenewstack.io/led-amazon-microservices-architecture/" rel="nofollow">What Led Amazon to its Own Microservices Architecture</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://eng.uber.com/trip-data-squeeze/" rel="nofollow">To Compress Or Not To Compress, That Was Uber's Question</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/2/25/when-should-approximate-query-processing-be-used.html" rel="nofollow">When Should Approximate Query Processing Be Used?</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/2/23/googles-transition-from-single-datacenter-to-failover-to-a-n.html" rel="nofollow">Google's Transition From Single Datacenter To Failover, To A Native Multihomed Architecture</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/6/15/the-image-optimization-technology-that-serves-millions-of-re.html" rel="nofollow">The Image Optimization Technology That Serves Millions Of Requests Per Day</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/2/1/a-patreon-architecture-short.html" rel="nofollow">A Patreon Architecture Short</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/1/27/tinder-how-does-one-of-the-largest-recommendation-engines-de.html" rel="nofollow">Tinder: How Does One Of The Largest Recommendation Engines Decide Who You'll See Next?</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/1/25/design-of-a-modern-cache.html" rel="nofollow">Design Of A Modern Cache</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/1/13/live-video-streaming-at-facebook-scale.html" rel="nofollow">Live Video Streaming At Facebook Scale</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2016/1/11/a-beginners-guide-to-scaling-to-11-million-users-on-amazons.html" rel="nofollow">A Beginner's Guide To Scaling To 11 Million+ Users On Amazon's AWS</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2015/11/9/a-360-degree-view-of-the-entire-netflix-stack.html" rel="nofollow">A 360 Degree View Of The Entire Netflix Stack</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/latency-everywhere-and-it-costs-you-sales-how-crush-it" rel="nofollow">Latency Is Everywhere And It Costs You Sales - How To Crush It</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://instagram-engineering.tumblr.com/post/13649370142/what-powers-instagram-hundreds-of-instances" rel="nofollow">What Powers Instagram: Hundreds of Instances, Dozens of Technologies</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2013/9/23/salesforce-architecture-how-they-handle-13-billion-transacti.html" rel="nofollow">Salesforce Architecture - How They Handle 1.3 Billion Transactions A Day</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="http://highscalability.com/blog/2013/11/4/espns-architecture-at-scale-operating-at-100000-duh-nuh-nuhs.html" rel="nofollow">ESPN's Architecture At Scale - Operating At 100,000 Duh Nuh Nuhs Per Second</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> See "Messaging, Serialization, and Queueing Systems" way below for info on some of the technologies that can glue services together</li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Twitter: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=5cKTP36HVgI" rel="nofollow">O'Reilly MySQL CE 2011: Jeremy Cole, "Big and Small Data at @Twitter" (video)</a></li> <li><a href="https://www.infoq.com/presentations/Twitter-Timeline-Scalability" rel="nofollow">Timelines at Scale</a></li> </ul> </li> <li>For even more, see the "Mining Massive Datasets" video series in the <a href="#video-series">Video Series</a> section</li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> Practicing the system design process: Here are some ideas to try working through on paper, each with some documentation on how it was handled in the real world: <ul dir="auto"> <li>review: <a href="https://github.com/donnemartin/system-design-primer">The System Design Primer</a></li> <li><a href="http://www.hiredintech.com/system-design/" rel="nofollow">System Design from HiredInTech</a></li> <li><a href="https://github.com/jwasham/coding-interview-university/blob/main/extras/cheat%20sheets/system-design.pdf">cheat sheet</a></li> <li>flow: <ol dir="auto"> <li>Understand the problem and scope: <ul dir="auto"> <li>Define the use cases, with the interviewer's help</li> <li>Suggest additional features</li> <li>Remove items that the interviewer deems out of scope</li> <li>Assume high availability is required, add as a use case</li> </ul> </li> <li>Think about constraints: <ul dir="auto"> <li>Ask how many requests per month</li> <li>Ask how many requests per second (they may volunteer it or make you do the math)</li> <li>Estimate reads vs. writes percentage</li> <li>Keep the 80/20 rule in mind when estimating</li> <li>How much data is written per second</li> <li>Total storage required over 5 years</li> <li>How much data read per second</li> </ul> </li> <li>Abstract design: <ul dir="auto"> <li>Layers (service, data, caching)</li> <li>Infrastructure: load balancing, messaging</li> <li>Rough overview of any key algorithm that drives the service</li> <li>Consider bottlenecks and determine solutions</li> </ul> </li> </ol> </li> <li>Exercises: <ul dir="auto"> <li><a href="https://blog.twitter.com/2010/announcing-snowflake" rel="nofollow">Design a random unique ID generation system</a></li> <li><a href="http://www.slideshare.net/dvirsky/introduction-to-redis" rel="nofollow">Design a key-value database</a></li> <li><a href="http://highscalability.com/blog/2011/12/6/instagram-architecture-14-million-users-terabytes-of-photos.html" rel="nofollow">Design a picture sharing system</a></li> <li><a href="http://ijcai13.org/files/tutorial_slides/td3.pdf" rel="nofollow">Design a recommendation system</a></li> <li><a href="http://www.hiredintech.com/system-design/the-system-design-process/" rel="nofollow">Design a URL-shortener system: copied from above</a></li> <li><a href="https://web.archive.org/web/20220217064329/https://adayinthelifeof.nl/2011/02/06/memcache-internals/" rel="nofollow">Design a cache system</a></li> </ul> </li> </ul> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Additional Learning</h2><a id="user-content-additional-learning" class="anchor" aria-label="Permalink: Additional Learning" href="#additional-learning"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <div class="snippet-clipboard-content notranslate position-relative overflow-auto" data-snippet-clipboard-copy-content="I added them to help you become a well-rounded software engineer and to be aware of certain technologies and algorithms, so you'll have a bigger toolbox."><pre class="notranslate"><code>I added them to help you become a well-rounded software engineer and to be aware of certain technologies and algorithms, so you'll have a bigger toolbox. </code></pre></div> <ul dir="auto"> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Compilers</h3><a id="user-content-compilers" class="anchor" aria-label="Permalink: Compilers" href="#compilers"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=IhC7sdYe-Jg" rel="nofollow">How a Compiler Works in ~1 minute (video)</a></li> <li><a href="https://www.youtube.com/watch?v=CSZLNYF4Klo" rel="nofollow">Harvard CS50 - Compilers (video)</a></li> <li><a href="https://www.youtube.com/watch?v=twodd1KFfGk" rel="nofollow">C++ (video)</a></li> <li><a href="https://www.youtube.com/watch?v=FnGCDLhaxKU" rel="nofollow">Understanding Compiler Optimization (C++) (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Emacs and vi(m)</h3><a id="user-content-emacs-and-vim" class="anchor" aria-label="Permalink: Emacs and vi(m)" href="#emacs-and-vim"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Familiarize yourself with a UNIX-based code editor</li> <li>vi(m): <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=5givLEMcINQ&index=1&list=PL13bz4SHGmRxlZVmWQ9DvXo1fEg4UdGkr" rel="nofollow">Editing With Vim 01 - Installation, Setup, and The Modes (video)</a></li> <li><a href="http://vim-adventures.com/" rel="nofollow">VIM Adventures</a></li> <li>set of 4 videos: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=SI8TeVMX8pk" rel="nofollow">The vi/vim editor - Lesson 1</a></li> <li><a href="https://www.youtube.com/watch?v=F3OO7ZIOaJE" rel="nofollow">The vi/vim editor - Lesson 2</a></li> <li><a href="https://www.youtube.com/watch?v=ZYEccA_nMaI" rel="nofollow">The vi/vim editor - Lesson 3</a></li> <li><a href="https://www.youtube.com/watch?v=1lYD5gwgZIA" rel="nofollow">The vi/vim editor - Lesson 4</a></li> </ul> </li> <li><a href="http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Using_Vi_instead_of_Emacs" rel="nofollow">Using Vi Instead of Emacs</a></li> </ul> </li> <li>emacs: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=hbmV1bnQ-i0" rel="nofollow">Basics Emacs Tutorial (video)</a></li> <li>set of 3 (videos): <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=ujODL7MD04Q" rel="nofollow">Emacs Tutorial (Beginners) -Part 1- File commands, cut/copy/paste, cursor commands</a></li> <li><a href="https://www.youtube.com/watch?v=XWpsRupJ4II" rel="nofollow">Emacs Tutorial (Beginners) -Part 2- Buffer management, search, M-x grep and rgrep modes</a></li> <li><a href="https://www.youtube.com/watch?v=paSgzPso-yc" rel="nofollow">Emacs Tutorial (Beginners) -Part 3- Expressions, Statements, ~/.emacs file, and packages</a></li> </ul> </li> <li><a href="https://www.youtube.com/watch?v=JWD1Fpdd4Pc" rel="nofollow">Evil Mode: Or, How I Learned to Stop Worrying and Love Emacs (video)</a></li> <li><a href="http://www.cs.yale.edu/homes/aspnes/classes/223/notes.html#Writing_C_programs_with_Emacs" rel="nofollow">Writing C Programs With Emacs</a></li> </ul> </li> <li><a href="https://www.youtube.com/watch?v=48JlgiBpw_I&t=0s" rel="nofollow">The Absolute Beginner's Guide to Emacs (video by David Wilson)</a></li> <li><a href="https://systemcrafters.net/emacs-essentials/absolute-beginners-guide-to-emacs/" rel="nofollow">The Absolute Beginner's Guide to Emacs (notes by David Wilson)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Unix/Linux command line tools</h3><a id="user-content-unixlinux-command-line-tools" class="anchor" aria-label="Permalink: Unix/Linux command line tools" href="#unixlinux-command-line-tools"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>I filled in the list below from good tools.</li> <li>bash</li> <li>cat</li> <li>grep</li> <li>sed</li> <li>awk</li> <li>curl or wget</li> <li>sort</li> <li>tr</li> <li>uniq</li> <li><a href="https://en.wikipedia.org/wiki/Strace" rel="nofollow">strace</a></li> <li><a href="https://danielmiessler.com/study/tcpdump/" rel="nofollow">tcpdump</a></li> <li><a href="https://labex.io/tutorials/practice-linux-commands-hands-on-labs-398420" rel="nofollow">Essential Linux Commands Tutorial</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">DevOps</h3><a id="user-content-devops" class="anchor" aria-label="Permalink: DevOps" href="#devops"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://roadmap.sh/devops" rel="nofollow">DevOps Roadmap</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Information theory (videos)</h3><a id="user-content-information-theory-videos" class="anchor" aria-label="Permalink: Information theory (videos)" href="#information-theory-videos"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.khanacademy.org/computing/computer-science/informationtheory" rel="nofollow">Khan Academy</a></li> <li>More about Markov processes: <ul dir="auto"> <li><a href="https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/waxgx/core-markov-text-generation" rel="nofollow">Core Markov Text Generation</a></li> <li><a href="https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/gZhiC/core-implementing-markov-text-generation" rel="nofollow">Core Implementing Markov Text Generation</a></li> <li><a href="https://www.coursera.org/learn/data-structures-optimizing-performance/lecture/EUjrq/project-markov-text-generation-walk-through" rel="nofollow">Project = Markov Text Generation Walk Through</a></li> </ul> </li> <li>See more in the MIT 6.050J Information and Entropy series below</li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Parity & Hamming Code (videos)</h3><a id="user-content-parity--hamming-code-videos" class="anchor" aria-label="Permalink: Parity & Hamming Code (videos)" href="#parity--hamming-code-videos"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=q-3BctoUpHE" rel="nofollow">Intro</a></li> <li><a href="https://www.youtube.com/watch?v=DdMcAUlxh1M" rel="nofollow">Parity</a></li> <li>Hamming Code: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=1A_NcXxdoCc" rel="nofollow">Error detection</a></li> <li><a href="https://www.youtube.com/watch?v=JAMLuxdHH8o" rel="nofollow">Error correction</a></li> </ul> </li> <li><a href="https://www.youtube.com/watch?v=wbH2VxzmoZk" rel="nofollow">Error Checking</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Entropy</h3><a id="user-content-entropy" class="anchor" aria-label="Permalink: Entropy" href="#entropy"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Also see the videos below</li> <li>Make sure to watch information theory videos first</li> <li><a href="https://youtu.be/JnJq3Py0dyM?t=176" rel="nofollow">Information Theory, Claude Shannon, Entropy, Redundancy, Data Compression & Bits (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Cryptography</h3><a id="user-content-cryptography" class="anchor" aria-label="Permalink: Cryptography" href="#cryptography"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Also see the videos below</li> <li>Make sure to watch information theory videos first</li> <li><a href="https://www.khanacademy.org/computing/computer-science/cryptography" rel="nofollow">Khan Academy Series</a></li> <li><a href="https://www.youtube.com/watch?v=KqqOXndnvic&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=30" rel="nofollow">Cryptography: Hash Functions</a></li> <li><a href="https://www.youtube.com/watch?v=9TNI2wHmaeI&index=31&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">Cryptography: Encryption</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Compression</h3><a id="user-content-compression" class="anchor" aria-label="Permalink: Compression" href="#compression"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Make sure to watch information theory videos first</li> <li>Computerphile (videos): <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=Lto-ajuqW3w" rel="nofollow">Compression</a></li> <li><a href="https://www.youtube.com/watch?v=M5c_RFKVkko" rel="nofollow">Entropy in Compression</a></li> <li><a href="https://www.youtube.com/watch?v=umTbivyJoiI" rel="nofollow">Upside Down Trees (Huffman Trees)</a></li> <li><a href="https://www.youtube.com/watch?v=DV8efuB3h2g" rel="nofollow">EXTRA BITS/TRITS - Huffman Trees</a></li> <li><a href="https://www.youtube.com/watch?v=goOa3DGezUA" rel="nofollow">Elegant Compression in Text (The LZ 77 Method)</a></li> <li><a href="https://www.youtube.com/watch?v=cCDCfoHTsaU" rel="nofollow">Text Compression Meets Probabilities</a></li> </ul> </li> <li><a href="https://www.youtube.com/playlist?list=PLOU2XLYxmsIJGErt5rrCqaSGTMyyqNt2H" rel="nofollow">Compressor Head videos</a></li> <li><a href="https://www.youtube.com/watch?v=whGwm0Lky2s" rel="nofollow">(optional) Google Developers Live: GZIP is not enough!</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Computer Security</h3><a id="user-content-computer-security" class="anchor" aria-label="Permalink: Computer Security" href="#computer-security"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/playlist?list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">MIT (23 videos)</a> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Introduction, Threat Models</a></li> <li><a href="https://www.youtube.com/watch?v=6bwzNg5qQ0o&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=2" rel="nofollow">Control Hijacking Attacks</a></li> <li><a href="https://www.youtube.com/watch?v=drQyrzRoRiA&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=3" rel="nofollow">Buffer Overflow Exploits and Defenses</a></li> <li><a href="https://www.youtube.com/watch?v=6SIJmoE9L9g&index=4&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Privilege Separation</a></li> <li><a href="https://www.youtube.com/watch?v=8VqTSY-11F4&index=5&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Capabilities</a></li> <li><a href="https://www.youtube.com/watch?v=VEV74hwASeU&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh&index=6" rel="nofollow">Sandboxing Native Code</a></li> <li><a href="https://www.youtube.com/watch?v=chkFBigodIw&index=7&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Web Security Model</a></li> <li><a href="https://www.youtube.com/watch?v=EBQIGy1ROLY&index=8&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Securing Web Applications</a></li> <li><a href="https://www.youtube.com/watch?v=yRVZPvHYHzw&index=9&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Symbolic Execution</a></li> <li><a href="https://www.youtube.com/watch?v=SIEVvk3NVuk&index=11&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Network Security</a></li> <li><a href="https://www.youtube.com/watch?v=QOtA76ga_fY&index=12&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Network Protocols</a></li> <li><a href="https://www.youtube.com/watch?v=PuVMkSEcPiI&index=15&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">Side-Channel Attacks</a></li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Garbage collection</h3><a id="user-content-garbage-collection" class="anchor" aria-label="Permalink: Garbage collection" href="#garbage-collection"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=iHVs_HkjdmI" rel="nofollow">GC in Python (video)</a></li> <li><a href="https://www.infoq.com/presentations/garbage-collection-benefits" rel="nofollow">Deep Dive Java: Garbage Collection is Good!</a></li> <li><a href="https://www.youtube.com/watch?v=P-8Z0-MhdQs&list=PLdzf4Clw0VbOEWOS_sLhT_9zaiQDrS5AR&index=3" rel="nofollow">Deep Dive Python: Garbage Collection in CPython (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Parallel Programming</h3><a id="user-content-parallel-programming" class="anchor" aria-label="Permalink: Parallel Programming" href="#parallel-programming"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.coursera.org/learn/parprog1/home/week/1" rel="nofollow">Coursera (Scala)</a></li> <li><a href="https://www.youtube.com/watch?v=uY85GkaYzBk" rel="nofollow">Efficient Python for High-Performance Parallel Computing (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Messaging, Serialization, and Queueing Systems</h3><a id="user-content-messaging-serialization-and-queueing-systems" class="anchor" aria-label="Permalink: Messaging, Serialization, and Queueing Systems" href="#messaging-serialization-and-queueing-systems"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://thrift.apache.org/" rel="nofollow">Thrift</a> <ul dir="auto"> <li><a href="http://thrift-tutorial.readthedocs.io/en/latest/intro.html" rel="nofollow">Tutorial</a></li> </ul> </li> <li><a href="https://developers.google.com/protocol-buffers/" rel="nofollow">Protocol Buffers</a> <ul dir="auto"> <li><a href="https://developers.google.com/protocol-buffers/docs/tutorials" rel="nofollow">Tutorials</a></li> </ul> </li> <li><a href="http://www.grpc.io/" rel="nofollow">gRPC</a> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=5tmPvSe7xXQ&list=PLcTqM9n_dieN0k1nSeN36Z_ppKnvMJoly&index=1" rel="nofollow">gRPC 101 for Java Developers (video)</a></li> </ul> </li> <li><a href="http://redis.io/" rel="nofollow">Redis</a> <ul dir="auto"> <li><a href="http://try.redis.io/" rel="nofollow">Tutorial</a></li> </ul> </li> <li><a href="https://aws.amazon.com/sqs/" rel="nofollow">Amazon SQS (queue)</a></li> <li><a href="https://aws.amazon.com/sns/" rel="nofollow">Amazon SNS (pub-sub)</a></li> <li><a href="https://www.rabbitmq.com/" rel="nofollow">RabbitMQ</a> <ul dir="auto"> <li><a href="https://www.rabbitmq.com/getstarted.html" rel="nofollow">Get Started</a></li> </ul> </li> <li><a href="http://www.celeryproject.org/" rel="nofollow">Celery</a> <ul dir="auto"> <li><a href="http://docs.celeryproject.org/en/latest/getting-started/first-steps-with-celery.html" rel="nofollow">First Steps With Celery</a></li> </ul> </li> <li><a href="http://zeromq.org/" rel="nofollow">ZeroMQ</a> <ul dir="auto"> <li><a href="http://zeromq.org/intro:read-the-manual" rel="nofollow">Intro - Read The Manual</a></li> </ul> </li> <li><a href="http://activemq.apache.org/" rel="nofollow">ActiveMQ</a></li> <li><a href="http://kafka.apache.org/documentation.html#introduction" rel="nofollow">Kafka</a></li> <li><a href="http://msgpack.org/index.html" rel="nofollow">MessagePack</a></li> <li><a href="https://avro.apache.org/" rel="nofollow">Avro</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">A*</h3><a id="user-content-a" class="anchor" aria-label="Permalink: A*" href="#a"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" rel="nofollow">A Search Algorithm</a></li> <li><a href="https://www.youtube.com/watch?v=-L-WgKMFuhE" rel="nofollow">A* Pathfinding (E01: algorithm explanation) (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Fast Fourier Transform</h3><a id="user-content-fast-fourier-transform" class="anchor" aria-label="Permalink: Fast Fourier Transform" href="#fast-fourier-transform"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://betterexplained.com/articles/an-interactive-guide-to-the-fourier-transform/" rel="nofollow">An Interactive Guide To The Fourier Transform</a></li> <li><a href="http://www.askamathematician.com/2012/09/q-what-is-a-fourier-transform-what-is-it-used-for/" rel="nofollow">What is a Fourier transform? What is it used for?</a></li> <li><a href="https://www.youtube.com/watch?v=Xxut2PN-V8Q" rel="nofollow">What is the Fourier Transform? (video)</a></li> <li><a href="https://www.youtube.com/watch?v=iTMn0Kt18tg&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=4" rel="nofollow">Divide & Conquer: FFT (video)</a></li> <li><a href="http://jakevdp.github.io/blog/2013/08/28/understanding-the-fft/" rel="nofollow">Understanding The FFT</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Bloom Filter</h3><a id="user-content-bloom-filter" class="anchor" aria-label="Permalink: Bloom Filter" href="#bloom-filter"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Given a Bloom filter with m bits and k hashing functions, both insertion and membership testing are O(k)</li> <li><a href="https://www.youtube.com/watch?v=-SuTGoFYjZs" rel="nofollow">Bloom Filters (video)</a></li> <li><a href="https://www.youtube.com/watch?v=qBTdukbzc78" rel="nofollow">Bloom Filters | Mining of Massive Datasets | Stanford University (video)</a></li> <li><a href="http://billmill.org/bloomfilter-tutorial/" rel="nofollow">Tutorial</a></li> <li><a href="http://blog.michaelschmatz.com/2016/04/11/how-to-write-a-bloom-filter-cpp/" rel="nofollow">How To Write A Bloom Filter App</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">HyperLogLog</h3><a id="user-content-hyperloglog" class="anchor" aria-label="Permalink: HyperLogLog" href="#hyperloglog"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="http://highscalability.com/blog/2012/4/5/big-data-counting-how-to-count-a-billion-distinct-objects-us.html" rel="nofollow">How To Count A Billion Distinct Objects Using Only 1.5KB Of Memory</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Locality-Sensitive Hashing</h3><a id="user-content-locality-sensitive-hashing" class="anchor" aria-label="Permalink: Locality-Sensitive Hashing" href="#locality-sensitive-hashing"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Used to determine the similarity of documents</li> <li>The opposite of MD5 or SHA which are used to determine if 2 documents/strings are exactly the same</li> <li><a href="http://ferd.ca/simhashing-hopefully-made-simple.html" rel="nofollow">Simhashing (hopefully) made simple</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">van Emde Boas Trees</h3><a id="user-content-van-emde-boas-trees" class="anchor" aria-label="Permalink: van Emde Boas Trees" href="#van-emde-boas-trees"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=hmReJCupbNU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=6" rel="nofollow">Divide & Conquer: van Emde Boas Trees (video)</a></li> <li><a href="https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2012/lecture-notes/MIT6_046JS12_lec15.pdf" rel="nofollow">MIT Lecture Notes</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Augmented Data Structures</h3><a id="user-content-augmented-data-structures" class="anchor" aria-label="Permalink: Augmented Data Structures" href="#augmented-data-structures"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://archive.org/details/ucberkeley_webcast_zksIj9O8_jc" rel="nofollow">CS 61B Lecture 39: Augmenting Data Structures</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Balanced search trees</h3><a id="user-content-balanced-search-trees" class="anchor" aria-label="Permalink: Balanced search trees" href="#balanced-search-trees"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li> <p dir="auto">Know at least one type of balanced binary tree (and know how it's implemented):</p> </li> <li> <p dir="auto">"Among balanced search trees, AVL and 2/3 trees are now passé and red-black trees seem to be more popular. A particularly interesting self-organizing data structure is the splay tree, which uses rotations to move any accessed key to the root." - Skiena</p> </li> <li> <p dir="auto">Of these, I chose to implement a splay tree. From what I've read, you won't implement a balanced search tree in your interview. But I wanted exposure to coding one up and let's face it, splay trees are the bee's knees. I did read a lot of red-black tree code</p> <ul dir="auto"> <li>Splay tree: insert, search, delete functions If you end up implementing a red/black tree try just these:</li> <li>Search and insertion functions, skipping delete</li> </ul> </li> <li> <p dir="auto">I want to learn more about B-Tree since it's used so widely with very large data sets</p> </li> <li> <p dir="auto"><a href="https://en.wikipedia.org/wiki/Self-balancing_binary_search_tree" rel="nofollow">Self-balancing binary search tree</a></p> </li> <li> <p dir="auto"><strong>AVL trees</strong></p> <ul dir="auto"> <li>In practice: From what I can tell, these aren't used much in practice, but I could see where they would be: The AVL tree is another structure supporting O(log n) search, insertion, and removal. It is more rigidly balanced than red–black trees, leading to slower insertion and removal but faster retrieval. This makes it attractive for data structures that may be built once and loaded without reconstruction, such as language dictionaries (or program dictionaries, such as the opcodes of an assembler or interpreter)</li> <li><a href="https://www.youtube.com/watch?v=FNeL18KsWPc&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=6" rel="nofollow">MIT AVL Trees / AVL Sort (video)</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/Qq5E0/avl-trees" rel="nofollow">AVL Trees (video)</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/PKEBC/avl-tree-implementation" rel="nofollow">AVL Tree Implementation (video)</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/22BgE/split-and-merge" rel="nofollow">Split And Merge</a></li> <li><a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZOUFgdIeOPuH6cfSnNRMau-" rel="nofollow">[Review] AVL Trees (playlist) in 19 minutes (video)</a></li> </ul> </li> <li> <p dir="auto"><strong>Splay trees</strong></p> <ul dir="auto"> <li>In practice: Splay trees are typically used in the implementation of caches, memory allocators, routers, garbage collectors, data compression, ropes (replacement of string used for long text strings), in Windows NT (in the virtual memory, networking and file system code) etc</li> <li><a href="https://archive.org/details/ucberkeley_webcast_G5QIXywcJlY" rel="nofollow">CS 61B: Splay Trees (video)</a></li> <li>MIT Lecture: Splay Trees: <ul dir="auto"> <li>Gets very mathy, but watch the last 10 minutes for sure.</li> <li><a href="https://www.youtube.com/watch?v=QnPl_Y6EqMo" rel="nofollow">Video</a></li> </ul> </li> </ul> </li> <li> <p dir="auto"><strong>Red/black trees</strong></p> <ul dir="auto"> <li>These are a translation of a 2-3 tree (see below).</li> <li>In practice: Red–black trees offer worst-case guarantees for insertion time, deletion time, and search time. Not only does this make them valuable in time-sensitive applications such as real-time applications, but it makes them valuable building blocks in other data structures that provide worst-case guarantees; for example, many data structures used in computational geometry can be based on red-black trees, and the Completely Fair Scheduler used in current Linux kernels uses red–black trees. In version 8 of Java, the Collection HashMap has been modified such that instead of using a LinkedList to store identical elements with poor hashcodes, a Red-Black tree is used</li> <li><a href="https://youtu.be/1W3x0f_RmUo?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3871" rel="nofollow">Aduni - Algorithms - Lecture 4 (link jumps to the starting point) (video)</a></li> <li><a href="https://www.youtube.com/watch?v=hm2GHwyKF1o&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=5" rel="nofollow">Aduni - Algorithms - Lecture 5 (video)</a></li> <li><a href="https://en.wikipedia.org/wiki/Red%E2%80%93black_tree" rel="nofollow">Red-Black Tree</a></li> <li><a href="https://www.topcoder.com/thrive/articles/An%20Introduction%20to%20Binary%20Search%20and%20Red-Black%20Trees" rel="nofollow">An Introduction To Binary Search And Red Black Tree</a></li> <li><a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZNqDI8qfOZgzbqahCUmUEin" rel="nofollow">[Review] Red-Black Trees (playlist) in 30 minutes (video)</a></li> </ul> </li> <li> <p dir="auto"><strong>2-3 search trees</strong></p> <ul dir="auto"> <li>In practice: 2-3 trees have faster inserts at the expense of slower searches (since height is more compared to AVL trees).</li> <li>You would use 2-3 trees very rarely because its implementation involves different types of nodes. Instead, people use Red-Black trees.</li> <li><a href="https://www.youtube.com/watch?v=C3SsdUqasD4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=2" rel="nofollow">23-Tree Intuition and Definition (video)</a></li> <li><a href="https://www.youtube.com/watch?v=iYvBtGKsqSg&index=3&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6" rel="nofollow">Binary View of 23-Tree</a></li> <li><a href="https://www.youtube.com/watch?v=TOb1tuEZ2X4&index=5&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">2-3 Trees (student recitation) (video)</a></li> </ul> </li> <li> <p dir="auto"><strong>2-3-4 Trees (aka 2-4 trees)</strong></p> <ul dir="auto"> <li>In practice: For every 2-4 trees, there are corresponding red–black trees with data elements in the same order. The insertion and deletion operations on 2-4 trees are also equivalent to color-flipping and rotations in red–black trees. This makes 2-4 trees an important tool for understanding the logic behind red-black trees, and this is why many introductory algorithm texts introduce 2-4 trees just before red–black trees, even though <strong>2-4 trees are not often used in practice</strong>.</li> <li><a href="https://archive.org/details/ucberkeley_webcast_zqrqYXkth6Q" rel="nofollow">CS 61B Lecture 26: Balanced Search Trees (video)</a></li> <li><a href="https://www.youtube.com/watch?v=DQdMYevEyE4&index=4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6" rel="nofollow">Bottom Up 234-Trees (video)</a></li> <li><a href="https://www.youtube.com/watch?v=2679VQ26Fp4&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=5" rel="nofollow">Top Down 234-Trees (video)</a></li> </ul> </li> <li> <p dir="auto"><strong>N-ary (K-ary, M-ary) trees</strong></p> <ul dir="auto"> <li>note: the N or K is the branching factor (max branches)</li> <li>binary trees are a 2-ary tree, with branching factor = 2</li> <li>2-3 trees are 3-ary</li> <li><a href="https://en.wikipedia.org/wiki/K-ary_tree" rel="nofollow">K-Ary Tree</a></li> </ul> </li> <li> <p dir="auto"><strong>B-Trees</strong></p> <ul dir="auto"> <li>Fun fact: it's a mystery, but the B could stand for Boeing, Balanced, or Bayer (co-inventor).</li> <li>In Practice: B-trees are widely used in databases. Most modern filesystems use B-trees (or Variants). In addition to its use in databases, the B-tree is also used in filesystems to allow quick random access to an arbitrary block in a particular file. The basic problem is turning the file block address into a disk block (or perhaps to a cylinder head sector) address</li> <li><a href="https://en.wikipedia.org/wiki/B-tree" rel="nofollow">B-Tree</a></li> <li><a href="http://btechsmartclass.com/data_structures/b-trees.html" rel="nofollow">B-Tree Datastructure</a></li> <li><a href="https://www.youtube.com/watch?v=I22wEC1tTGo&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6&index=6" rel="nofollow">Introduction to B-Trees (video)</a></li> <li><a href="https://www.youtube.com/watch?v=s3bCdZGrgpA&index=7&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6" rel="nofollow">B-Tree Definition and Insertion (video)</a></li> <li><a href="https://www.youtube.com/watch?v=svfnVhJOfMc&index=8&list=PLA5Lqm4uh9Bbq-E0ZnqTIa8LRaL77ica6" rel="nofollow">B-Tree Deletion (video)</a></li> <li><a href="https://www.youtube.com/watch?v=V3omVLzI0WE&index=7&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf" rel="nofollow">MIT 6.851 - Memory Hierarchy Models (video)</a> - covers cache-oblivious B-Trees, very interesting data structures - the first 37 minutes are very technical, and may be skipped (B is block size, cache line size)</li> <li><a href="https://www.youtube.com/playlist?list=PL9xmBV_5YoZNFPPv98DjTdD9X6UI9KMHz" rel="nofollow">[Review] B-Trees (playlist) in 26 minutes (video)</a></li> </ul> </li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">k-D Trees</h3><a id="user-content-k-d-trees" class="anchor" aria-label="Permalink: k-D Trees" href="#k-d-trees"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Great for finding a number of points in a rectangle or higher-dimensional object</li> <li>A good fit for k-nearest neighbors</li> <li><a href="https://www.youtube.com/watch?v=Y4ZgLlDfKDg" rel="nofollow">kNN K-d tree algorithm (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Skip lists</h3><a id="user-content-skip-lists" class="anchor" aria-label="Permalink: Skip lists" href="#skip-lists"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>"These are somewhat of a cult data structure" - Skiena</li> <li><a href="https://www.youtube.com/watch?v=2g9OSRKJuzM&index=10&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">Randomization: Skip Lists (video)</a></li> <li><a href="https://en.wikipedia.org/wiki/Skip_list" rel="nofollow">For animations and a little more detail</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Network Flows</h3><a id="user-content-network-flows" class="anchor" aria-label="Permalink: Network Flows" href="#network-flows"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=Tl90tNtKvxs" rel="nofollow">Ford-Fulkerson in 5 minutes — Step by step example (video)</a></li> <li><a href="https://www.youtube.com/watch?v=v1VgJmkEJW0" rel="nofollow">Ford-Fulkerson Algorithm (video)</a></li> <li><a href="https://www.youtube.com/watch?v=2vhN4Ice5jI" rel="nofollow">Network Flows (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Disjoint Sets & Union Find</h3><a id="user-content-disjoint-sets--union-find" class="anchor" aria-label="Permalink: Disjoint Sets & Union Find" href="#disjoint-sets--union-find"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://archive.org/details/ucberkeley_webcast_MAEGXTwmUsI" rel="nofollow">UCB 61B - Disjoint Sets; Sorting & selection (video)</a></li> <li><a href="https://www.coursera.org/learn/algorithms-part1/home/week/1" rel="nofollow">Sedgewick Algorithms - Union-Find (6 videos)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Math for Fast Processing</h3><a id="user-content-math-for-fast-processing" class="anchor" aria-label="Permalink: Math for Fast Processing" href="#math-for-fast-processing"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=eCaXlAaN2uE&index=11&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb" rel="nofollow">Integer Arithmetic, Karatsuba Multiplication (video)</a></li> <li><a href="https://www.youtube.com/watch?v=ru7mWZJlRQg" rel="nofollow">The Chinese Remainder Theorem (used in cryptography) (video)</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Treap</h3><a id="user-content-treap" class="anchor" aria-label="Permalink: Treap" href="#treap"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li>Combination of a binary search tree and a heap</li> <li><a href="https://en.wikipedia.org/wiki/Treap" rel="nofollow">Treap</a></li> <li><a href="https://www.youtube.com/watch?v=6podLUYinH8" rel="nofollow">Data Structures: Treaps explained (video)</a></li> <li><a href="https://www.cs.cmu.edu/~scandal/papers/treaps-spaa98.pdf" rel="nofollow">Applications in set operations</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Linear Programming (videos)</h3><a id="user-content-linear-programming-videos" class="anchor" aria-label="Permalink: Linear Programming (videos)" href="#linear-programming-videos"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=M4K6HYLHREQ" rel="nofollow">Linear Programming</a></li> <li><a href="https://www.youtube.com/watch?v=2ACJ9ewUC6U" rel="nofollow">Finding minimum cost</a></li> <li><a href="https://www.youtube.com/watch?v=8AA_81xI3ik" rel="nofollow">Finding maximum value</a></li> <li><a href="https://www.youtube.com/watch?v=44pAWI7v5Zk" rel="nofollow">Solve Linear Equations with Python - Simplex Algorithm</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Geometry, Convex hull (videos)</h3><a id="user-content-geometry-convex-hull-videos" class="anchor" aria-label="Permalink: Geometry, Convex hull (videos)" href="#geometry-convex-hull-videos"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://youtu.be/XIAQRlNkJAw?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&t=3164" rel="nofollow">Graph Alg. IV: Intro to geometric algorithms - Lecture 9</a></li> <li><a href="https://www.youtube.com/watch?v=J5aJEcOr6Eo&index=10&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm" rel="nofollow">Geometric Algorithms: Graham & Jarvis - Lecture 10</a></li> <li><a href="https://www.youtube.com/watch?v=EzeYI7p9MjU&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=2" rel="nofollow">Divide & Conquer: Convex Hull, Median Finding</a></li> </ul> </li> <li> <div class="markdown-heading" dir="auto"><h3 tabindex="-1" class="heading-element" dir="auto">Discrete math</h3><a id="user-content-discrete-math" class="anchor" aria-label="Permalink: Discrete math" href="#discrete-math"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="http://www.infocobuild.com/education/audio-video-courses/computer-science/cs70-spring2015-berkeley.html" rel="nofollow">Computer Science 70, 001 - Spring 2015 - Discrete Mathematics and Probability Theory</a></li> <li><a href="https://www.youtube.com/playlist?list=PLWX710qNZo_sNlSWRMVIh6kfTjolNaZ8t" rel="nofollow">Discrete Mathematics by Shai Simonson (19 videos)</a></li> <li><a href="https://nptel.ac.in/courses/106/106/106106183/" rel="nofollow">Discrete Mathematics By IIT Ropar NPTEL</a></li> </ul> </li> </ul> <hr> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Additional Detail on Some Subjects</h2><a id="user-content-additional-detail-on-some-subjects" class="anchor" aria-label="Permalink: Additional Detail on Some Subjects" href="#additional-detail-on-some-subjects"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <div class="snippet-clipboard-content notranslate position-relative overflow-auto" data-snippet-clipboard-copy-content="I added these to reinforce some ideas already presented above, but didn't want to include them above because it's just too much. It's easy to overdo it on a subject. You want to get hired in this century, right?"><pre class="notranslate"><code>I added these to reinforce some ideas already presented above, but didn't want to include them above because it's just too much. It's easy to overdo it on a subject. You want to get hired in this century, right? </code></pre></div> <ul dir="auto"> <li> <p dir="auto"><strong>SOLID</strong></p> <ul class="contains-task-list"> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> <a href="https://www.youtube.com/watch?v=TMuno5RZNeE" rel="nofollow">Bob Martin SOLID Principles of Object Oriented and Agile Design (video)</a></li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> S - <a href="http://www.oodesign.com/single-responsibility-principle.html" rel="nofollow">Single Responsibility Principle</a> | <a href="http://www.javacodegeeks.com/2011/11/solid-single-responsibility-principle.html" rel="nofollow">Single responsibility to each Object</a> <ul dir="auto"> <li><a href="https://docs.google.com/open?id=0ByOwmqah_nuGNHEtcU5OekdDMkk" rel="nofollow">more flavor</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> O - <a href="http://www.oodesign.com/open-close-principle.html" rel="nofollow">Open/Closed Principle</a> | <a href="https://en.wikipedia.org/wiki/Open/closed_principle" rel="nofollow">On production level Objects are ready for extension but not for modification</a> <ul dir="auto"> <li><a href="http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgN2M5MTkwM2EtNWFkZC00ZTI3LWFjZTUtNTFhZGZiYmUzODc1&hl=en" rel="nofollow">more flavor</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> L - <a href="http://www.oodesign.com/liskov-s-substitution-principle.html" rel="nofollow">Liskov Substitution Principle</a> | <a href="http://stackoverflow.com/questions/56860/what-is-the-liskov-substitution-principle" rel="nofollow">Base Class and Derived class follow ‘IS A’ Principle</a> <ul dir="auto"> <li><a href="http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgNzAzZjA5ZmItNjU3NS00MzQ5LTkwYjMtMDJhNDU5ZTM0MTlh&hl=en" rel="nofollow">more flavor</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> I - <a href="http://www.oodesign.com/interface-segregation-principle.html" rel="nofollow">Interface segregation principle</a> | Clients should not be forced to implement interfaces they don't use <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=3CtAfl7aXAQ" rel="nofollow">Interface Segregation Principle in 5 minutes (video)</a></li> <li><a href="http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgOTViYjJhYzMtMzYxMC00MzFjLWJjMzYtOGJiMDc5N2JkYmJi&hl=en" rel="nofollow">more flavor</a></li> </ul> </li> <li class="task-list-item"><input type="checkbox" id="" disabled="" class="task-list-item-checkbox"> D -<a href="http://www.oodesign.com/dependency-inversion-principle.html" rel="nofollow">Dependency Inversion principle</a> | Reduce the dependency In composition of objects. <ul dir="auto"> <li><a href="http://stackoverflow.com/questions/62539/what-is-the-dependency-inversion-principle-and-why-is-it-important" rel="nofollow">Why Is The Dependency Inversion Principle And Why Is It Important</a></li> <li><a href="http://docs.google.com/a/cleancoder.com/viewer?a=v&pid=explorer&chrome=true&srcid=0BwhCYaYDn8EgMjdlMWIzNGUtZTQ0NC00ZjQ5LTkwYzQtZjRhMDRlNTQ3ZGMz&hl=en" rel="nofollow">more flavor</a></li> </ul> </li> </ul> </li> <li> <p dir="auto"><strong>Union-Find</strong></p> <ul dir="auto"> <li><a href="https://www.coursera.org/learn/data-structures/lecture/JssSY/overview" rel="nofollow">Overview</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/EM5D0/naive-implementations" rel="nofollow">Naive Implementation</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/Mxu0w/trees" rel="nofollow">Trees</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/qb4c2/union-by-rank" rel="nofollow">Union By Rank</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/Q9CVI/path-compression" rel="nofollow">Path Compression</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/GQQLN/analysis-optional" rel="nofollow">Analysis Options</a></li> </ul> </li> <li> <p dir="auto"><strong>More Dynamic Programming</strong> (videos)</p> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=r4-cftqTcdI&ab_channel=MITOpenCourseWare" rel="nofollow">6.006: Dynamic Programming I: Fibonacci, Shortest Paths</a></li> <li><a href="https://www.youtube.com/watch?v=KLBCUx1is2c&ab_channel=MITOpenCourseWare" rel="nofollow">6.006: Dynamic Programming II: Text Justification, Blackjack</a></li> <li><a href="https://www.youtube.com/watch?v=TDo3r5M1LNo&ab_channel=MITOpenCourseWare" rel="nofollow">6.006: DP III: Parenthesization, Edit Distance, Knapsack</a></li> <li><a href="https://www.youtube.com/watch?v=i9OAOk0CUQE&ab_channel=MITOpenCourseWare" rel="nofollow">6.006: DP IV: Guitar Fingering, Tetris, Super Mario Bros.</a></li> <li><a href="https://www.youtube.com/watch?v=Tw1k46ywN6E&index=14&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">6.046: Dynamic Programming & Advanced DP</a></li> <li><a href="https://www.youtube.com/watch?v=NzgFUwOaoIw&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=15" rel="nofollow">6.046: Dynamic Programming: All-Pairs Shortest Paths</a></li> <li><a href="https://www.youtube.com/watch?v=krZI60lKPek&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=12" rel="nofollow">6.046: Dynamic Programming (student recitation)</a></li> </ul> </li> <li> <p dir="auto"><strong>Advanced Graph Processing</strong> (videos)</p> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=mUBmcbbJNf4&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=27" rel="nofollow">Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees</a></li> <li><a href="https://www.youtube.com/watch?v=kQ-UQAzcnzA&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp&index=28" rel="nofollow">Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees</a></li> </ul> </li> <li> <p dir="auto">MIT <strong>Probability</strong> (mathy, and go slowly, which is good for mathy things) (videos):</p> <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=SmFwFdESMHI&index=18&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J - Probability Introduction</a></li> <li><a href="https://www.youtube.com/watch?v=E6FbvM-FGZ8&index=19&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J - Conditional Probability</a></li> <li><a href="https://www.youtube.com/watch?v=l1BCv3qqW4A&index=20&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J - Independence</a></li> <li><a href="https://www.youtube.com/watch?v=MOfhhFaQdjw&list=PLB7540DEDD482705B&index=21" rel="nofollow">MIT 6.042J - Random Variables</a></li> <li><a href="https://www.youtube.com/watch?v=gGlMSe7uEkA&index=22&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J - Expectation I</a></li> <li><a href="https://www.youtube.com/watch?v=oI9fMUqgfxY&index=23&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J - Expectation II</a></li> <li><a href="https://www.youtube.com/watch?v=q4mwO2qS2z4&index=24&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J - Large Deviations</a></li> <li><a href="https://www.youtube.com/watch?v=56iFMY8QW2k&list=PLB7540DEDD482705B&index=25" rel="nofollow">MIT 6.042J - Random Walks</a></li> </ul> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=oDniZCmNmNw&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=19" rel="nofollow">Simonson: Approximation Algorithms (video)</a></p> </li> <li> <p dir="auto"><strong>String Matching</strong></p> <ul dir="auto"> <li>Rabin-Karp (videos): <ul dir="auto"> <li><a href="https://www.coursera.org/lecture/data-structures/rabin-karps-algorithm-c0Qkw" rel="nofollow">Rabin Karps Algorithm</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/nYrc8/optimization-precomputation" rel="nofollow">Precomputing</a></li> <li><a href="https://www.coursera.org/learn/data-structures/lecture/h4ZLc/optimization-implementation-and-analysis" rel="nofollow">Optimization: Implementation and Analysis</a></li> <li><a href="https://www.youtube.com/watch?v=BRO7mVIFt08&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=9" rel="nofollow">Table Doubling, Karp-Rabin</a></li> <li><a href="https://www.youtube.com/watch?v=w6nuXg0BISo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&index=32" rel="nofollow">Rolling Hashes, Amortized Analysis</a></li> </ul> </li> <li>Knuth-Morris-Pratt (KMP): <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=5i7oKodCRJo" rel="nofollow">TThe Knuth-Morris-Pratt (KMP) String Matching Algorithm</a></li> </ul> </li> <li>Boyer–Moore string search algorithm <ul dir="auto"> <li><a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm" rel="nofollow">Boyer-Moore String Search Algorithm</a></li> <li><a href="https://www.youtube.com/watch?v=QDZpzctPf10" rel="nofollow">Advanced String Searching Boyer-Moore-Horspool Algorithms (video)</a></li> </ul> </li> <li><a href="https://www.coursera.org/learn/algorithms-on-strings/home/week/1" rel="nofollow">Coursera: Algorithms on Strings</a> <ul dir="auto"> <li>starts off great, but by the time it gets past KMP it gets more complicated than it needs to be</li> <li>nice explanation of tries</li> <li>can be skipped</li> </ul> </li> </ul> </li> <li> <p dir="auto"><strong>Sorting</strong></p> <ul dir="auto"> <li>Stanford lectures on sorting: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=ENp00xylP7c&index=15&list=PLFE6E58F856038C69" rel="nofollow">Lecture 15 | Programming Abstractions (video)</a></li> <li><a href="https://www.youtube.com/watch?v=y4M9IVgrVKo&index=16&list=PLFE6E58F856038C69" rel="nofollow">Lecture 16 | Programming Abstractions (video)</a></li> </ul> </li> <li>Shai Simonson: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=odNJmw5TOEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=2" rel="nofollow">Algorithms - Sorting - Lecture 2 (video)</a></li> <li><a href="https://www.youtube.com/watch?v=hj8YKFTFKEE&list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&index=3" rel="nofollow">Algorithms - Sorting II - Lecture 3 (video)</a></li> </ul> </li> <li>Steven Skiena lectures on sorting: <ul dir="auto"> <li><a href="https://www.youtube.com/watch?v=jUf-UQ3a0kg&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=8" rel="nofollow">CSE373 2020 - Mergesort/Quicksort (video)</a></li> <li><a href="https://www.youtube.com/watch?v=0ksyQKmre84&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=9" rel="nofollow">CSE373 2020 - Linear Sorting (video)</a></li> </ul> </li> </ul> </li> <li> <p dir="auto">NAND To Tetris: <a href="https://www.coursera.org/learn/build-a-computer" rel="nofollow">Build a Modern Computer from First Principles</a></p> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Video Series</h2><a id="user-content-video-series" class="anchor" aria-label="Permalink: Video Series" href="#video-series"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto">Sit back and enjoy.</p> <ul dir="auto"> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PLrmLmBdmIlpsHaNTPP_jHHDx_os9ItYXr" rel="nofollow">List of individual Dynamic Programming problems (each is short)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL038BE01D3BAEFDB0" rel="nofollow">x86 Architecture, Assembly, Applications (11 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PLE7DDD91010BC51F8" rel="nofollow">MIT 18.06 Linear Algebra, Spring 2005 (35 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL3B08AE665AB9002A" rel="nofollow">Excellent - MIT Calculus Revisited: Single Variable Calculus</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=22hwcnXIGgk&list=PLOtl7M3yp-DX6ic0HGT0PUX_wiNmkWkXx&index=1" rel="nofollow">Skiena lectures from Algorithm Design Manual - CSE373 2020 - Analysis of Algorithms (26 videos)</a></p> </li> <li> <p dir="auto"><a href="https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iAlnI-BQr9hjqADPBtujFJd" rel="nofollow">UC Berkeley 61B (Spring 2014): Data Structures (25 videos)</a></p> </li> <li> <p dir="auto"><a href="https://archive.org/details/ucberkeley-webcast-PL4BBB74C7D2A1049C" rel="nofollow">UC Berkeley 61B (Fall 2006): Data Structures (39 videos)</a></p> </li> <li> <p dir="auto"><a href="https://archive.org/details/ucberkeley-webcast-PL-XXv-cvA_iCl2-D-FS5mk0jFF6cYSJs_" rel="nofollow">UC Berkeley 61C: Machine Structures (26 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PLJ9pm_Rc9HesnkwKlal_buSIHA-jTZMpO" rel="nofollow">OOSE: Software Dev Using UML and Java (21 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PLDSlqjcPpoL64CJdF0Qee5oWqGS6we_Yu" rel="nofollow">MIT 6.004: Computation Structures (49 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL5PHm2jkkXmi5CxxI7b3JCL1TWybTDtKq" rel="nofollow">Carnegie Mellon - Computer Architecture Lectures (39 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=HtSuA80QTyo&list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb&nohtml5=False" rel="nofollow">MIT 6.006: Intro to Algorithms (47 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=zm2VP0kHl1M&list=PL6535748F59DCA484" rel="nofollow">MIT 6.033: Computer System Engineering (22 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PLUl4u3cNGP63gFHB6xb-kVBiQHYe_4hSi" rel="nofollow">MIT 6.034 Artificial Intelligence, Fall 2010 (30 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=L3LMbpZIKhQ&list=PLB7540DEDD482705B" rel="nofollow">MIT 6.042J: Mathematics for Computer Science, Fall 2010 (25 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=2P-yW7LQr08&list=PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp" rel="nofollow">MIT 6.046: Design and Analysis of Algorithms (34 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=cQP8WApzIQQ&list=PLrw6a1wE39_tb2fErI4-WkMbsvGQk9_UB" rel="nofollow">MIT 6.824: Distributed Systems, Spring 2020 (20 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=T0yzrZL1py0&list=PLUl4u3cNGP61hsJNdULdudlRL493b-XZf&index=1" rel="nofollow">MIT 6.851: Advanced Data Structures (22 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL6ogFv-ieghdoGKGg2Bik3Gl1glBTEu8c" rel="nofollow">MIT 6.854: Advanced Algorithms, Spring 2016 (24 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL2SOU6wwxB0uP4rJgf5ayhHWgw7akUWSf" rel="nofollow">Harvard COMPSCI 224: Advanced Algorithms (25 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/watch?v=GqmQg-cszw4&index=1&list=PLUl4u3cNGP62K2DjQLRxDNRi0z2IRWnNh" rel="nofollow">MIT 6.858 Computer Systems Security, Fall 2014</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL9D558D49CA734A02" rel="nofollow">Stanford: Programming Paradigms (27 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PL6N5qY2nvvJE8X75VkXglSrVhLv1tVcfy" rel="nofollow">Introduction to Cryptography by Christof Paar</a></p> <ul dir="auto"> <li><a href="http://www.crypto-textbook.com/" rel="nofollow">Course Website along with Slides and Problem Sets</a></li> </ul> </li> <li> <p dir="auto"><a href="https://www.youtube.com/playlist?list=PLLssT5z_DsK9JDLcT8T62VtzwyW9LNepV" rel="nofollow">Mining Massive Datasets - Stanford University (94 videos)</a></p> </li> <li> <p dir="auto"><a href="https://www.youtube.com/user/DrSaradaHerke/playlists?shelf_id=5&view=50&sort=dd" rel="nofollow">Graph Theory by Sarada Herke (67 videos)</a></p> </li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Computer Science Courses</h2><a id="user-content-computer-science-courses" class="anchor" aria-label="Permalink: Computer Science Courses" href="#computer-science-courses"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://github.com/open-source-society/computer-science">Directory of Online CS Courses</a></li> <li><a href="https://github.com/prakhar1989/awesome-courses">Directory of CS Courses (many with online lectures)</a></li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Algorithms implementation</h2><a id="user-content-algorithms-implementation" class="anchor" aria-label="Permalink: Algorithms implementation" href="#algorithms-implementation"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://algs4.cs.princeton.edu/code" rel="nofollow">Multiple Algorithms implementation by Princeton University</a></li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">Papers</h2><a id="user-content-papers" class="anchor" aria-label="Permalink: Papers" href="#papers"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <ul dir="auto"> <li><a href="https://www.cs.cmu.edu/~crary/819-f09/" rel="nofollow">Love classic papers?</a></li> <li><a href="http://spinroot.com/courses/summer/Papers/hoare_1978.pdf" rel="nofollow">1978: Communicating Sequential Processes</a> <ul dir="auto"> <li><a href="https://godoc.org/github.com/thomas11/csp" rel="nofollow">implemented in Go</a></li> </ul> </li> <li><a href="http://static.googleusercontent.com/media/research.google.com/en//archive/gfs-sosp2003.pdf" rel="nofollow">2003: The Google File System</a> <ul dir="auto"> <li>replaced by Colossus in 2012</li> </ul> </li> <li><a href="http://static.googleusercontent.com/media/research.google.com/en//archive/mapreduce-osdi04.pdf" rel="nofollow">2004: MapReduce: Simplified Data Processing on Large Clusters</a> <ul dir="auto"> <li>mostly replaced by Cloud Dataflow?</li> </ul> </li> <li><a href="https://static.googleusercontent.com/media/research.google.com/en//archive/bigtable-osdi06.pdf" rel="nofollow">2006: Bigtable: A Distributed Storage System for Structured Data</a></li> <li><a href="https://research.google.com/archive/chubby-osdi06.pdf" rel="nofollow">2006: The Chubby Lock Service for Loosely-Coupled Distributed Systems</a></li> <li><a href="http://s3.amazonaws.com/AllThingsDistributed/sosp/amazon-dynamo-sosp2007.pdf" rel="nofollow">2007: Dynamo: Amazon’s Highly Available Key-value Store</a> <ul dir="auto"> <li>The Dynamo paper kicked off the NoSQL revolution</li> </ul> </li> <li><a href="https://www.akkadia.org/drepper/cpumemory.pdf" rel="nofollow">2007: What Every Programmer Should Know About Memory (very long, and the author encourages skipping of some sections)</a></li> <li>2012: AddressSanitizer: A Fast Address Sanity Checker: <ul dir="auto"> <li><a href="http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/37752.pdf" rel="nofollow">paper</a></li> <li><a href="https://www.usenix.org/conference/atc12/technical-sessions/presentation/serebryany" rel="nofollow">video</a></li> </ul> </li> <li>2013: Spanner: Google’s Globally-Distributed Database: <ul dir="auto"> <li><a href="http://static.googleusercontent.com/media/research.google.com/en//archive/spanner-osdi2012.pdf" rel="nofollow">paper</a></li> <li><a href="https://www.usenix.org/node/170855" rel="nofollow">video</a></li> </ul> </li> <li><a href="http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43790.pdf" rel="nofollow">2015: Continuous Pipelines at Google</a></li> <li><a href="https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/44686.pdf" rel="nofollow">2015: High-Availability at Massive Scale: Building Google’s Data Infrastructure for Ads</a></li> <li><a href="http://static.googleusercontent.com/media/research.google.com/en//pubs/archive/43835.pdf" rel="nofollow">2015: How Developers Search for Code: A Case Study</a></li> <li>More papers: <a href="https://github.com/0voice/computer_expert_paper">1,000 papers</a></li> </ul> <p dir="auto"><strong><a href="#table-of-contents">⬆ back to top</a></strong></p> <div class="markdown-heading" dir="auto"><h2 tabindex="-1" class="heading-element" dir="auto">LICENSE</h2><a id="user-content-license" class="anchor" aria-label="Permalink: LICENSE" href="#license"><svg class="octicon octicon-link" viewBox="0 0 16 16" version="1.1" width="16" height="16" aria-hidden="true"><path d="m7.775 3.275 1.25-1.25a3.5 3.5 0 1 1 4.95 4.95l-2.5 2.5a3.5 3.5 0 0 1-4.95 0 .751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018 1.998 1.998 0 0 0 2.83 0l2.5-2.5a2.002 2.002 0 0 0-2.83-2.83l-1.25 1.25a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042Zm-4.69 9.64a1.998 1.998 0 0 0 2.83 0l1.25-1.25a.751.751 0 0 1 1.042.018.751.751 0 0 1 .018 1.042l-1.25 1.25a3.5 3.5 0 1 1-4.95-4.95l2.5-2.5a3.5 3.5 0 0 1 4.95 0 .751.751 0 0 1-.018 1.042.751.751 0 0 1-1.042.018 1.998 1.998 0 0 0-2.83 0l-2.5 2.5a1.998 1.998 0 0 0 0 2.83Z"></path></svg></a></div> <p dir="auto"><a href="/jwasham/coding-interview-university/blob/main/LICENSE.txt">CC-BY-SA-4.0</a></p> </article></div></div></div></div></div> <!-- --> <!-- --> <script type="application/json" id="__PRIMER_DATA_:R0:__">{"resolvedServerColorMode":"day"}</script></div> </react-partial> <input type="hidden" data-csrf="true" value="EuOvBIENP27gI3Su1lQb7F20y6tENNuzRrVHFh4koBZGfsBPlmlfTKyjK5taCoLB4x9TY3fkFi4TDh4gipsntw==" /> </div> <div data-view-component="true" class="Layout-sidebar"> <div class="BorderGrid about-margin" data-pjax> <div class="BorderGrid-row"> <div class="BorderGrid-cell"> <div class="hide-sm hide-md"> <h2 class="mb-3 h4">About</h2> <p class="f4 my-3"> A complete computer science study plan to become a software engineer. </p> <h3 class="sr-only">Topics</h3> <div class="my-3"> <div class="f6"> <a href="/topics/computer-science" title="Topic: computer-science" data-view-component="true" class="topic-tag topic-tag-link"> computer-science </a> <a href="/topics/algorithm" title="Topic: algorithm" data-view-component="true" class="topic-tag topic-tag-link"> algorithm </a> <a href="/topics/algorithms" title="Topic: algorithms" data-view-component="true" class="topic-tag topic-tag-link"> algorithms </a> <a href="/topics/interview" title="Topic: interview" data-view-component="true" class="topic-tag topic-tag-link"> interview </a> <a href="/topics/data-structures" title="Topic: data-structures" data-view-component="true" class="topic-tag topic-tag-link"> data-structures </a> <a href="/topics/software-engineering" title="Topic: software-engineering" data-view-component="true" class="topic-tag topic-tag-link"> software-engineering </a> <a href="/topics/coding-interviews" title="Topic: coding-interviews" data-view-component="true" class="topic-tag topic-tag-link"> coding-interviews </a> <a href="/topics/study-plan" title="Topic: study-plan" data-view-component="true" class="topic-tag topic-tag-link"> study-plan </a> <a href="/topics/interview-prep" title="Topic: interview-prep" data-view-component="true" class="topic-tag topic-tag-link"> interview-prep </a> <a href="/topics/interview-preparation" title="Topic: interview-preparation" data-view-component="true" class="topic-tag topic-tag-link"> interview-preparation </a> <a href="/topics/coding-interview" title="Topic: coding-interview" data-view-component="true" class="topic-tag topic-tag-link"> coding-interview </a> <a href="/topics/programming-interviews" title="Topic: programming-interviews" data-view-component="true" class="topic-tag topic-tag-link"> programming-interviews </a> </div> </div> <h3 class="sr-only">Resources</h3> <div class="mt-2"> <a class="Link--muted" data-analytics-event="{"category":"Repository Overview","action":"click","label":"location:sidebar;file:readme"}" href="#readme-ov-file"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-book mr-2"> <path d="M0 1.75A.75.75 0 0 1 .75 1h4.253c1.227 0 2.317.59 3 1.501A3.743 3.743 0 0 1 11.006 1h4.245a.75.75 0 0 1 .75.75v10.5a.75.75 0 0 1-.75.75h-4.507a2.25 2.25 0 0 0-1.591.659l-.622.621a.75.75 0 0 1-1.06 0l-.622-.621A2.25 2.25 0 0 0 5.258 13H.75a.75.75 0 0 1-.75-.75Zm7.251 10.324.004-5.073-.002-2.253A2.25 2.25 0 0 0 5.003 2.5H1.5v9h3.757a3.75 3.75 0 0 1 1.994.574ZM8.755 4.75l-.004 7.322a3.752 3.752 0 0 1 1.992-.572H14.5v-9h-3.495a2.25 2.25 0 0 0-2.25 2.25Z"></path> </svg> Readme </a> </div> <h3 class="sr-only">License</h3> <div class="mt-2"> <a href="#CC-BY-SA-4.0-1-ov-file" class="Link--muted" data-analytics-event="{"category":"Repository Overview","action":"click","label":"location:sidebar;file:license"}" > <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-law mr-2"> <path d="M8.75.75V2h.985c.304 0 .603.08.867.231l1.29.736c.038.022.08.033.124.033h2.234a.75.75 0 0 1 0 1.5h-.427l2.111 4.692a.75.75 0 0 1-.154.838l-.53-.53.529.531-.001.002-.002.002-.006.006-.006.005-.01.01-.045.04c-.21.176-.441.327-.686.45C14.556 10.78 13.88 11 13 11a4.498 4.498 0 0 1-2.023-.454 3.544 3.544 0 0 1-.686-.45l-.045-.04-.016-.015-.006-.006-.004-.004v-.001a.75.75 0 0 1-.154-.838L12.178 4.5h-.162c-.305 0-.604-.079-.868-.231l-1.29-.736a.245.245 0 0 0-.124-.033H8.75V13h2.5a.75.75 0 0 1 0 1.5h-6.5a.75.75 0 0 1 0-1.5h2.5V3.5h-.984a.245.245 0 0 0-.124.033l-1.289.737c-.265.15-.564.23-.869.23h-.162l2.112 4.692a.75.75 0 0 1-.154.838l-.53-.53.529.531-.001.002-.002.002-.006.006-.016.015-.045.04c-.21.176-.441.327-.686.45C4.556 10.78 3.88 11 3 11a4.498 4.498 0 0 1-2.023-.454 3.544 3.544 0 0 1-.686-.45l-.045-.04-.016-.015-.006-.006-.004-.004v-.001a.75.75 0 0 1-.154-.838L2.178 4.5H1.75a.75.75 0 0 1 0-1.5h2.234a.249.249 0 0 0 .125-.033l1.288-.737c.265-.15.564-.23.869-.23h.984V.75a.75.75 0 0 1 1.5 0Zm2.945 8.477c.285.135.718.273 1.305.273s1.02-.138 1.305-.273L13 6.327Zm-10 0c.285.135.718.273 1.305.273s1.02-.138 1.305-.273L3 6.327Z"></path> </svg> CC-BY-SA-4.0 license </a> </div> <include-fragment src="/jwasham/coding-interview-university/hovercards/citation/sidebar_partial?tree_name=main"> </include-fragment> <div class="mt-2"> <a href="/jwasham/coding-interview-university/activity" data-view-component="true" class="Link Link--muted"><svg text="gray" aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-pulse mr-2"> <path d="M6 2c.306 0 .582.187.696.471L10 10.731l1.304-3.26A.751.751 0 0 1 12 7h3.25a.75.75 0 0 1 0 1.5h-2.742l-1.812 4.528a.751.751 0 0 1-1.392 0L6 4.77 4.696 8.03A.75.75 0 0 1 4 8.5H.75a.75.75 0 0 1 0-1.5h2.742l1.812-4.529A.751.751 0 0 1 6 2Z"></path> </svg> <span class="color-fg-muted">Activity</span></a> </div> <h3 class="sr-only">Stars</h3> <div class="mt-2"> <a href="/jwasham/coding-interview-university/stargazers" data-view-component="true" class="Link Link--muted"><svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-star mr-2"> <path d="M8 .25a.75.75 0 0 1 .673.418l1.882 3.815 4.21.612a.75.75 0 0 1 .416 1.279l-3.046 2.97.719 4.192a.751.751 0 0 1-1.088.791L8 12.347l-3.766 1.98a.75.75 0 0 1-1.088-.79l.72-4.194L.818 6.374a.75.75 0 0 1 .416-1.28l4.21-.611L7.327.668A.75.75 0 0 1 8 .25Zm0 2.445L6.615 5.5a.75.75 0 0 1-.564.41l-3.097.45 2.24 2.184a.75.75 0 0 1 .216.664l-.528 3.084 2.769-1.456a.75.75 0 0 1 .698 0l2.77 1.456-.53-3.084a.75.75 0 0 1 .216-.664l2.24-2.183-3.096-.45a.75.75 0 0 1-.564-.41L8 2.694Z"></path> </svg> <strong>312k</strong> stars</a> </div> <h3 class="sr-only">Watchers</h3> <div class="mt-2"> <a href="/jwasham/coding-interview-university/watchers" data-view-component="true" class="Link Link--muted"><svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-eye mr-2"> <path d="M8 2c1.981 0 3.671.992 4.933 2.078 1.27 1.091 2.187 2.345 2.637 3.023a1.62 1.62 0 0 1 0 1.798c-.45.678-1.367 1.932-2.637 3.023C11.67 13.008 9.981 14 8 14c-1.981 0-3.671-.992-4.933-2.078C1.797 10.83.88 9.576.43 8.898a1.62 1.62 0 0 1 0-1.798c.45-.677 1.367-1.931 2.637-3.022C4.33 2.992 6.019 2 8 2ZM1.679 7.932a.12.12 0 0 0 0 .136c.411.622 1.241 1.75 2.366 2.717C5.176 11.758 6.527 12.5 8 12.5c1.473 0 2.825-.742 3.955-1.715 1.124-.967 1.954-2.096 2.366-2.717a.12.12 0 0 0 0-.136c-.412-.621-1.242-1.75-2.366-2.717C10.824 4.242 9.473 3.5 8 3.5c-1.473 0-2.825.742-3.955 1.715-1.124.967-1.954 2.096-2.366 2.717ZM8 10a2 2 0 1 1-.001-3.999A2 2 0 0 1 8 10Z"></path> </svg> <strong>8.4k</strong> watching</a> </div> <h3 class="sr-only">Forks</h3> <div class="mt-2"> <a href="/jwasham/coding-interview-university/forks" data-view-component="true" class="Link Link--muted"><svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-repo-forked mr-2"> <path d="M5 5.372v.878c0 .414.336.75.75.75h4.5a.75.75 0 0 0 .75-.75v-.878a2.25 2.25 0 1 1 1.5 0v.878a2.25 2.25 0 0 1-2.25 2.25h-1.5v2.128a2.251 2.251 0 1 1-1.5 0V8.5h-1.5A2.25 2.25 0 0 1 3.5 6.25v-.878a2.25 2.25 0 1 1 1.5 0ZM5 3.25a.75.75 0 1 0-1.5 0 .75.75 0 0 0 1.5 0Zm6.75.75a.75.75 0 1 0 0-1.5.75.75 0 0 0 0 1.5Zm-3 8.75a.75.75 0 1 0-1.5 0 .75.75 0 0 0 1.5 0Z"></path> </svg> <strong>77.9k</strong> forks</a> </div> <div class="mt-2"> <a class="Link--muted" href="/contact/report-content?content_url=https%3A%2F%2Fgithub.com%2Fjwasham%2Fcoding-interview-university&report=jwasham+%28user%29"> Report repository </a> </div> </div> </div> </div> <div class="BorderGrid-row"> <div class="BorderGrid-cell"> <h2 class="h4 mb-3" data-pjax="#repo-content-pjax-container" data-turbo-frame="repo-content-turbo-frame"> <a href="/jwasham/coding-interview-university/releases" data-view-component="true" class="Link--primary no-underline Link">Releases</a></h2> <div class="text-small color-fg-muted">No releases published</div> </div> </div> <div class="BorderGrid-row"> <div class="BorderGrid-cell"> <h2 class="h4 mb-3"> <a href="/users/jwasham/packages?repo_name=coding-interview-university" data-view-component="true" class="Link--primary no-underline Link d-flex flex-items-center">Packages <span title="0" hidden="hidden" data-view-component="true" class="Counter ml-1">0</span></a></h2> <div class="text-small color-fg-muted" > No packages published <br> </div> </div> </div> <div class="BorderGrid-row" hidden> <div class="BorderGrid-cell"> <include-fragment src="/jwasham/coding-interview-university/used_by_list" accept="text/fragment+html"> </include-fragment> </div> </div> <div class="BorderGrid-row"> <div class="BorderGrid-cell"> <h2 class="h4 mb-3"> <a href="/jwasham/coding-interview-university/graphs/contributors" data-view-component="true" class="Link--primary no-underline Link d-flex flex-items-center">Contributors <span title="317" data-view-component="true" class="Counter ml-1">317</span></a></h2> <ul class="list-style-none d-flex flex-wrap mb-n2"> <li class="mb-2 mr-2" > <a href="https://github.com/jwasham" class="" data-hovercard-type="user" data-hovercard-url="/users/jwasham/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/3771963?s=64&v=4" alt="@jwasham" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/Anri-Lombard" class="" data-hovercard-type="user" data-hovercard-url="/users/Anri-Lombard/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/76818211?s=64&v=4" alt="@Anri-Lombard" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/avizmarlon" class="" data-hovercard-type="user" data-hovercard-url="/users/avizmarlon/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/24354489?s=64&v=4" alt="@avizmarlon" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/esaucedof" class="" data-hovercard-type="user" data-hovercard-url="/users/esaucedof/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/13459501?s=64&v=4" alt="@esaucedof" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/Ilyushin" class="" data-hovercard-type="user" data-hovercard-url="/users/Ilyushin/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/4519586?s=64&v=4" alt="@Ilyushin" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/hexatester" class="" data-hovercard-type="user" data-hovercard-url="/users/hexatester/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/40712079?s=64&v=4" alt="@hexatester" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/aleen42" class="" data-hovercard-type="user" data-hovercard-url="/users/aleen42/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/9573300?s=64&v=4" alt="@aleen42" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/letientai299" class="" data-hovercard-type="user" data-hovercard-url="/users/letientai299/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/8386780?s=64&v=4" alt="@letientai299" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/dossorio" class="" data-hovercard-type="user" data-hovercard-url="/users/dossorio/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/4788852?s=64&v=4" alt="@dossorio" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/vsay01" class="" data-hovercard-type="user" data-hovercard-url="/users/vsay01/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/6526127?s=64&v=4" alt="@vsay01" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/joonas-yoon" class="" data-hovercard-type="user" data-hovercard-url="/users/joonas-yoon/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/9527681?s=64&v=4" alt="@joonas-yoon" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/tsakishii" class="" data-hovercard-type="user" data-hovercard-url="/users/tsakishii/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/42769725?s=64&v=4" alt="@tsakishii" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/saurabh-mhaisekar" class="" data-hovercard-type="user" data-hovercard-url="/users/saurabh-mhaisekar/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/11988820?s=64&v=4" alt="@saurabh-mhaisekar" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> <li class="mb-2 mr-2" > <a href="https://github.com/DimoDimchev" class="" data-hovercard-type="user" data-hovercard-url="/users/DimoDimchev/hovercard" data-octo-click="hovercard-link-click" data-octo-dimensions="link_type:self" > <img src="https://avatars.githubusercontent.com/u/38102582?s=64&v=4" alt="@DimoDimchev" size="32" height="32" width="32" data-view-component="true" class="avatar circle" /> </a> </li> </ul> <div data-view-component="true" class="mt-3"> <a text="small" href="/jwasham/coding-interview-university/graphs/contributors" data-view-component="true" class="Link--inTextBlock Link">+ 303 contributors</a></div> </div> </div> </div> </div> </div></div> </div> </div> </turbo-frame> </main> </div> </div> <footer class="footer pt-8 pb-6 f6 color-fg-muted p-responsive" role="contentinfo" > <h2 class='sr-only'>Footer</h2> <div class="d-flex flex-justify-center flex-items-center flex-column-reverse flex-lg-row flex-wrap flex-lg-nowrap"> <div class="d-flex flex-items-center flex-shrink-0 mx-2"> <a aria-label="Homepage" title="GitHub" class="footer-octicon mr-2" href="https://github.com"> <svg aria-hidden="true" height="24" viewBox="0 0 24 24" version="1.1" width="24" data-view-component="true" class="octicon octicon-mark-github"> <path d="M12.5.75C6.146.75 1 5.896 1 12.25c0 5.089 3.292 9.387 7.863 10.91.575.101.79-.244.79-.546 0-.273-.014-1.178-.014-2.142-2.889.532-3.636-.704-3.866-1.35-.13-.331-.69-1.352-1.18-1.625-.402-.216-.977-.748-.014-.762.906-.014 1.553.834 1.769 1.179 1.035 1.74 2.688 1.25 3.349.948.1-.747.402-1.25.733-1.538-2.559-.287-5.232-1.279-5.232-5.678 0-1.25.445-2.285 1.178-3.09-.115-.288-.517-1.467.115-3.048 0 0 .963-.302 3.163 1.179.92-.259 1.897-.388 2.875-.388.977 0 1.955.13 2.875.388 2.2-1.495 3.162-1.179 3.162-1.179.633 1.581.23 2.76.115 3.048.733.805 1.179 1.825 1.179 3.09 0 4.413-2.688 5.39-5.247 5.678.417.36.776 1.05.776 2.128 0 1.538-.014 2.774-.014 3.162 0 .302.216.662.79.547C20.709 21.637 24 17.324 24 12.25 24 5.896 18.854.75 12.5.75Z"></path> </svg> </a> <span> © 2025 GitHub, Inc. </span> </div> <nav aria-label="Footer"> <h3 class="sr-only" id="sr-footer-heading">Footer navigation</h3> <ul class="list-style-none d-flex flex-justify-center flex-wrap mb-2 mb-lg-0" aria-labelledby="sr-footer-heading"> <li class="mx-2"> <a data-analytics-event="{"category":"Footer","action":"go to Terms","label":"text:terms"}" href="https://docs.github.com/site-policy/github-terms/github-terms-of-service" data-view-component="true" class="Link--secondary Link">Terms</a> </li> <li class="mx-2"> <a data-analytics-event="{"category":"Footer","action":"go to privacy","label":"text:privacy"}" href="https://docs.github.com/site-policy/privacy-policies/github-privacy-statement" data-view-component="true" class="Link--secondary Link">Privacy</a> </li> <li class="mx-2"> <a data-analytics-event="{"category":"Footer","action":"go to security","label":"text:security"}" href="https://github.com/security" data-view-component="true" class="Link--secondary Link">Security</a> </li> <li class="mx-2"> <a data-analytics-event="{"category":"Footer","action":"go to status","label":"text:status"}" href="https://www.githubstatus.com/" data-view-component="true" class="Link--secondary Link">Status</a> </li> <li class="mx-2"> <a data-analytics-event="{"category":"Footer","action":"go to docs","label":"text:docs"}" href="https://docs.github.com/" data-view-component="true" class="Link--secondary Link">Docs</a> </li> <li class="mx-2"> <a data-analytics-event="{"category":"Footer","action":"go to contact","label":"text:contact"}" href="https://support.github.com?tags=dotcom-footer" data-view-component="true" class="Link--secondary Link">Contact</a> </li> <li class="mx-2" > <cookie-consent-link> <button type="button" class="Link--secondary underline-on-hover border-0 p-0 color-bg-transparent" data-action="click:cookie-consent-link#showConsentManagement" data-analytics-event="{"location":"footer","action":"cookies","context":"subfooter","tag":"link","label":"cookies_link_subfooter_footer"}" > Manage cookies </button> </cookie-consent-link> </li> <li class="mx-2"> <cookie-consent-link> <button type="button" class="Link--secondary underline-on-hover border-0 p-0 color-bg-transparent" data-action="click:cookie-consent-link#showConsentManagement" data-analytics-event="{"location":"footer","action":"dont_share_info","context":"subfooter","tag":"link","label":"dont_share_info_link_subfooter_footer"}" > Do not share my personal information </button> </cookie-consent-link> </li> </ul> </nav> </div> </footer> <ghcc-consent id="ghcc" class="position-fixed bottom-0 left-0" style="z-index: 999999" data-initial-cookie-consent-allowed="" data-cookie-consent-required="false"></ghcc-consent> <div id="ajax-error-message" class="ajax-error-message flash flash-error" hidden> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-alert"> <path d="M6.457 1.047c.659-1.234 2.427-1.234 3.086 0l6.082 11.378A1.75 1.75 0 0 1 14.082 15H1.918a1.75 1.75 0 0 1-1.543-2.575Zm1.763.707a.25.25 0 0 0-.44 0L1.698 13.132a.25.25 0 0 0 .22.368h12.164a.25.25 0 0 0 .22-.368Zm.53 3.996v2.5a.75.75 0 0 1-1.5 0v-2.5a.75.75 0 0 1 1.5 0ZM9 11a1 1 0 1 1-2 0 1 1 0 0 1 2 0Z"></path> </svg> <button type="button" class="flash-close js-ajax-error-dismiss" aria-label="Dismiss error"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x"> <path d="M3.72 3.72a.75.75 0 0 1 1.06 0L8 6.94l3.22-3.22a.749.749 0 0 1 1.275.326.749.749 0 0 1-.215.734L9.06 8l3.22 3.22a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L8 9.06l-3.22 3.22a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L6.94 8 3.72 4.78a.75.75 0 0 1 0-1.06Z"></path> </svg> </button> You can’t perform that action at this time. </div> <template id="site-details-dialog"> <details class="details-reset details-overlay details-overlay-dark lh-default color-fg-default hx_rsm" open> <summary role="button" aria-label="Close dialog"></summary> <details-dialog class="Box Box--overlay d-flex flex-column anim-fade-in fast hx_rsm-dialog hx_rsm-modal"> <button class="Box-btn-octicon m-0 btn-octicon position-absolute right-0 top-0" type="button" aria-label="Close dialog" data-close-dialog> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-x"> <path d="M3.72 3.72a.75.75 0 0 1 1.06 0L8 6.94l3.22-3.22a.749.749 0 0 1 1.275.326.749.749 0 0 1-.215.734L9.06 8l3.22 3.22a.749.749 0 0 1-.326 1.275.749.749 0 0 1-.734-.215L8 9.06l-3.22 3.22a.751.751 0 0 1-1.042-.018.751.751 0 0 1-.018-1.042L6.94 8 3.72 4.78a.75.75 0 0 1 0-1.06Z"></path> </svg> </button> <div class="octocat-spinner my-6 js-details-dialog-spinner"></div> </details-dialog> </details> </template> <div class="Popover js-hovercard-content position-absolute" style="display: none; outline: none;"> <div class="Popover-message Popover-message--bottom-left Popover-message--large Box color-shadow-large" style="width:360px;"> </div> </div> <template id="snippet-clipboard-copy-button"> <div class="zeroclipboard-container position-absolute right-0 top-0"> <clipboard-copy aria-label="Copy" class="ClipboardButton btn js-clipboard-copy m-2 p-0" data-copy-feedback="Copied!" data-tooltip-direction="w"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-copy js-clipboard-copy-icon m-2"> <path d="M0 6.75C0 5.784.784 5 1.75 5h1.5a.75.75 0 0 1 0 1.5h-1.5a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h7.5a.25.25 0 0 0 .25-.25v-1.5a.75.75 0 0 1 1.5 0v1.5A1.75 1.75 0 0 1 9.25 16h-7.5A1.75 1.75 0 0 1 0 14.25Z"></path><path d="M5 1.75C5 .784 5.784 0 6.75 0h7.5C15.216 0 16 .784 16 1.75v7.5A1.75 1.75 0 0 1 14.25 11h-7.5A1.75 1.75 0 0 1 5 9.25Zm1.75-.25a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h7.5a.25.25 0 0 0 .25-.25v-7.5a.25.25 0 0 0-.25-.25Z"></path> </svg> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-check js-clipboard-check-icon color-fg-success d-none m-2"> <path d="M13.78 4.22a.75.75 0 0 1 0 1.06l-7.25 7.25a.75.75 0 0 1-1.06 0L2.22 9.28a.751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018L6 10.94l6.72-6.72a.75.75 0 0 1 1.06 0Z"></path> </svg> </clipboard-copy> </div> </template> <template id="snippet-clipboard-copy-button-unpositioned"> <div class="zeroclipboard-container"> <clipboard-copy aria-label="Copy" class="ClipboardButton btn btn-invisible js-clipboard-copy m-2 p-0 d-flex flex-justify-center flex-items-center" data-copy-feedback="Copied!" data-tooltip-direction="w"> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-copy js-clipboard-copy-icon"> <path d="M0 6.75C0 5.784.784 5 1.75 5h1.5a.75.75 0 0 1 0 1.5h-1.5a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h7.5a.25.25 0 0 0 .25-.25v-1.5a.75.75 0 0 1 1.5 0v1.5A1.75 1.75 0 0 1 9.25 16h-7.5A1.75 1.75 0 0 1 0 14.25Z"></path><path d="M5 1.75C5 .784 5.784 0 6.75 0h7.5C15.216 0 16 .784 16 1.75v7.5A1.75 1.75 0 0 1 14.25 11h-7.5A1.75 1.75 0 0 1 5 9.25Zm1.75-.25a.25.25 0 0 0-.25.25v7.5c0 .138.112.25.25.25h7.5a.25.25 0 0 0 .25-.25v-7.5a.25.25 0 0 0-.25-.25Z"></path> </svg> <svg aria-hidden="true" height="16" viewBox="0 0 16 16" version="1.1" width="16" data-view-component="true" class="octicon octicon-check js-clipboard-check-icon color-fg-success d-none"> <path d="M13.78 4.22a.75.75 0 0 1 0 1.06l-7.25 7.25a.75.75 0 0 1-1.06 0L2.22 9.28a.751.751 0 0 1 .018-1.042.751.751 0 0 1 1.042-.018L6 10.94l6.72-6.72a.75.75 0 0 1 1.06 0Z"></path> </svg> </clipboard-copy> </div> </template> </div> <div id="js-global-screen-reader-notice" class="sr-only mt-n1" aria-live="polite" aria-atomic="true" ></div> <div id="js-global-screen-reader-notice-assertive" class="sr-only mt-n1" aria-live="assertive" aria-atomic="true"></div> </body> </html>