Factset interview questions
Online test → Technical → Technical → HR·89% entry level
DSA
Showing 45 of 187 reported in this area
Check if a given binary tree is a Sum Tree
Count pairs from two sorted matrices whose sum equals a given value
Find the length of the longest substring without repeating characters
Find the maximum path sum in a binary tree
Find a peak element in a given array
Check if there exists a root-to-leaf path in a binary tree with a given sum
Print the right view of a binary tree.
Reverse a linked list in groups of size k.
Search an element in a rotated sorted array
Find the median in a row-wise sorted matrix.
Compute the vertical sum of a given binary tree.
Traverse a binary tree without using extra space.
Perform zigzag (spiral) traversal of a binary tree.
Perform zig-zag (spiral) traversal of a binary tree.
Remove zero sum consecutive nodes from a linked list
Count pairs from two sorted matrices with a given sum
Count the number of pairs (x, y) such that x^y > y^x.
Given a tree, print the boundary elements of the tree.
Given a number, find the next highest palindrome number.
Find the height of a binary tree without using recursion.
Print all subsequences of a given string using recursion.
Find the longest subarray with at most K distinct elements
Find the smallest number formed by inserting a given digit
Find the largest sum contiguous subarray (Kadane’s Algorithm).
Print the covered and uncovered nodes of a Binary Search Tree.
Implement a bidirectional hash map using other data structures.
Check whether a given binary tree is a Binary Search Tree (BST).
Find the minimum time required so that all oranges become rotten
Given two merged linked lists, find the node at which they merge.
Maximize the number N by inserting a given digit at any position.
Find the pivot element in a sorted rotated array in O(log n) time.
Search for an element in a row-wise and column-wise sorted matrix.
Find the maximum distance path in a matrix consisting of 0s and 1s.
Count the number of subarrays having exactly K perfect square numbers
Find a subsequence of a given size whose sum is equal to a given value
Decode an encoded string like a2[b3[cd]] to produce the decoded output.
Find the product of all elements of an array except the current element
Given a number, shuffle all its digits to form the next biggest number.
Maximize the median of an array after performing K addition operations.
Convert a string like "aabbbccx" to "a2b3c2x1" without using extra space.
Find the nearest smaller element to the left for each element in an array.
Find the kth smallest element in a row-wise and column-wise sorted 2D array
Design a stack that supports getMin() in O(1) time without using extra space
Find the minimum number of deletions required to make a string a palindrome.
Write a program to find the Longest Common Subsequence (LCS) of two strings.
CS fundamentals
Showing 6 of 35 reported in this area
Explain the difference between a pointer to a constant and a constant pointer.
Write a medium-level SQL query.
Predict the output of a given code snippet.
Explain Maps, Trees, and LinkedHashMap in Java.
Write SQL queries using GROUP BY and HAVING clauses.
Write a complex SQL query using a SELF JOIN to satisfy a given condition.
Puzzles
Showing 3 of 4 reported in this area
Given 9 identical items where one is heavier, what is the minimum number of comparisons needed to find the heavier item?
If a rectangular section is cut from a rectangle, in how many ways can it be divided equally into two parts such that the cut section is also divided equally?
Fill digits from 0 to 9 in blanks such that if digit X is placed over digit Y, then Y appears exactly X times in the entire sequence.
System design
Showing 3 of 4 reported in this area
Design a database schema for a supermarket system considering discounts and customer offers.
Design an efficient data structure to automatically convert website content to the default language of the country based on the IP address. You are given country name, language, and IP range.
Given a real-time stream of stock sales with company name and price arriving every second, return the top 10 companies whose stocks are sold the most at any instant in O(1) time.
Aptitude
2 questions reported in this area
Solve quantitative aptitude problems on time and distance.
Solve quantitative aptitude problems on pipes and cisterns.
Behavioural
1 questions reported in this area
How would you convince a manager to improve or refactor a part of source code that has been in use for 20 years?
Showing 60 of 206 questions. Ranked by how often the same question came back across reports.
Practise a Factset-style interview
A spoken interview built from these questions, scored when you finish; the report is yours.
Start practisingCommon questions
What questions does Factset ask?
Candidate interview reports most often cover DSA (80%) and CS fundamentals (15%).
How many rounds does Factset interview have?
Candidate interview reports show an average of 3.8 rounds per experience, with a typical sequence of Online test → Technical → Technical → HR. Individual interview paths can vary.
Is the Factset interview hard?
Among questions with a reported difficulty, the mix is easy 31%, medium 57%, hard 12%.