Graphs and Trees
Graph questions at CrowdStrike start from a list of edges. Build the adjacency lists before anything else. After that, the problem is about the order you visit nodes in. Ordering questions come up in senior screens. Before you write the traversal, say what happens on a cycle. Tooling at a security company has to stop with an error on bad input, and the cleanest algorithms here have that check built in.
Trees show up on the intern online test. They can come as a parent array, where entry i names the parent of node i. Turn that into child lists and work up from the leaves. Watch the depth, because a long chain can go past Python's recursion limit, so an iterative order is the safer default. Three problems follow, one from a senior screen and two from online tests.
CrowdStrikePremium lesson · Coding round
The 3 CrowdStrike problems are below.
- A Premium questionCoding · Medium
- A Premium questionCoding · Medium
- A Premium questionCoding · Medium
Each with hints, the follow-up and a tested solution.
Get the CrowdStrike questions$49 a year · all 100 companies · cancel anytime
From 20,000+ candidate reports, forum threads behind logins and write-ups in Chinese.
CrowdStrike interview guideKnow what CrowdStrike asks before you walk in.
29 coding · 2 system design · 15 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.