Company: Cisco_AI_Intern__
Difficulty: medium
Student Arrangement body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2, h3, h4 { color: #111; } h1 { border-bottom: 2px solid #eee; padding-bottom: 10px; } h2 { border-bottom: 1px solid #eee; padding-bottom: 8px; } code { background-color: #f4f4f4; padding: 2px 6px; border-radius: 4px; font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; } pre { background-color: #f4f4f4; padding: 15px; border-radius: 5px; overflow-x: auto; } pre code { padding: 0; background-color: transparent; } ul, ol { padding-left: 20px; } li { margin-bottom: 10px; } Student Arrangement Problem Description Numbers must be assigned to classmates represented in an array. An arrangement is considered good if the absolute difference between any two adjacent students is at most 1