{"id":2,"date":"2016-02-11T07:01:37","date_gmt":"2016-02-11T07:01:37","guid":{"rendered":"http:\/\/www.notexponential.com\/blog\/?page_id=2"},"modified":"2016-04-30T11:03:10","modified_gmt":"2016-04-30T15:03:10","slug":"all-lecture-links-slideshare","status":"publish","type":"page","link":"https:\/\/www.notexponential.com\/notes\/lectures\/all-lecture-links-slideshare\/","title":{"rendered":"All Lecture Links &#8211; Slideshare"},"content":{"rendered":"<p><iframe loading=\"lazy\" title=\"Introduction to Algorithms and Asymptotic Notation\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/8m7PibIK8zdfE8\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/algorithms-introduction\" title=\"Introduction to Algorithms and Asymptotic Notation\" target=\"_blank\">Introduction to Algorithms and Asymptotic Notation<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Asymptotic Notation and Data Structures\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/fpAXGEKhy4c2mc\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/asymptotic-notation-and-data-structures\" title=\"Asymptotic Notation and Data Structures\" target=\"_blank\">Asymptotic Notation and Data Structures<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Divide and Conquer - Part 1\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/l6904NbS5AkBLW\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/divide-and-conquer-part-1\" title=\"Divide and Conquer - Part 1\" target=\"_blank\">Divide and Conquer &#8211; Part 1<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Divide and Conquer - Part II - Quickselect and Closest Pair of Points\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/GYGEjbtrnYrxtz\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/slideshow\/divide-and-conquer-part-ii\/39300131\" title=\"Divide and Conquer - Part II - Quickselect and Closest Pair of Points\" target=\"_blank\">Divide and Conquer &#8211; Part II &#8211; Quickselect and Closest Pair of Points<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Greedy Algorithms\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/uEDuA6yOKgrQ2m\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/slideshow\/greedy-algorithms-39397741\/39397741\" title=\"Greedy Algorithms\" target=\"_blank\">Greedy Algorithms<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Dynamic Programming - Part 1\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/ord9c6yaO8J9xr\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/dynamic-programming-part-1\" title=\"Dynamic Programming - Part 1\" target=\"_blank\">Dynamic Programming &#8211; Part 1<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Dynamic Programming - Part II\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/8VBRF5Y2Fqs4gB\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/dynamic-programming-part-ii\" title=\"Dynamic Programming - Part II\" target=\"_blank\">Dynamic Programming &#8211; Part II<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Graph Traversal Algorithms - Depth First Search Traversal\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/4yByau2XPQsdVF\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/slideshow\/graph-traversal-algorithms-depth-first-search-traversal\/60479621\" title=\"Graph Traversal Algorithms - Depth First Search Traversal\" target=\"_blank\">Graph Traversal Algorithms &#8211; Depth First Search Traversal<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"Graph Traversal Algorithms - Breadth First Search\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/4E7CFTSdgodOKm\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/graph-traversal-algorithms-breadth-first-search\" title=\"Graph Traversal Algorithms - Breadth First Search\" target=\"_blank\">Graph Traversal Algorithms &#8211; Breadth First Search<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"NP completeness\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/FZyI4meUCkSm22\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/np-completeness\" title=\"NP completeness\" target=\"_blank\">NP completeness<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n<p>&nbsp;<\/p>\n<p><iframe loading=\"lazy\" title=\"NP-Completeness - II\" src=\"https:\/\/www.slideshare.net\/slideshow\/embed_code\/key\/du90rB0d3kJy8m\" width=\"427\" height=\"356\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" style=\"border:1px solid #CCC; border-width:1px; margin-bottom:5px; max-width: 100%;\" allowfullscreen> <\/iframe> <\/p>\n<div style=\"margin-bottom:5px\"> <strong> <a href=\"https:\/\/www.slideshare.net\/amrinderarora\/npcompleteness-ii\" title=\"NP-Completeness - II\" target=\"_blank\">NP-Completeness &#8211; II<\/a> <\/strong> from <strong><a href=\"https:\/\/www.slideshare.net\/amrinderarora\" target=\"_blank\">Amrinder Arora<\/a><\/strong> <\/div>\n","protected":false},"excerpt":{"rendered":"<p>Introduction to Algorithms and Asymptotic Notation from Amrinder Arora &nbsp; Asymptotic Notation and Data Structures from Amrinder Arora &nbsp; Divide and Conquer &#8211; Part 1 from Amrinder Arora &nbsp; Divide and Conquer &#8211; Part II &#8211; Quickselect and Closest Pair of Points from Amrinder Arora &nbsp; Greedy Algorithms from Amrinder Arora &nbsp; Dynamic Programming &#8211; [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":27,"menu_order":0,"comment_status":"closed","ping_status":"open","template":"","meta":{"footnotes":""},"class_list":["post-2","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/pages\/2","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/comments?post=2"}],"version-history":[{"count":4,"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/pages\/2\/revisions"}],"predecessor-version":[{"id":20,"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/pages\/2\/revisions\/20"}],"up":[{"embeddable":true,"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/pages\/27"}],"wp:attachment":[{"href":"https:\/\/www.notexponential.com\/notes\/wp-json\/wp\/v2\/media?parent=2"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}