高频题（0）
1. Sequential String
Given a special string 's' of length 'n' consisting of characters 0-9 only, and an array 'arr' of 'm' strings also consisting of characters 0-9, calculate the minimum number of characters needed from 's' to construct a permutation of each of the strings in 'arr'. Return an array of integers where the ith element denotes the minimum length of a substring that contains a permutation of the string in 'arr'. If a string cannot be constructed, return -1 at that index.
2. House Price Prediction
The task involves data processing and applying regression for house price prediction. The details of the regression requirements are not specified.
3. Submit Predictions on Test Dataset
Submit the predictions on the test dataset using your optimized model. For each record in the test set (test.csv), you must predict whether a customer will cancel his booking or not. You should submit a CSV file with a header row and one row per test entry. The file (submissions.csv) should have exactly 2 columns: id and is_canceled.
4. Build a Classification Model
Build a classification model to determine whether a customer will cancel a booking. Please explain the findings effectively to technical and non-technical audiences using comments and visualizations, if appropriate. Additionally, build an optimized model that effectively solves the business problem. The model's performance will be evaluated on the basis of accuracy. Read the test.csv file and prepare features for testing. Describe the most important features of the model to management and visualize the top 10 features and their feature importance.
5. Maximize Worker Output with Adjacency Constraints
Given three integer arrays of equal length named no_adjacent, one_adjacent, and both_adjacent, representing the output of a worker when there are no adjacent workers, one adjacent worker, or workers on both sides, respectively. The workers at the ends of the line can only have outputs from no_adjacent or one_adjacent. The task is to determine the sequence of assigning work to maximize total output. For example, with no_adjacent = [4, 2, 3, 3], one_adjacent = [2, 4, 1, 1], and both_adjacent = [0, 1, 4, 2], one optimal assignment sequence is 0->1->3->2, resulting in a total output of 15.
