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

<p>There are multiple different ways of implementation for this problem, like DP(lcs, etc), expanding from center. But the most optimal approach is Manacher’s Algorithm, time complexity: O(n). It’s core idea is calculating current palindrome information based on previous calculated palindrome information. Let’s draw it and see some formulas and implications.</p>

2022-06-09T00:00:00+00:00 2022-06-09T00:00:00+00:00 alikhalilli https://invariant.khalilli.ai/blog/zigzag-conversion/

<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>Print the string “SALAM” in a zigzag pattern on a given number of rows.</p> </div> </div>