Maximum subset sum with no adjacent elements

Algorithm for maximum subset sum with no adjacent elements problem

Vikash Kumar

3 minute read

Let’s understand this problem. A non-negative integer array is given as input. We need to find maximum sum which can be possible by adding non-adjacent element of the given array. In hindsight, this may look a bit complex problem to solve. But the final solution will be simple and elegant.

Pod termination takes long time

Pod delete takes long time

Vikash Kumar

1 minute read

Sometimes deletion of pod takes longer time. There could be multiple reasons for that. For me, it was ‘busybox’ pod. It used to take more than a minute to delete the pod. Below is the yaml.