IBM interview question

the mcq question were based on linux cmd, like ps aux, distributed ststem ,linux base , and bit python . the three dsa question were 1. a string was given calculate the freq of each char in string and then the first prime freq print it 2.a string was given perform minimum operation like deletion on it and make the string pallindrome 3.8: "Maximize the Minimum Powered City". It uses a 2D matrix (or 1D array, depending on the version) representing energy/power stations arranged in a line or grid. The goal is to place additional power stations to maximize the minimum power among all cities, where each city's power is the sum of powers from neighboring cells within a radius 𝑘.something similar to this