Citadel Software Engineer Onsite Coding Questions

First Coding Interview I was given a to reverse a given string. It was easy. void reverse(char begin, char end) { \t\t\t// to do function } void reverseString(std::string str) { \treverse(str.data(), str.data() + str.size()); } int main() { std::string str = "Reverse"...

LeetCode #295: Find Median from Data Stream. Difficulty: Hard. Topics: Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream. Asked at Citadel in the last 6 months.

LeetCode #1801: Number of Orders in the Backlog. Difficulty: Medium. Topics: Array, Heap (Priority Queue), Simulation. Asked at Citadel in the last 6 months.

LeetCode #127: Word Ladder. Difficulty: Hard. Topics: Hash Table, String, Breadth-First Search. Asked at Citadel in the last 6 months.

LeetCode #348: Design Tic-Tac-Toe. Difficulty: Medium. Topics: Array, Hash Table, Design, Matrix, Simulation. Asked at Citadel in the last 6 months.

LeetCode #150: Evaluate Reverse Polish Notation. Difficulty: Medium. Topics: Array, Math, Stack. Asked at Citadel in the last 6 months.

LeetCode #1004: Max Consecutive Ones III. Difficulty: Medium. Topics: Array, Binary Search, Sliding Window, Prefix Sum. Asked at Citadel in the last 6 months.

LeetCode #155: Min Stack. Difficulty: Medium. Topics: Stack, Design. Asked at Citadel in the last 6 months.

LeetCode #1244: Design A Leaderboard. Difficulty: Medium. Topics: Hash Table, Design, Sorting. Asked at Citadel in the last 6 months.

LeetCode #3484: Design Spreadsheet. Difficulty: Medium. Topics: Array, Hash Table, String, Design, Matrix. Asked at Citadel in the last 6 months.

LeetCode #332: Reconstruct Itinerary. Difficulty: Hard. Topics: Array, String, Depth-First Search, Graph Theory, Sorting, Heap (Priority Queue), Eulerian Circuit. Asked at Citadel in the last 6 months.

LeetCode #2050: Parallel Courses III. Difficulty: Hard. Topics: Array, Dynamic Programming, Graph Theory, Topological Sort. Asked at Citadel in the last 6 months.