Score Points
Asked at Google · Coding & Leetcode-style Questions · Difficulty: Easy
There is a board with **N** cells (numbered from `0` to `N-1`) arranged in a row. The board is described by an array `points` and a string `tokens`, both of length `N`. The **K**-th cell of the string `tokens` is either `'T'` or `'E'`, indicating whether the **K**-th cell contains a token or is empty.
Loading the problem…
More Google interview questions
- LLM conceptual questions
- Implement a Nested Tic-Tac-Toe Game Engine
- ML Fundamentals Deep Dive (AI/ML & MLE Roles)
- ML System Design: Recsys, Chatbot, Image Classifier
- ML Coding: Implement a Simple Attention / Layer Forward Pass
- Longest-Match Greedy Tokenization with Dictionary ID Replacement