The programming concept that focuses on the design of data structures that can change during execution is referred to as dynamic data structures. Unlike static data structures, which have fixed sizes and cannot be altered at runtime, dynamic data structures such as linked lists, trees, and hash tables can grow or shrink as needed. This flexibility allows for more efficient memory usage and facilitates complex data management, making dynamic data structures essential in algorithms and software development.