All Question are +1 and -0.25
20 — Aptitude Questions ( 30 minutes)
20 — Software C Language Specific Snippets ( 40 minutes )
1 Coding Question ( 5 points) ( 20 minutes)
C language Specific Question:
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
All Question are +1 and -0.25
20 — Aptitude Questions ( 30 minutes)
20 — Software C Language Specific Snippets ( 40 minutes )
1 Coding Question ( 5 points) ( 20 minutes)
C language Specific Question:
You are given an array of positive integers arr. For each element arr[i], perform the following steps:
Compute its digit root: Repeatedly sum the digits of the number until a single-digit result is obtained. This final single-digit number is called the digit root of arr[i].
For example:
456 → 4+5+6 = 15 → 1+5 = 6 → Digit root is 6
99 → 9+9 = 18 → 1+8 = 9 → Digit root is 9
Bucket assignment: Place the original number arr[i] into a bucket numbered according to its digit root. There are 9 buckets labeled 1 through 9.
Sort buckets: Within each bucket, maintain the numbers in the order they appeared in the input array.
Output: Return a array bucket from 1 to 9 and listing the numbers that belong in each, in the sorted order
A subarray is considered compromised if the bitwise OR of all elements in any subarray is present in the subarray itself. Find the number of compromised subarrays in a given array of positive integers.
A subarray is defined as any contiguous segment of the array.
Example arr = [2, 4, 7] Answer = 5
Please help with the processing idea?
More Questions: Given an alphabet of size m, find the number of passwords of length n such that no character appears k or more times consecutively.(hard)
Given a graph, perform DFS traversal and output all distinct valid outputs (such as all unique DFS traversal paths or orders depending on the specific constraint). (Medium)
| Название |
|---|


