Just finished it after staying up late SIG 2026 OA, let’s briefly review the overall experience for the first time. The overall difficulty is about the same as in previous years, and it has not become significantly easier, but people are still stuck in the places where they should be stuck. Susquehanna OA is one of those types where it seems like you’ve seen all the questions before, but when you actually do it, it’s easy to get carried away by the rhythm.
To put it bluntly, this set of questions is really not suitable for naked exams. If you haven’t touched on many points before, such as monotonic stacks or probability expectations, it’s basically too late to think about them on the spot. If you have made specific preparations in advance, your experience will be completely different.
Let’s sort out the process and question types to provide a reference for students preparing for SIG.
Coding（CodeSignal）
- Time: 70 minutes
- Number of questions: 4 questions
- Difficulty: The first two questions are relatively easy, and the last two questions are obviously more difficult.
The overall feeling is:
The first two questions are basically a warm-up and can be completed quickly, but starting from the third question, you need to think about your ideas seriously. The fourth question is the type where it is easy to get stuck if you don't practice it well.
Total website visits
Question: Given an array of non-negative integers Visits, represents the number of website visitors for consecutive days (Visits[0] Is the number of visits on the first day,Visits[1] Is the next day, and so on).
Your task is to return the first one whose cumulative visits reach or exceed the given Target Date index of I, that is, it satisfies Visits[0] + visits[1] + ... + visits[i] >= target.
If the total number of visits for all days is still not reached Target, then return -1.
Note: There is no need to provide an optimal solution. A solution whose time complexity is no worse than O (visits.length²) can be passed within the time limit.
Example:
- Enter:
Visits = [300, 200, 100, 200, 500],Target=700 - Output:
3 - Explanation: The total accumulated to day 4 (index 3) is
300+200+100+200=800 ≥ 700.
Problem-solving ideas
1. Initialize the cumulative number of visits to 0, traverse the number of visits array, and record the index at the same time
2. Each time the number of visits for the day is accumulated, if the accumulated amount ≥ the target value, the current index will be returned; if the target is not reached after the traversal, -1 will be returned.
Drone delivery system
Question: You are designing a drone-based linear warehouse distribution system. The warehouse can be regarded as a line from position 0 to position Target(Target > 0), there are several charging stations distributed along the line, consisting of an array Stations Express(Stations[i] Is the location of the i-th charging station).
Each drone can fly up to 10 units of distance when fully charged. For example: a fully charged drone at position 12 can reach any point between positions 12 and 22 (inclusive), but cannot reach positions 23 and beyond.
The delivery agreement requirements are as follows:
- Depart from the current location and transport the goods on foot to the nearest charging station ahead. If there is no charging station ahead, deliver the goods to the target location on foot
Target - Deploy a fully charged drone from this charging station to carry goods as far as possible for delivery
Problem-solving ideas
1. First sort the charging stations, initialize the current position to 0, point the pointer to the starting position of the charging station, and accumulate the cargo carrying distance.
2. Find the nearest charging station in front of the current position. After carrying the goods to the station, the drone will fly up to 10 squares (or to the target). The person will arrive at the landing point empty-handed, update the current position and repeat the process until the target is reached.
Distribution center package handling
Question: You are managing a network of distribution centers, each with varying package handling capacity before needing to be reset.
Given an array of integers CenterCapacities,in CenterCapacities[i] Is the maximum number of packages that the i-th distribution center can handle before maintenance (value range is 1 to some upper limit).
Also given an array of strings DailyLog,in DailyLog[i] Be one of the following two types:
"PACKAGE": A new package arrives to be processed"CLOSURE ": The jth distribution center is temporarily closed for renovation
Parcels are allocated to available centers in order: each center handles as many parcels as possible first (without exceeding its capacity CenterCapacities[i]) before the package is assigned to the next available center. No new parcels will be accepted after the center is closed, and processing can continue after all centers are restored.
Problem-solving ideas
1. Treat the distribution center as a circular queue, with the pointer pointing to the current priority center. When processing packages, start from the pointer to find a center that is open and has capacity. If not found, loop back and reset the capacity of the operating center.
2. After delivering the package, update the processing number and remaining capacity of the center, adjust the pointer; mark the center when encountering a shutdown instruction, and finally return to the center that handles the most packages (select the large index in parallel)
Password fragment splicing
Question: A spy agency intercepts a fragment of a password, each fragment is stored in an array as a positive integer Fragments Middle. Intelligence suggests the full access code is a specific number AccessCode.
Your task is to count how many different ways there are to piece the pieces together into a complete password. The cryptography rules are as follows:
- When splicing fragments, they are spliced directly in order (instead of mathematical addition)
- Pairs of fragments at different positions in the array are treated as independent combinations
- Clips can be assembled in any order, but each clip position can only be used once in a set of combinations.
Example:
- Fragment
"12"Followed by fragments"34", the splicing result is"1234" - Enter:
Fragments = [1, 212, 12, 12], it is necessary to calculate the number of combinations that can be spliced into the target password
Problem-solving ideas
1. Convert fragments and object codes into strings, and use a dictionary to count the number of occurrences of each fragment string
2. Traverse each fragment string. If it is the prefix of the target code, take the remaining part as the suffix. If the suffix is in the dictionary, calculate the number of combinations based on whether the prefix and suffix are the same, and accumulate the total number.
Susquehanna OA has just been released or the deadline is tight?
If you have just finished Susquehanna 2026 OA and have encountered a lot of pitfalls, or you are short on time for the Probability Brain Teasers questions, you can try our Interview assistance service .
We have tutors with North American/domestic quant background who are familiar with SIG Quantitative Evaluation. They can give you real-time tips and help avoid common pitfalls, or the coding/probability part can be directly solved by the optimal solution, and we can also provide a full-process solution.
Has the SIG OA just been issued or is the deadline coming soon? Send a private message at any time and discuss your specific question type and time in advance. We can give you a more accurate plan to help you pass this test smoothly.
