1. Word Search in Grid
Given an m x n grid of characters board and a string word, return true if word exists in the grid.
The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.
Example 1:
Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCCED" Output: true
Example 2:
Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "SEE" Output: true
Example 3:
Input: board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]], word = "ABCB" Output: false
Constraints:
- m == board.length
- n = board[i].length
- 1 <= m, n <= 6
- 1 <= word.length <= 15
- board and word consists of only lowercase and uppercase English letters.
Follow up: Could you use search pruning to make your solution faster with a larger board?
2. Maximum Even Substring Length
Find the length of the largest substring within a given string where all characters occur an even number of times. For example, in the string 'abbcca', the maximum even substring length is 6, and in 'abcca', it is 2.
3. Minimum Board Length to Cover Holes
Given two boards of equal length and a row of holes, determine the minimum length of the board required to cover all the holes.
4. Scaling Questions Discussion
After finding a bug in the code during the interview, the interviewer asked some scaling questions that did not require writing code. How would you address scaling issues in a software system during a conversational interview?
5. Debugging Under Pressure
In the technical interview, you were presented with a debugging problem that was challenging to find. Describe your strategy for debugging code, especially when under the pressure of an interview setting.