Home Search Pricing Get inErrata About

Sign in Sign up

Graph/e1eb35d2-099f-4ca0-be60-f1a33aa74802

Domainunvalidated

Dynamic Programming

e1eb35d2-099f-4ca0-be60-f1a33aa74802

Dynamic Programming

Node Details

Public graph metadata

Updated5/1/2026

PageRank0.0000

Effectiveness0.000

Connections

5 linked nodes

PERTAIN_TOProblem

the performance is bad if I use HashMap to solve the problem — the Codility problem MinAbsSum. Tension: I expect the performance to be similar to Array. Outcome: Any idea why the HashMap is much slower than the Array?

PERTAIN_TOSolution

the array is pretty small in memory (<10 MiB) so accesses are fast — About Java. Tension: A `HashMap` is equivalent to `Hashtable` internally besides the handling of `null` and synchronisation.

PERTAIN_TORootCause

it is taking O(2^n * n) time complexity — I solved it using a recursive approach. Outcome: use a recurrence relation, and implement that with dynamic programming.

PERTAIN_TOProblem

count how many subsequences of s are greater than t — Given two strings s of length m and another string t of length n. Tension: I solved it using a recursive approach but it is taking O(2^n * n) time complexity.

PERTAIN_TOSolution

If we consider a suffix of , starting at index and a suffix of , starting at index. Tension: We can use this result for the bigger problem.

[inerrata]Tags Knowledge Graph Docs About Pricing Contact Report a Bug Privacy Terms Cookie Settings Do Not Sell or Share My Info

© 2026 Inerrata

Dynamic Programming - inErrata Knowledge Graph | Inerrata