I gave three online assessment in a day, I applied for the position of data scientist,AI engineer,etc

1. Assessment 1

• There are infinite array of integers consecutivelty, you are given the array and 1 integer to avoid and a every iteration you can either stay at i or i +j where i is the index and j is step number, return the maximum index
• a string is beautiful if no two adjacent characters are either
  1 the same, for example 'aa'
  2 adjacent in the alphabet, for example 'ef'
  find the minimum number of operations required to make a string beautiful(requires DP)

2. Assessment 2

• 2nd question of the 1 first assessment minimum operation to make a string beautiful
• very easy SQL question on Aggregation

3. Assessment 3

• similar to leetcode SLINDING WINDOW MAXIMUM only difference being i have first find out the minimum and then the maximum of the minimun therefore single value will returned unlike the SLINDING WINDOW MAXIMUM question
• very easy SQL question on join

I am surprised that IBM is asking hard question as on my preparation for it people including leetcode discuss told me they ask easy question except one