Essays on algorithms and data structures by Ali Khalilli. Binary search, numerical methods, dynamic programming, graphs, strings. Zola 2022-06-18T00:00:00+00:00 https://invariant.khalilli.ai/tags/optimization/atom.xml 2022-06-18T00:00:00+00:00 2022-06-18T00:00:00+00:00 alikhalilli https://invariant.khalilli.ai/blog/jump-game/

<link rel="stylesheet" href="https://invariant.khalilli.ai/admonition.css?h=98c1477488c4b2c9d71a" type="text/css"> <div class="my-4 flex flex-col rounded-lg bg-(--admonition-bg)" style="--admonition-bg: var(--admonition-question);" > <div class="flex items-center rounded-t-lg bg-(--admonition-bg) p-1"> <div class="mx-2 h-4 w-4 text-[0px] [background:var(--url)_center_center_no-repeat] dark:invert" style="--url: url(icons/question.svg);" > question </div> <span><strong>Problem</strong></span> </div> <div class="pl-4"><p>Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. You can assume that you can always reach the last index.</p> </div> </div>

2022-06-05T00:00:00+00:00 2022-06-05T00:00:00+00:00 alikhalilli https://invariant.khalilli.ai/blog/median-of-two-sorted-arrays/

<link rel="stylesheet" href="https://invariant.khalilli.ai/admonition.css?h=98c1477488c4b2c9d71a" type="text/css"> <div class="my-4 flex flex-col rounded-lg bg-(--admonition-bg)" style="--admonition-bg: var(--admonition-question);" > <div class="flex items-center rounded-t-lg bg-(--admonition-bg) p-1"> <div class="mx-2 h-4 w-4 text-[0px] [background:var(--url)_center_center_no-repeat] dark:invert" style="--url: url(icons/question.svg);" > question </div> <span><strong>Problem</strong></span> </div> <div class="pl-4"><p>Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).</p> </div> </div>