After the initial recruiter call, I was invited to a live coding challenge. I was asked to solve two easy/medium-level LeetCode problems. The interviewer gave me hints to solve the given problems.

Given a sorted integer array nums and a target integer target within the array, rotate the array target times and return the index of the target integer. If the target integer does not exist in the array, return -1.

Example: nums: [0,1,2,3,4,5,6,7,8] target integer: 6

rotated nums: [6,7,8,0,1,2,3,4,5] should return 0

Hint: Try to find the pivot element using binary search. In binary search, we calculate the pivot index like this: (lower bound + upper bound) / 2. This can be changed based on need.

You are given a matrix of characters and a word that is present in the matrix. The letters of the given word can be placed in neighboring cells, not on diagonals. So, a letter should be searched in 4 cells (left, right, up, down).

Try to find the given word in the given matrix.