Citadel

SWE Intern Interview Experience - Indianapolis, Indiana

September 1, 2025

Neutral ExperienceNo Offer

Process

Had two coding problems. Timing was not an issue, likely LeetCode medium to hard. The problems were very focused on getting an optimized solution, meaning that even a medium-level solution would fail at least a few test cases.

Questions

They asked me two dynamic programming questions, where a witty solution was needed to get the best answer.

Interview Statistics

The following metrics were computed from 1 interview experience for the Citadel SWE Intern role in Indianapolis, Indiana.

Success Rate

Pass Rate

Citadel's interview process for their SWE Intern roles in Indianapolis, Indiana is extremely selective, failing the vast majority of engineers.

Experience Rating

Positive0%

Neutral100%

Negative0%

Candidates reported having mixed feelings for Citadel's SWE Intern interview process in Indianapolis, Indiana.

Citadel Interview Questions

Longest Non-decreasing Subarray From Two Arrays

Medium

You're given two arrays. Construct the longest possible non-decreasing subarray by picking elements from either array at each index.

ArraysDynamic Programming

Minimum Knight Moves

Medium

Find the minimum number of moves a knight needs to reach a target position on an infinite chessboard, starting from (0, 0).

Graphs

Binary Tree Maximum Path Sum

Hard

Find the maximum sum of any path in a binary tree, where a path can start and end at any node. The path must contain at least one node.

TreesRecursion