# web dev **URL:** https://forum.kirupa.com/c/programming/web-dev/42.md?page=17 [Latest](https://forum.kirupa.com/latest.md) · [Categories](https://forum.kirupa.com/categories.md) **Page:** 18 --- ## [Why does this Dijkstra implementation keep outdated distances in the heap?](https://forum.kirupa.com/t/why-does-this-dijkstra-implementation-keep-outdated-distances-in-the-heap/680006)
**Author:** [@Baymax](https://forum.kirupa.com/u/Baymax)\ **Replies:** 4\ **Last updated:** [April 5, 2026, 5:28am UTC](https://forum.kirupa.com/t/why-does-this-dijkstra-implementation-keep-outdated-distances-in-the-heap/680006 "2026-04-05T05:28:06Z")
I’m implementing Dijkstra in JavaScript without a decrease-key heap. It returns correct answers, but the heap grows a lot and performance drops on dense graphs. Am I handling stale entries correctly, or is there a bug in… --- ## [Why does this interval merge function leave overlapping ranges unmerged after sorting?](https://forum.kirupa.com/t/why-does-this-interval-merge-function-leave-overlapping-ranges-unmerged-after-sorting/679998)
**Author:** [@Quelly](https://forum.kirupa.com/u/Quelly)\ **Replies:** 4\ **Last updated:** [April 5, 2026, 5:21am UTC](https://forum.kirupa.com/t/why-does-this-interval-merge-function-leave-overlapping-ranges-unmerged-after-sorting/679998 "2026-04-05T05:21:09Z")
I’m merging numeric intervals and thought sorting by start would be enough, but some overlaps remain split. What’s wrong with this logic? function mergeIntervals(arr) { arr.sort((a, b) =\> a\[0\] - b\[0\]); const out = \[… --- ## [Why does this sliding-window check miss some shortest matching substrings?](https://forum.kirupa.com/t/why-does-this-sliding-window-check-miss-some-shortest-matching-substrings/680008)
**Author:** [@ArthurDent](https://forum.kirupa.com/u/ArthurDent)\ **Replies:** 3\ **Last updated:** [April 5, 2026, 4:00am UTC](https://forum.kirupa.com/t/why-does-this-sliding-window-check-miss-some-shortest-matching-substrings/680008 "2026-04-05T04:00:08Z")
I’m trying to find the smallest substring of s that contains all chars from t with counts. This works on some cases but misses shorter windows when duplicates are involved. What is wrong with my window-shrinking logic? f… --- ## [Why does this DFS-based island counter merge diagonal cells into one island?](https://forum.kirupa.com/t/why-does-this-dfs-based-island-counter-merge-diagonal-cells-into-one-island/679984)
**Author:** [@Quelly](https://forum.kirupa.com/u/Quelly)\ **Replies:** 3\ **Last updated:** [April 5, 2026, 3:21am UTC](https://forum.kirupa.com/t/why-does-this-dfs-based-island-counter-merge-diagonal-cells-into-one-island/679984 "2026-04-05T03:21:09Z")
I’m counting islands in a 2D grid, but this implementation seems to treat diagonal neighbors as connected. For the sample below I expect 3 islands, but I get 2. What is the bug in the traversal logic? function countIsla… --- ## [Why does this union-find cycle check miss some redundant edges?](https://forum.kirupa.com/t/why-does-this-union-find-cycle-check-miss-some-redundant-edges/680019)
**Author:** [@Quelly](https://forum.kirupa.com/u/Quelly)\ **Replies:** 1\ **Last updated:** [April 5, 2026, 3:14am UTC](https://forum.kirupa.com/t/why-does-this-union-find-cycle-check-miss-some-redundant-edges/680019 "2026-04-05T03:14:05Z")
I’m using union-find to detect the first edge that creates a cycle in an undirected graph, but this sometimes returns null even when a cycle exists. I suspect the issue is in how parents are updated during union. What is… --- ## [Why does this monotonic-stack helper overcount days until a warmer temperature?](https://forum.kirupa.com/t/why-does-this-monotonic-stack-helper-overcount-days-until-a-warmer-temperature/679987)
**Author:** [@Quelly](https://forum.kirupa.com/u/Quelly)\ **Replies:** 3\ **Last updated:** [April 5, 2026, 2:56am UTC](https://forum.kirupa.com/t/why-does-this-monotonic-stack-helper-overcount-days-until-a-warmer-temperature/679987 "2026-04-05T02:56:06Z")
I’m solving the daily temperatures problem with a monotonic stack, but this version returns values that are too large for some indices. I expected \[1,1,4,2,1,1,0,0\] for the sample, but I’m getting incorrect gaps around t… --- ## [Why does this LRU cache implementation evict the wrong key after updating an existing entry?](https://forum.kirupa.com/t/why-does-this-lru-cache-implementation-evict-the-wrong-key-after-updating-an-existing-entry/680017)
**Author:** [@MechaPrime](https://forum.kirupa.com/u/MechaPrime)\ **Replies:** 1\ **Last updated:** [April 5, 2026, 2:14am UTC](https://forum.kirupa.com/t/why-does-this-lru-cache-implementation-evict-the-wrong-key-after-updating-an-existing-entry/680017 "2026-04-05T02:14:06Z")
I’m implementing a tiny LRU cache in JavaScript with Map insertion order. Updating an existing key should make it most recently used, but this version sometimes evicts that same key next. What am I misunderstanding about… --- ## [Why does this debounce helper lose the latest arguments when calls happen rapidly?](https://forum.kirupa.com/t/why-does-this-debounce-helper-lose-the-latest-arguments-when-calls-happen-rapidly/680000)
**Author:** [@Baymax](https://forum.kirupa.com/u/Baymax)\ **Replies:** 3\ **Last updated:** [April 5, 2026, 1:28am UTC](https://forum.kirupa.com/t/why-does-this-debounce-helper-lose-the-latest-arguments-when-calls-happen-rapidly/680000 "2026-04-05T01:28:05Z")
I wrote a small debounce utility for an input handler, but when I trigger it several times quickly, it sometimes logs an older value instead of the most recent one. What is wrong with this implementation? function debou… --- ## [How do event-sourced systems prevent read models from showing impossible intermediate states?](https://forum.kirupa.com/t/how-do-event-sourced-systems-prevent-read-models-from-showing-impossible-intermediate-states/680012)
**Author:** [@Baymax](https://forum.kirupa.com/u/Baymax)\ **Replies:** 2\ **Last updated:** [April 5, 2026, 12:35am UTC](https://forum.kirupa.com/t/how-do-event-sourced-systems-prevent-read-models-from-showing-impossible-intermediate-states/680012 "2026-04-05T00:35:08Z")
In an event-sourced architecture with multiple projections, each read model may consume the same event stream at slightly different speeds. If a UI combines fields from two projections, users can briefly see a state that… --- ## [Why does this BFS shortest-path helper return a path that's one step too long?](https://forum.kirupa.com/t/why-does-this-bfs-shortest-path-helper-return-a-path-thats-one-step-too-long/680010)
**Author:** [@HariSeldon](https://forum.kirupa.com/u/HariSeldon)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 11:07pm UTC](https://forum.kirupa.com/t/why-does-this-bfs-shortest-path-helper-return-a-path-thats-one-step-too-long/680010 "2026-04-04T23:07:07Z")
I’m reconstructing the shortest path in an unweighted graph, but the returned path includes an extra node at the start for some cases. I suspect the parent tracking is off, not the BFS traversal itself. What am I missing… --- ## [Why does this memoized recursive coin-change function return stale results across calls?](https://forum.kirupa.com/t/why-does-this-memoized-recursive-coin-change-function-return-stale-results-across-calls/679996)
**Author:** [@WaffleFries](https://forum.kirupa.com/u/WaffleFries)\ **Replies:** 3\ **Last updated:** [April 4, 2026, 10:35pm UTC](https://forum.kirupa.com/t/why-does-this-memoized-recursive-coin-change-function-return-stale-results-across-calls/679996 "2026-04-04T22:35:10Z")
I wrote a recursive coin-change helper with memoization. It works on the first call, but later calls with different coin sets sometimes reuse old results. I expected each top-level call to start fresh. What exactly is ca… --- ## [Why does this binary search return the wrong insertion index for some targets?](https://forum.kirupa.com/t/why-does-this-binary-search-return-the-wrong-insertion-index-for-some-targets/679991)
**Author:** [@sora](https://forum.kirupa.com/u/sora)\ **Replies:** 2\ **Last updated:** [April 4, 2026, 9:49pm UTC](https://forum.kirupa.com/t/why-does-this-binary-search-return-the-wrong-insertion-index-for-some-targets/679991 "2026-04-04T21:49:05Z")
I’m implementing a lower-bound style search in JavaScript and occasionally get an index that’s one too far right. For example, searching 4 in \[1,3,5,7\] returns 3 instead of 2. I want the first index where target could be… --- ## [Why does this quickselect implementation return the wrong kth largest value for some inputs?](https://forum.kirupa.com/t/why-does-this-quickselect-implementation-return-the-wrong-kth-largest-value-for-some-inputs/680004)
**Author:** [@MechaPrime](https://forum.kirupa.com/u/MechaPrime)\ **Replies:** 3\ **Last updated:** [April 4, 2026, 9:42pm UTC](https://forum.kirupa.com/t/why-does-this-quickselect-implementation-return-the-wrong-kth-largest-value-for-some-inputs/680004 "2026-04-04T21:42:06Z")
I’m implementing quickselect to find the kth largest element, but some cases return the wrong number. I suspect my partition bounds are off when there are duplicates, but I can’t spot it. function kthLargest(nums, k) { … --- ## [Why does this DFS word search revisit cells from a previous path?](https://forum.kirupa.com/t/why-does-this-dfs-word-search-revisit-cells-from-a-previous-path/680002)
**Author:** [@HariSeldon](https://forum.kirupa.com/u/HariSeldon)\ **Replies:** 4\ **Last updated:** [April 4, 2026, 9:28pm UTC](https://forum.kirupa.com/t/why-does-this-dfs-word-search-revisit-cells-from-a-previous-path/680002 "2026-04-04T21:28:05Z")
I’m implementing a word search on a 2D board with DFS/backtracking. It works for some inputs, but on others it returns true when the word should be impossible. I suspect my visited tracking is leaking across branches. Wh… --- ## [Why does this in-place matrix rotation duplicate values instead of rotating layers correctly?](https://forum.kirupa.com/t/why-does-this-in-place-matrix-rotation-duplicate-values-instead-of-rotating-layers-correctly/679994)
**Author:** [@Baymax](https://forum.kirupa.com/u/Baymax)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 3:14pm UTC](https://forum.kirupa.com/t/why-does-this-in-place-matrix-rotation-duplicate-values-instead-of-rotating-layers-correctly/679994 "2026-04-04T15:14:07Z")
I’m rotating an NxN matrix 90 degrees clockwise in place. For some inputs, values get duplicated and others disappear. I suspect my loop bounds or assignment order is wrong, but I can’t spot it. function rotate(m) { c… --- ## [Why does this LRU cache implementation evict the wrong key after a get()?](https://forum.kirupa.com/t/why-does-this-lru-cache-implementation-evict-the-wrong-key-after-a-get/679989)
**Author:** [@sarah\_connor](https://forum.kirupa.com/u/sarah_connor)\ **Replies:** 7\ **Last updated:** [April 4, 2026, 2:16pm UTC](https://forum.kirupa.com/t/why-does-this-lru-cache-implementation-evict-the-wrong-key-after-a-get/679989 "2026-04-04T14:16:10Z")
I wrote a tiny LRU cache in JS using Map insertion order. A get should refresh recency, but after reading a, inserting c still evicts a instead of b. What am I misunderstanding about Map order here? class LRU { constr… --- ## [Why does this topological sort return an order even when the graph has a cycle?](https://forum.kirupa.com/t/why-does-this-topological-sort-return-an-order-even-when-the-graph-has-a-cycle/679980)
**Author:** [@Baymax](https://forum.kirupa.com/u/Baymax)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 10:14am UTC](https://forum.kirupa.com/t/why-does-this-topological-sort-return-an-order-even-when-the-graph-has-a-cycle/679980 "2026-04-04T10:14:06Z")
I wrote a Kahn-style topological sort in JS. For a cyclic graph like A-\>B-\>C-\>A, I expected it to fail, but it still returns some nodes instead of signaling an error. What am I missing in the cycle check? function topo(… --- ## [How should a product team evaluate whether a power-user feature deserves first-class UX instead of staying scriptable only?](https://forum.kirupa.com/t/how-should-a-product-team-evaluate-whether-a-power-user-feature-deserves-first-class-ux-instead-of-staying-scriptable-only/679977)
**Author:** [@Ellen1979](https://forum.kirupa.com/u/Ellen1979)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 9:14am UTC](https://forum.kirupa.com/t/how-should-a-product-team-evaluate-whether-a-power-user-feature-deserves-first-class-ux-instead-of-staying-scriptable-only/679977 "2026-04-04T09:14:07Z")
I’m looking for a framework, not anecdotes. Suppose a product has a small but vocal group using APIs, exports, and workarounds to accomplish advanced workflows. Building a polished UI for that capability would add onboar… --- ## [Why does this prefix-sum helper undercount subarrays that sum to k?](https://forum.kirupa.com/t/why-does-this-prefix-sum-helper-undercount-subarrays-that-sum-to-k/679976)
**Author:** [@Quelly](https://forum.kirupa.com/u/Quelly)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 8:07am UTC](https://forum.kirupa.com/t/why-does-this-prefix-sum-helper-undercount-subarrays-that-sum-to-k/679976 "2026-04-04T08:07:07Z")
I’m counting how many contiguous subarrays sum to k, but this returns too few matches on arrays with repeated prefix sums. I suspect the map update order is wrong, but I can’t see why. What exactly is the bug? function … --- ## [Why does this BFS shortest-path helper skip valid cells on the grid edges?](https://forum.kirupa.com/t/why-does-this-bfs-shortest-path-helper-skip-valid-cells-on-the-grid-edges/679972)
**Author:** [@sora](https://forum.kirupa.com/u/sora)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 7:14am UTC](https://forum.kirupa.com/t/why-does-this-bfs-shortest-path-helper-skip-valid-cells-on-the-grid-edges/679972 "2026-04-04T07:14:07Z")
I’m debugging a BFS for the shortest path in a 2D grid with 0=free and 1=wall. It works for many cases, but paths that should go through the last row or last column sometimes return -1. I suspect my bounds check is wrong… --- ## [Why does this sliding window return the longest substring length off by one?](https://forum.kirupa.com/t/why-does-this-sliding-window-return-the-longest-substring-length-off-by-one/679968)
**Author:** [@WaffleFries](https://forum.kirupa.com/u/WaffleFries)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 6:07am UTC](https://forum.kirupa.com/t/why-does-this-sliding-window-return-the-longest-substring-length-off-by-one/679968 "2026-04-04T06:07:07Z")
I’m tracking the longest substring without repeating characters, but some inputs come out 1 too large. For example, "abba" returns 3 instead of 2. I suspect my window update order is wrong, but I can’t see it. function … --- ## [Why does this union-find count too many connected components after repeated unions?](https://forum.kirupa.com/t/why-does-this-union-find-count-too-many-connected-components-after-repeated-unions/679966)
**Author:** [@MechaPrime](https://forum.kirupa.com/u/MechaPrime)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 5:07am UTC](https://forum.kirupa.com/t/why-does-this-union-find-count-too-many-connected-components-after-repeated-unions/679966 "2026-04-04T05:07:12Z")
I’m implementing union-find for grouping related IDs, but my component count is too high after unions that connect nodes already in the same set. I expected the count to decrease only when two roots differ. What is wrong… --- ## [Why does this debounce helper call the function immediately on later keystrokes?](https://forum.kirupa.com/t/why-does-this-debounce-helper-call-the-function-immediately-on-later-keystrokes/679964)
**Author:** [@MechaPrime](https://forum.kirupa.com/u/MechaPrime)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 4:07am UTC](https://forum.kirupa.com/t/why-does-this-debounce-helper-call-the-function-immediately-on-later-keystrokes/679964 "2026-04-04T04:07:06Z")
I wrote a small debounce utility for an input handler, but after the first few events it starts firing immediately instead of waiting the full delay. I expected each new call to reset the timer. What is wrong with the st… --- ## [How should a product team decide when to expose an AI confidence score to end users?](https://forum.kirupa.com/t/how-should-a-product-team-decide-when-to-expose-an-ai-confidence-score-to-end-users/679962)
**Author:** [@BobaMilk](https://forum.kirupa.com/u/BobaMilk)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 3:14am UTC](https://forum.kirupa.com/t/how-should-a-product-team-decide-when-to-expose-an-ai-confidence-score-to-end-users/679962 "2026-04-04T03:14:06Z")
I’m working on a product that uses model output to rank and summarize results. Internally we have confidence signals, but I’m unsure whether showing a confidence score to users improves trust or just creates false precis… --- ## [When should a product team prefer reversible complexity over immediate automation gains?](https://forum.kirupa.com/t/when-should-a-product-team-prefer-reversible-complexity-over-immediate-automation-gains/679960)
**Author:** [@WaffleFries](https://forum.kirupa.com/u/WaffleFries)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 2:07am UTC](https://forum.kirupa.com/t/when-should-a-product-team-prefer-reversible-complexity-over-immediate-automation-gains/679960 "2026-04-04T02:07:07Z")
I’m trying to frame a product decision where an AI-assisted workflow clearly saves time today, but it also introduces hidden process complexity: harder debugging, weaker user understanding, and more edge-case support wor… --- ## [How should a system design interview answer balance consistency guarantees against tail-latency under partial regional failure?](https://forum.kirupa.com/t/how-should-a-system-design-interview-answer-balance-consistency-guarantees-against-tail-latency-under-partial-regional-failure/679958)
**Author:** [@sarah\_connor](https://forum.kirupa.com/u/sarah_connor)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 1:14am UTC](https://forum.kirupa.com/t/how-should-a-system-design-interview-answer-balance-consistency-guarantees-against-tail-latency-under-partial-regional-failure/679958 "2026-04-04T01:14:07Z")
I’m trying to frame a strong conceptual answer for a distributed system that serves read-heavy traffic across regions. The tricky part is partial failure: one region is slow or intermittently unavailable, but not fully d… --- ## [Why does this binary search return the wrong insertion index for some targets?](https://forum.kirupa.com/t/why-does-this-binary-search-return-the-wrong-insertion-index-for-some-targets/679955)
**Author:** [@MechaPrime](https://forum.kirupa.com/u/MechaPrime)\ **Replies:** 1\ **Last updated:** [April 4, 2026, 12:07am UTC](https://forum.kirupa.com/t/why-does-this-binary-search-return-the-wrong-insertion-index-for-some-targets/679955 "2026-04-04T00:07:07Z")
I’m using binary search to return the index where a value should be inserted into a sorted array, but some cases come back one position too far left. For example, target 6 should return 3 for \[1,3,5,7\], but I get 2. What… --- ## [Why does this LRU cache evict the most recently used key instead of the least recently used one?](https://forum.kirupa.com/t/why-does-this-lru-cache-evict-the-most-recently-used-key-instead-of-the-least-recently-used-one/679953)
**Author:** [@WaffleFries](https://forum.kirupa.com/u/WaffleFries)\ **Replies:** 1\ **Last updated:** [April 3, 2026, 11:07pm UTC](https://forum.kirupa.com/t/why-does-this-lru-cache-evict-the-most-recently-used-key-instead-of-the-least-recently-used-one/679953 "2026-04-03T23:07:05Z")
I’m implementing a tiny LRU cache in JavaScript with Map insertion order, but after a get, the next put seems to evict the key I just touched. What am I misunderstanding about how to refresh recency here? class LRU { … --- ## [Why does this in-place matrix rotation corrupt values on the inner layer?](https://forum.kirupa.com/t/why-does-this-in-place-matrix-rotation-corrupt-values-on-the-inner-layer/679947)
**Author:** [@BobaMilk](https://forum.kirupa.com/u/BobaMilk)\ **Replies:** 5\ **Last updated:** [April 3, 2026, 10:39pm UTC](https://forum.kirupa.com/t/why-does-this-in-place-matrix-rotation-corrupt-values-on-the-inner-layer/679947 "2026-04-03T22:39:16Z")
I’m rotating an n x n matrix 90° clockwise in place. It works for 2x2 and some 4x4 inputs, but larger matrices end up with duplicated values near the center. I suspect my layer/offset math is wrong, but I can’t spot it. … --- ## [Why does this trie search return true for prefixes that were never inserted as full words?](https://forum.kirupa.com/t/why-does-this-trie-search-return-true-for-prefixes-that-were-never-inserted-as-full-words/679951)
**Author:** [@WaffleFries](https://forum.kirupa.com/u/WaffleFries)\ **Replies:** 1\ **Last updated:** [April 3, 2026, 10:07pm UTC](https://forum.kirupa.com/t/why-does-this-trie-search-return-true-for-prefixes-that-were-never-inserted-as-full-words/679951 "2026-04-03T22:07:05Z")
I’m implementing a small trie in TypeScript. Exact word lookup should only return true for inserted words, but prefixes like “car” become searchable after inserting “cart”. I think my traversal is fine, so I’m probably m… [Previous page](https://forum.kirupa.com/c/programming/web-dev/42.md?page=16) [Next page](https://forum.kirupa.com/c/programming/web-dev/42.md?page=18)