In-feeds

Total views

FactSet Placement Test 2020

 

FactSet Placement Test 2020


 About Company

FactSet combine hundreds of databases into a single, powerful information system. FactSet is a one-stop source for financial information and analytics for business analysts, portfolio managers, investment bankers / management firms and other financial professionals to analyse companies, portfolios. markets & economies. Founded in 1978 and operating from 60 locations worldwide employing nearly 9000 people, FactSet has over $1. Billion in annual revenues and is headquartered i Nor-walk, Connecticut. There operations extend within North America as well as Europe and the Pacific Rim. Since 1996, the Company has been publicly traded on the New York Stock Exchange under the symbol FDS, and is dual-listed on the NASDAQ under the same symbol integrated financial and economic information to the investment management and banking industries.

 FactSet create data and software solutions for investment professionals around the world. providing instant access to financial data.

 --> About company

--> Work and Role

--> On-Campus Placement Process

--> Programming Question Asked

        --> Purchasing suppliers

        --> Scatter Palindrome 

Works

FactSet is looking for talented Software Engineers who will be responsible for designing, developing, implementing and maintaining various financial applications tools and utilities. A software engineer is typically involved in all phases of development - from design through implementation. Software engineers work with various other departments to see that FactSet products and technology are responsive to changing needs of the investment community. Ideal candidate must have thorough knowledge of Software Engineering principles and best practice. Individual must possess high degree of creativity, strong talent for problem solving to conquer complex technical obstacles and work independently.

While working on different projects, Software Engineers at FactSet use a combination of the following

1) Object oriented language such as C++, C#, Java, Go.

2) Scripting languages like Python, Perl, etc. on Windows or Linux platform.

3) Platform as a Service (Paas) and cloud Technologies like Heroku, AWS, Azure.

4) Relational Database technologies such aa PostgreSQL, SQL Server, Oracle.

5) NOSQL Daabase technology Redis, ES (Elasticsearch).

6) UI technologies AngularJS, VueJS, WPF (Windows Presentation Foundation).

7) JavaScript libraries and species such as jQuery, Bootstrap, ES6. Typescript etc.

8) Continuous Integration Tools like Jenkins

9) Source Code repositories like Perforce and GIT

 

Specific responsibilities (but not limited to) include:

1) Develop new application/features and make enhancements to existing applications.

2) Maintain, fix bugs in existing applications and deploy them to different environment. 

3) Work with Product Development team to prioritise and resolve issues.

4) Follow coding guidelines and engineering processes outlined by the team.

5) Take ownership of assigned project/module and conclude task within deadlines.

 

FactSet On-Campus Placement

Job Profile: Software Engineer

Location: Hyderabad

Packages/Offerings: INR 9.11 LPA (INR 8.98 fixed + bonus)

 

Placement Process:  

Programming test --> technical round-1 interview --> technical round-2 interview --> HR interview.

 1)    Programming Test:

Platform: HackerRank.

Duration:   70 (30 + 40)min

No. of Questions: 2 (given below)

Languages supported: C | C++ | Java | Python | JavaScript | Kotlin

Selection Criteria: At least 1 complete plus 1 partial coding question solved.

Question Level: Easy to Intermediate.

Question Tags: Data Structures, Implementation, Arrays, String, Combinatorics

Note: Round has 2 question. Candidate are supposed to solve them in fixed interval of 30 and 40 min for question 1 and 2 respectively.

               

 2)      Technical Round 1 Interview

  • Platform: Code-Pair
  • Candidates are asked to write pseudo code or programs for coding problems.
  • Example:

1)  Check if linked list is palindrome.

2)  Sort a string array having strings of length 10^50.

3)  Find number of sub-arrays which consist of k perfect squares in an array.

 

 3)     Technical Round 2 Interview

Again candidate asked to write pseudo code or program for coding problem. Of course these problems are difficult from previous round problems. Consists of tree, graphs, DP etc.

 

Tips for Technical Rounds:


1)  They are probably looking for candidate who can solve complex programming problems.

2) Take time while solving question in interview and let the interviewer know how you are dealing with problem.

3)  Personally I suggest to solve geeksforgeeks top 25 question before interview .

 

 4) HR Interview

 

 

Programming Questions asked in Test




 

Q1. Purchasing Supplies

 

A manufacturer purchases fragile components that must be shipped using expensive containers. The manufacturer agrees to provide customers with a free container of components for returning a certain number of containers. Determine the maximum number of containers a customer can receive given a budget, the cost per container, and the number of empty containers that must be returned for a free container. Assume each container is immediately emptied and returned for credit

 

Example

n=4

cost=1

m=2

 Start with a budget n=4 units of currency to buy containers at cost 1 unit each. The number of empty containers to return for a free full container is m = 2. First, buy 4 containers with the entire budget. Turn in those 4 containers for 2 more containers. Turn in those 2 containers for one more. At this point, there are not enough funds or containers to receive another. In total, 4 + 2 + 1 = 7 containers were obtained.

 

Function Description

Complete the function maximumContainers() in the editor below.

maximumContainers() has the following parameter(s):

string scenarios[n]: each string contains three space-separated integers, starting budget, cost, and the number of containers to return for a full container.

Print:

int:  For each test case the function must print an integer, the maximum number of containers the manufacturer can obtain, each on a new line. No return value is expected.

Constraint

  • 1 <= n <= 1000
  • 1 <= m <= 1000
  • 2 <= Number of empty containers to return <= starting budget

 

 Input Format for Custom Testing

Input from stdin will be processed as follows and passed to the function

  • The first line contains an integer n, the size of scenarios[] or the number of test cases.
  • Each of the next n lines contains three space-separated integers, original budget, cost in dollars, and cost in empty containers. These are read as a single string by the code stub.

Sample Case 0

 

Sample Input Case 1

STDIN              Function

3            -->     size of scenarios [] n = 3

10 2 5   -->      scenarios = ['10 2 5', 12 4 4, '6 2 2']

12 4 4

6 2 2

 

Sample Output 0

6

3

5

 

Explanation 0

1. Spend 10 units currency on 5 containers at 2 units each. Turn in 5 containers for another one for a total of 6

2. Spend 12 units on 3 containers at 4 units. There are not enough containers to turn in so the total is 3

3. Spend 6 units on 3 containers at 2 units. Turn in 2 of the containers for a 4th container leaving 1 old and 1 new container, Turn 1 more container making the total 5.

 

Sample Case 1

Sample Input 1

STDIN              Function

2          -->        scenarios[] size n = 2

8 4 2   -->        scenarios = ['8 4 2', '7 2 3']

7 2 3

 

Sample Output 1

3

4

 

 

Explanation 1

There are 2 test cases:

1. Spend 8 units currency on 2 containers at 4 units each. Turn in 2 containers for another one.

2. Spend 6 units on 3 containers at 2 units. Turn in 3 containers for another one. 1 unit of currency is left over.

 

Q2) Scatter-Palindrome

A palindrome is a string which reads the same forward and backwards, for example, tacocat and mom. A string is a scatter-palindrome if is letters can be rearranged to form a palindrome. Given an array consisting of n strings, for each string, determine how many of its sub-strings are scatter-palindromes. A sub-string is a contiguous range of characters within the string.

Example

strToEvaluate= [‘aabb']

The scatter palindromes are {a, aa, aab, aabb, a, abb, b, bb, b}. There are 9 sub-strings that are scatter-palindromes.

Function Description

Complete the scatter Palindrome function in the editor below.

scatterPalindrome() has one parameter:

string strToEvaluate[n]: then n strings to be evaluated

 

Returns

int[n]: each element i represents the number of sub-strings of strToEvaluate[i] which are scatter-palindromes.

 

Constraints

ü  1 <= n <= 100

ü  1 <= size of strToEvatuate[i] <= 1000

ü  All characters of strToEvaluate belongs to ascii[a-z]

 

Input Format For Custom Testing

  • The first line contains an integer, n that denotes the number of elements in strToEvaluate.
  • Each line i of the n subsequent lines (where 0 <= i < n) contains a string that describes strToEvaluate[i].

 

Sample Case 0

Sample Input For Custom Testing

STDIN              Function

1           -->        strToEvaluate[] size n=1

abc      -->        strToEvaluate=["abc”]

 

Sample Output

3

Explanation

The sub-strings that are scatter palindromes of the string abc are:

a

b

c

 

Sample Case 1

Sample Input For Custom Testing

STDIN              Function

1          -->      strToEvaluate[] size n = 1

bbrrg   -->       strToEvaluate = [ "bbrrg" ]

 Sample Output

 

12

 

Explanation

 

The substrings that are scatter-palindromes of the string bbrrg are:

b

bb

bbr

bbrr

bbrrg

b

brr

r

rg

rrg

r

g

 

Comments

  1. Factset visited our campus also. There procedure is also same as mentioned in it. And it is very helpful.

    ReplyDelete

Post a Comment

We need people who give us feedback and this is how we grow. Please do comment if you find something faulty, wrong , helpful, valuable in anyway. You can comment anonymously. Thanks for your contribution.

Popular posts from this blog

Solutions LTI Infinity Coding Challenge 2021

LTI Infinity Coding Challenge 2021

Codenation CodeAgon 2021