Question 1

Longest Non-decreasing Subarray From Two Arrays — Citadel Interview Question

Accepted Answer

"Longest Non-decreasing Subarray From Two Arrays" is a medium difficulty problem asked at Citadel interviews. It covers the following topics: Array, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays

Question 2

Binary Tree Maximum Path Sum — Citadel Interview Question

Accepted Answer

"Binary Tree Maximum Path Sum" is a hard difficulty problem asked at Citadel interviews. It covers the following topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. You can practice it on LeetCode: https://leetcode.com/problems/binary-tree-maximum-path-sum

Question 3

Delete and Earn — Citadel Interview Question

Accepted Answer

"Delete and Earn" is a medium difficulty problem asked at Citadel interviews. It covers the following topics: Array, Hash Table, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/delete-and-earn

Question 4

Minimum Knight Moves — Citadel Interview Question

Accepted Answer

"Minimum Knight Moves" is a medium difficulty problem asked at Citadel interviews. It covers the following topics: Breadth-First Search. You can practice it on LeetCode: https://leetcode.com/problems/minimum-knight-moves

Question 5

Palindromic Substrings — Citadel Interview Question

Accepted Answer

"Palindromic Substrings" is a medium difficulty problem asked at Citadel interviews. It covers the following topics: Two Pointers, String, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/palindromic-substrings

Question 6

Sliding Window Maximum — Citadel Interview Question

Accepted Answer

"Sliding Window Maximum" is a hard difficulty problem asked at Citadel interviews. It covers the following topics: Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue. You can practice it on LeetCode: https://leetcode.com/problems/sliding-window-maximum

#	Question Title	Difficulty	Frequency	Topics
1	Longest Non-decreasing Subarray From Two Arrays	MEDIUM	100.0	ArrayDynamic Programming
2	Binary Tree Maximum Path Sum	HARD	98.7	Dynamic ProgrammingTreeDepth-First Search+1
3	Delete and Earn	MEDIUM	93.4	ArrayHash TableDynamic Programming
4	Minimum Knight Moves	MEDIUM	93.4	Breadth-First Search
5	Palindromic Substrings	MEDIUM	86.5	Two PointersStringDynamic Programming
6	Sliding Window Maximum	HARD	85.3	ArrayQueueSliding Window+2
7	Count Palindromic Subsequences	HARD	81.3	StringDynamic Programming
8	Minimum Equal Sum of Two Arrays After Replacing Zeros	MEDIUM	79.8	ArrayGreedy
9	LFU Cache	HARD	79.8	Hash TableLinked ListDesign+1
10	Minimum Operations to Make Numbers Non-positive	HARD	78.1	ArrayBinary Search

Explore 450+ Companies

Companies

Citadel

Want to see more?

Citadel Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Citadel

Want to see more?

Citadel Interview Questions

Ai Assistant Kas