Problem database last updated: June 20, 2025
5 problems · 1 Easy, 4 Medium, 0 Hard · Ranked #240 of 458
1 Easy
20% · avg 23%
4 Medium
80% · avg 59%
0 Hard
0% · avg 18%
Based on 5 reported problems, FactSet interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (80%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, FactSet puts unusual emphasis on monotonic-stack (40% of problems, 13.8x the industry average), greedy (60% of problems, 7.1x the industry average), stack (60% of problems, 6.9x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are string (60%), stack (60%), greedy (60%), monotonic-stack (40%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Remove All Adjacent Duplicates in String II You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left an... | Medium | Very Likely | stringstack | Solve |
Smallest Subsequence of Distinct Characters Given a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once. | Medium | Very Likely | stringstackgreedy | Solve |
Remove Duplicate Letters Given a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical or... | Medium | Very Likely | stringstackgreedy | Solve |
Happy Number Write an algorithm to determine if a number n is happy. | Easy | Likely | hash-tablemathtwo-pointers | Solve |
Increasing Triplet Subsequence Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices e... | Medium | Likely | arraygreedy | Solve |
Remove All Adjacent Duplicates in String II
SolveYou are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left an...
Smallest Subsequence of Distinct Characters
SolveGiven a string s, return the lexicographically smallest subsequence of s that contains all the distinct characters of s exactly once.
Remove Duplicate Letters
SolveGiven a string s, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical or...
Happy Number
SolveWrite an algorithm to determine if a number n is happy.
Increasing Triplet Subsequence
SolveGiven an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices e...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent FactSet interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
FactSet interviews focus heavily on string, stack, greedy problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. FactSet interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
FactSet has been reported to ask 5 distinct coding problems. The most common topics are string, stack, greedy. 1 are Easy difficulty, 4 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 5 reported problems, FactSet interviews are easier than average - only 0% Hard compared to 18% across all companies. 80% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: string, stack, greedy. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real FactSet coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a FactSet interview with AIarrow_forward
