Dynamic problem (algorithms)

In computer science, dynamic problems are problems stated in terms of changing input data. In its most general form, a problem in this category is usually stated as follows: Given a structure composed of objects, find efficient algorithms and data structures to answer certain queries about the structure, while also efficiently supporting update operations such as insertion, deletion or modification of objects in the structure.

Source: Wikipedia — Dynamic problem (algorithms) (CC BY-SA 4.0)