FactSet Software Engineer candidates report a HackerRank assessment, practical coding and DSA work, plus a later behavioral and system-design discussion. Prepare to implement clearly and explain design tradeoffs.
$118K
Avg. Base Comp
$143K
Avg. Total Comp
3 rounds
Typical Rounds
2-4 weeks
Process Length
FactSet Software Engineer interviews reported here center on implementation, coding fundamentals, and the ability to explain engineering decisions. One candidate described a three-main-round process beginning with a 90-minute machine-coding exercise: requirements had to become running code under a fixed time limit. Another reported a HackerRank assessment with two fully specified implementation problems, using greedy and sliding-window approaches. Practice reading requirements carefully, producing a complete solution, and narrating the decisions that keep it correct.
Coding can also appear in a DSA-focused format. A candidate encountered one easy and one medium problem, while a Software Engineer I report described sorting and array/string tasks alongside foundational CS questions. That suggests preparing concise explanations of complexity, data-structure choices, and tradeoffs rather than treating the work as silent coding.
The later conversation may combine behavioral discussion with high-level design. One Software Engineer candidate was asked to design a ticket-booking system, including entities, APIs, and preventing double booking; the discussion went deeper on consistency in the booking flow. Be ready to turn a broad prompt into clear components, explain reliability choices, and discuss what happens when concurrent requests compete for limited inventory. The evidence is limited, so exact sequencing can vary by team and location.
Synthesized from 5 candidate reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Factset process.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Factset
Given an integer N, write a function that returns all of the prime numbers up to N
| Question | |
|---|---|
| Find the Missing Number | |
| Rectangle Overlap | |
| String Subsequence | |
| Triplet Counting | |
| Nearest Common Ancestor | |
| Groups of Anagrams | |
| Radix Addition | |
| Find Duplicate Numbers in a List | |
| Hurdles In Data Projects | |
| Dijkstra implementation | |
| Target Indices | |
| Messenger Service Design | |
| Filling Supermarket Bag | |
| Implementing the Fibonacci Sequence in Three Different Methods | |
| Binary Tree Validation | |
| Ticket Reservation Locking | |
| String Palindromes | |
| NxN Grid Traversal | |
| Data Stream Median | |
| Rearranging Digits | |
| Impossibly Iterative Fibonacci | |
| Processing Large CSV | |
| LRU Cache 1 | |
| Singly Linked List | |
| Design Poker Schema | |
| Length Of Longest Palindrome | |
| Google Docs Autosave System | |
| 2nd Highest Salary | |
| Merge Sorted Lists |
Synthesized from candidate reports. Individual experiences may vary.
Candidates report either a HackerRank assessment with fully described coding problems and test cases or a 90-minute machine-coding task. Expect to translate requirements into a complete working solution; reported approaches included greedy algorithms and sliding windows.
A candidate reported an easy and a medium DSA problem, while another Software Engineer I report included basic array and string tasks plus CS fundamentals. Typically, candidates should explain their approach, complexity, and data-structure choices while coding.
One Software Engineer candidate described a final conversation combining behavioral discussion with a ticket-booking design. Candidates may be asked to define entities and APIs, then discuss consistency and how to avoid double-booking under concurrent demand.
