CrowdStrike OA Problems | OA Coding Questions and Solutions | Set - 1| 2026

Question

Crowdstrike Internship Role

1. Swap one part of a linked list with the other linked list

2. Given a good substring, arrange it's inner good substrings such that the resulting string has maximum numerical value. Good substring has equal number of 0s and 1s, and in each prefix 1s should be greater or equal to 0s (I identified it as leetcode 761)

3. Find how many swaps the function will make, at each step find the lexicographically smallest i, j such that i < j and a[i] > a[j] and swap them (I think it is Inversion Count using Merge Sort)