https://neeldhara.courses/https://neeldhara.courses/about/https://neeldhara.courses/advalgo/https://neeldhara.courses/advalgo/assessments/https://neeldhara.courses/advalgo/assessments/01-greedy-algorithms/a-generic-problem/https://neeldhara.courses/advalgo/assessments/01-greedy-algorithms/definition-and-examples/https://neeldhara.courses/advalgo/assessments/01-greedy-algorithms/greedy-works/https://neeldhara.courses/advalgo/assessments/01-greedy-algorithms/scheduling-with-deadlines/https://neeldhara.courses/advalgo/assessments/01-greedy-algorithms/when-greedy-fails/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/exam-scheduling/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/flow-decomposition/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/ford-fulkerson/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/introduction/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/ipl-elimination/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/maxflow-mincut/https://neeldhara.courses/advalgo/assessments/02-reductions-i-flows/tuple-selection/https://neeldhara.courses/advalgo/assessments/03-reductions-ii-hardness/3d-matching/https://neeldhara.courses/advalgo/assessments/03-reductions-ii-hardness/finding-the-right-problem/https://neeldhara.courses/advalgo/assessments/03-reductions-ii-hardness/graph-coloring/https://neeldhara.courses/advalgo/assessments/03-reductions-ii-hardness/max-independent-set/https://neeldhara.courses/advalgo/assessments/03-reductions-ii-hardness/p-np-np-hardness/https://neeldhara.courses/advalgo/assessments/03-reductions-ii-hardness/subset-sum/https://neeldhara.courses/advalgo/assessments/04-interlude/co-np/https://neeldhara.courses/advalgo/assessments/04-interlude/pspace-reductions-i/https://neeldhara.courses/advalgo/assessments/04-interlude/pspace-reductions-ii/https://neeldhara.courses/advalgo/assessments/04-interlude/pspace-reductions-iii/https://neeldhara.courses/advalgo/assessments/04-interlude/pspace/https://neeldhara.courses/advalgo/assessments/05-randomized-algorithms/kargers-mincut-algorithm/https://neeldhara.courses/advalgo/assessments/05-randomized-algorithms/minimum-spanning-tree/https://neeldhara.courses/advalgo/assessments/05-randomized-algorithms/probability-basics/https://neeldhara.courses/advalgo/assessments/05-randomized-algorithms/randomized-qs-i/https://neeldhara.courses/advalgo/assessments/05-randomized-algorithms/randomized-qs-ii/https://neeldhara.courses/advalgo/assessments/06-approximation-algorithms/bin-packing/https://neeldhara.courses/advalgo/assessments/06-approximation-algorithms/greedy-set-cover/https://neeldhara.courses/advalgo/assessments/06-approximation-algorithms/primal-dual/https://neeldhara.courses/advalgo/assessments/06-approximation-algorithms/vertex-cover-via-matchings/https://neeldhara.courses/advalgo/assessments/06-approximation-algorithms/vertex-cover-with-lp-i/https://neeldhara.courses/advalgo/assessments/06-approximation-algorithms/vertex-cover-with-lp-ii/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/dp-for-mis/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/introduction/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/iterative-compression-i/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/iterative-compression-ii/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/mis-on-thin-grids/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/nice-tree-decompositions/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/pathwidth/https://neeldhara.courses/advalgo/assessments/07-parameterized-algorithms/treewidth/https://neeldhara.courses/advalgo/assessments/08-exact-algorithms/branch-and-bound/https://neeldhara.courses/advalgo/assessments/08-exact-algorithms/dynamic-programming-i/https://neeldhara.courses/advalgo/assessments/08-exact-algorithms/dynamic-programming-ii/https://neeldhara.courses/advalgo/assessments/08-exact-algorithms/pie-for-chromatic-number-i/https://neeldhara.courses/advalgo/assessments/08-exact-algorithms/pie-for-chromatic-number-ii/https://neeldhara.courses/advalgo/assessments/09-parameterized-approximation/k-path-transversal-i/https://neeldhara.courses/advalgo/assessments/09-parameterized-approximation/k-path-transversal-ii/https://neeldhara.courses/advalgo/assessments/09-parameterized-approximation/min-k-cut-i/https://neeldhara.courses/advalgo/assessments/09-parameterized-approximation/min-k-cut-ii/https://neeldhara.courses/advalgo/assessments/09-parameterized-approximation/min-k-cut-iii/https://neeldhara.courses/advalgo/assessments/09-parameterized-approximation/partial-vertex-cover/https://neeldhara.courses/advalgo/assessments/10-randomized-techniques-for-parameterized-algorithms/chromatic-coding-i/https://neeldhara.courses/advalgo/assessments/10-randomized-techniques-for-parameterized-algorithms/chromatic-coding-ii/https://neeldhara.courses/advalgo/assessments/10-randomized-techniques-for-parameterized-algorithms/color-coding-i/https://neeldhara.courses/advalgo/assessments/10-randomized-techniques-for-parameterized-algorithms/color-coding-ii/https://neeldhara.courses/advalgo/assessments/10-randomized-techniques-for-parameterized-algorithms/derandomization/https://neeldhara.courses/advalgo/assessments/11-randomized-approximation/facility-location-i/https://neeldhara.courses/advalgo/assessments/11-randomized-approximation/facility-location-ii/https://neeldhara.courses/advalgo/assessments/11-randomized-approximation/multiway-cut-i/https://neeldhara.courses/advalgo/assessments/11-randomized-approximation/multiway-cut-ii/https://neeldhara.courses/advalgo/assessments/11-randomized-approximation/set-cover/https://neeldhara.courses/advalgo/assessments/12-hardness/hardness-of-approximation/https://neeldhara.courses/advalgo/assessments/12-hardness/para-np-hardness/https://neeldhara.courses/advalgo/assessments/12-hardness/pcp-theorem-i/https://neeldhara.courses/advalgo/assessments/12-hardness/pcp-theorem-ii/https://neeldhara.courses/advalgo/assessments/12-hardness/ugc/https://neeldhara.courses/advalgo/assessments/12-hardness/w-hardness/https://neeldhara.courses/advalgo/assessments/index/https://neeldhara.courses/advalgo/assessments/introduction/https://neeldhara.courses/advalgo/editions/https://neeldhara.courses/advalgo/editions/current/https://neeldhara.courses/advalgo/notes/https://neeldhara.courses/advalgo/notes/01-greedy-algorithms/a-generic-problem/https://neeldhara.courses/advalgo/notes/01-greedy-algorithms/definition-and-examples/https://neeldhara.courses/advalgo/notes/01-greedy-algorithms/greedy-works/https://neeldhara.courses/advalgo/notes/01-greedy-algorithms/scheduling-with-deadlines/https://neeldhara.courses/advalgo/notes/01-greedy-algorithms/when-greedy-fails/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/exam-scheduling/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/flow-decomposition/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/ford-fulkerson/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/introduction/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/ipl-elimination/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/maxflow-mincut/https://neeldhara.courses/advalgo/notes/02-reductions-i-flows/tuple-selection/https://neeldhara.courses/advalgo/notes/03-reductions-ii-hardness/3d-matching/https://neeldhara.courses/advalgo/notes/03-reductions-ii-hardness/finding-the-right-problem/https://neeldhara.courses/advalgo/notes/03-reductions-ii-hardness/graph-coloring/https://neeldhara.courses/advalgo/notes/03-reductions-ii-hardness/max-independent-set/https://neeldhara.courses/advalgo/notes/03-reductions-ii-hardness/p-np-np-hardness/https://neeldhara.courses/advalgo/notes/03-reductions-ii-hardness/subset-sum/https://neeldhara.courses/advalgo/notes/04-interlude/co-np/https://neeldhara.courses/advalgo/notes/04-interlude/pspace-reductions-i/https://neeldhara.courses/advalgo/notes/04-interlude/pspace-reductions-ii/https://neeldhara.courses/advalgo/notes/04-interlude/pspace-reductions-iii/https://neeldhara.courses/advalgo/notes/04-interlude/pspace/https://neeldhara.courses/advalgo/notes/05-randomized-algorithms/kargers-mincut-algorithm/https://neeldhara.courses/advalgo/notes/05-randomized-algorithms/minimum-spanning-tree/https://neeldhara.courses/advalgo/notes/05-randomized-algorithms/probability-basics/https://neeldhara.courses/advalgo/notes/05-randomized-algorithms/randomized-qs-i/https://neeldhara.courses/advalgo/notes/05-randomized-algorithms/randomized-qs-ii/https://neeldhara.courses/advalgo/notes/06-approximation-algorithms/bin-packing/https://neeldhara.courses/advalgo/notes/06-approximation-algorithms/greedy-set-cover/https://neeldhara.courses/advalgo/notes/06-approximation-algorithms/primal-dual/https://neeldhara.courses/advalgo/notes/06-approximation-algorithms/vertex-cover-via-matchings/https://neeldhara.courses/advalgo/notes/06-approximation-algorithms/vertex-cover-with-lp-i/https://neeldhara.courses/advalgo/notes/06-approximation-algorithms/vertex-cover-with-lp-ii/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/dp-for-mis/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/introduction/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/iterative-compression-i/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/iterative-compression-ii/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/mis-on-thin-grids/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/nice-tree-decompositions/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/pathwidth/https://neeldhara.courses/advalgo/notes/07-parameterized-algorithms/treewidth/https://neeldhara.courses/advalgo/notes/08-exact-algorithms/branch-and-bound/https://neeldhara.courses/advalgo/notes/08-exact-algorithms/dynamic-programming-i/https://neeldhara.courses/advalgo/notes/08-exact-algorithms/dynamic-programming-ii/https://neeldhara.courses/advalgo/notes/08-exact-algorithms/pie-for-chromatic-number-i/https://neeldhara.courses/advalgo/notes/08-exact-algorithms/pie-for-chromatic-number-ii/https://neeldhara.courses/advalgo/notes/09-parameterized-approximation/k-path-transversal-i/https://neeldhara.courses/advalgo/notes/09-parameterized-approximation/k-path-transversal-ii/https://neeldhara.courses/advalgo/notes/09-parameterized-approximation/min-k-cut-i/https://neeldhara.courses/advalgo/notes/09-parameterized-approximation/min-k-cut-ii/https://neeldhara.courses/advalgo/notes/09-parameterized-approximation/min-k-cut-iii/https://neeldhara.courses/advalgo/notes/09-parameterized-approximation/partial-vertex-cover/https://neeldhara.courses/advalgo/notes/10-randomized-techniques-for-parameterized-algorithms/chromatic-coding-i/https://neeldhara.courses/advalgo/notes/10-randomized-techniques-for-parameterized-algorithms/chromatic-coding-ii/https://neeldhara.courses/advalgo/notes/10-randomized-techniques-for-parameterized-algorithms/color-coding-i/https://neeldhara.courses/advalgo/notes/10-randomized-techniques-for-parameterized-algorithms/color-coding-ii/https://neeldhara.courses/advalgo/notes/10-randomized-techniques-for-parameterized-algorithms/derandomization/https://neeldhara.courses/advalgo/notes/11-randomized-approximation/facility-location-i/https://neeldhara.courses/advalgo/notes/11-randomized-approximation/facility-location-ii/https://neeldhara.courses/advalgo/notes/11-randomized-approximation/multiway-cut-i/https://neeldhara.courses/advalgo/notes/11-randomized-approximation/multiway-cut-ii/https://neeldhara.courses/advalgo/notes/11-randomized-approximation/set-cover/https://neeldhara.courses/advalgo/notes/12-hardness/hardness-of-approximation/https://neeldhara.courses/advalgo/notes/12-hardness/para-np-hardness/https://neeldhara.courses/advalgo/notes/12-hardness/pcp-theorem-i/https://neeldhara.courses/advalgo/notes/12-hardness/pcp-theorem-ii/https://neeldhara.courses/advalgo/notes/12-hardness/ugc/https://neeldhara.courses/advalgo/notes/12-hardness/w-hardness/https://neeldhara.courses/advalgo/notes/introduction/https://neeldhara.courses/combinatorics/https://neeldhara.courses/combinatorics/assessments/https://neeldhara.courses/combinatorics/assessments/assignments/https://neeldhara.courses/combinatorics/editions/https://neeldhara.courses/combinatorics/editions/current/https://neeldhara.courses/combinatorics/notes/https://neeldhara.courses/combinatorics/notes/introduction/https://neeldhara.courses/comsoc/https://neeldhara.courses/comsoc/assessments/https://neeldhara.courses/comsoc/assessments/assignments/https://neeldhara.courses/comsoc/editions/https://neeldhara.courses/comsoc/editions/current/https://neeldhara.courses/comsoc/notes/https://neeldhara.courses/comsoc/notes/introduction/https://neeldhara.courses/courses/https://neeldhara.courses/cp/https://neeldhara.courses/cp/assessments/https://neeldhara.courses/cp/assessments/assignments/https://neeldhara.courses/cp/editions/https://neeldhara.courses/cp/editions/current/https://neeldhara.courses/cp/notes/https://neeldhara.courses/cp/notes/introduction/https://neeldhara.courses/dm/https://neeldhara.courses/dm/assessments/https://neeldhara.courses/dm/assessments/assignments/https://neeldhara.courses/dm/editions/https://neeldhara.courses/dm/editions/current/https://neeldhara.courses/dm/notes/https://neeldhara.courses/dm/notes/introduction/https://neeldhara.courses/dm/notes/modules/foobar/https://neeldhara.courses/docs/https://neeldhara.courses/docs/components/https://neeldhara.courses/docs/components/aside/https://neeldhara.courses/docs/components/badge/https://neeldhara.courses/docs/components/button/https://neeldhara.courses/docs/components/steps/https://neeldhara.courses/docs/components/tabs/https://neeldhara.courses/docs/getting-started/https://neeldhara.courses/docs/getting-started/configuration/https://neeldhara.courses/docs/getting-started/integrating/https://neeldhara.courses/docs/reference/elements/https://neeldhara.courses/docs/reference/frontmatter-reference/https://neeldhara.courses/docs/reference/nav-config/https://neeldhara.courses/docs/reference/sidebar-navigation/https://neeldhara.courses/docs/reference/site-settings/https://neeldhara.courses/dsa/https://neeldhara.courses/dsa/assessments/https://neeldhara.courses/dsa/assessments/assignments/https://neeldhara.courses/dsa/editions/https://neeldhara.courses/dsa/editions/current/https://neeldhara.courses/dsa/notes/https://neeldhara.courses/dsa/notes/introduction/https://neeldhara.courses/fpt/https://neeldhara.courses/fpt/assessments/https://neeldhara.courses/fpt/assessments/assignments/https://neeldhara.courses/fpt/editions/https://neeldhara.courses/fpt/editions/current/https://neeldhara.courses/fpt/notes/https://neeldhara.courses/fpt/notes/introduction/https://neeldhara.courses/fr/https://neeldhara.courses/fr/docs/https://neeldhara.courses/fr/docs/authentication/overview/https://neeldhara.courses/fr/docs/endpoints/rest-api/https://neeldhara.courses/fr/docs/tips-and-tricks/advanced-techniques/https://neeldhara.courses/fun/https://neeldhara.courses/fun/assessments/https://neeldhara.courses/fun/assessments/assignments/https://neeldhara.courses/fun/editions/https://neeldhara.courses/fun/editions/current/https://neeldhara.courses/fun/notes/https://neeldhara.courses/fun/notes/01-binary-numbers/https://neeldhara.courses/fun/notes/02-beyond-binary/https://neeldhara.courses/fun/notes/03-intro-to-search/https://neeldhara.courses/fun/notes/04-error-detection/https://neeldhara.courses/fun/notes/05-sorting-basics/https://neeldhara.courses/fun/notes/06-sorting-revisited/https://neeldhara.courses/fun/notes/07-ranking-algorithms/https://neeldhara.courses/fun/notes/08-arrows-theorem/https://neeldhara.courses/linalg/https://neeldhara.courses/linalg/assessments/https://neeldhara.courses/linalg/assessments/assignments/https://neeldhara.courses/linalg/editions/https://neeldhara.courses/linalg/editions/current/https://neeldhara.courses/linalg/notes/https://neeldhara.courses/linalg/notes/introduction/https://neeldhara.courses/magic/https://neeldhara.courses/magic/assessments/https://neeldhara.courses/magic/assessments/assignments/https://neeldhara.courses/magic/editions/https://neeldhara.courses/magic/editions/current/https://neeldhara.courses/magic/notes/https://neeldhara.courses/magic/notes/introduction/https://neeldhara.courses/mas/https://neeldhara.courses/mas/assessments/https://neeldhara.courses/mas/assessments/games/https://neeldhara.courses/mas/assessments/games/minmax-tree/https://neeldhara.courses/mas/assessments/games/nim-wins/https://neeldhara.courses/mas/editions/https://neeldhara.courses/mas/editions/current/https://neeldhara.courses/mas/editions/current/grading/https://neeldhara.courses/mas/notes/https://neeldhara.courses/mas/notes/games/https://neeldhara.courses/mas/notes/games/game-trees/https://neeldhara.courses/mas/notes/games/minimax/https://neeldhara.courses/mas/notes/games/pruning/https://neeldhara.courses/mas/notes/games/strategies/https://neeldhara.courses/mas/notes/index/https://neeldhara.courses/mas/notes/resources/references/https://neeldhara.courses/mfai/https://neeldhara.courses/mfai/assessments/https://neeldhara.courses/mfai/assessments/assignments/https://neeldhara.courses/mfai/editions/https://neeldhara.courses/mfai/editions/current/https://neeldhara.courses/mfai/notes/https://neeldhara.courses/mfai/notes/introduction/https://neeldhara.courses/mfai/notes/introduction/math-test/https://neeldhara.courses/mfai/notes/introduction/sidenotes-demo/https://neeldhara.courses/mfai/notes/introduction/test/https://neeldhara.courses/misc/https://neeldhara.courses/misc/other/https://neeldhara.courses/misc/other/introduction/https://neeldhara.courses/misc/short-courses/https://neeldhara.courses/misc/short-courses/introduction/https://neeldhara.courses/misc/workshops/https://neeldhara.courses/misc/workshops/introduction/