Upload Button Icon Add office photos

Invesco

Compare button icon Compare button icon Compare

Filter interviews by

Invesco Software Engineer Interview Questions and Answers for Freshers

Updated 27 Jun 2024

Invesco Software Engineer Interview Experiences for Freshers

1 interview found

Interview experience
4
Good
Difficulty level
Easy
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Containerized pipelines

Interview questions from similar companies

Interview Questionnaire 

8 Questions

  • Q1. Find a number which occurs odd number of times and all number occurs even number of times
  • Ans. 

    Find an odd occurring number among even occurring numbers.

    • Use XOR operation to cancel out even occurring numbers and get the odd occurring number.

    • Iterate through the array and XOR each element with the result variable.

    • The final result will be the odd occurring number.

  • Answered by AI
  • Q2. Some discussion about my minor project
  • Q3. Spiral order of binary tree and mattrix, print it
  • Ans. 

    Print the spiral order of a binary tree and matrix.

    • For binary tree, use level order traversal and alternate direction for each level.

    • For matrix, use four pointers to traverse in spiral order.

    • Example for binary tree: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9

    • Example for matrix: 1 2 3 4 -> 8 7 6 5 -> 9 10 11 12 -> 16 15 14 13

  • Answered by AI
  • Q4. Some question about os,dbms
  • Q5. Find pair which have a given sum in a given array
  • Ans. 

    Finding pairs in an array with a given sum.

    • Iterate through the array and for each element, check if the difference between the given sum and the element exists in the array.

    • Use a hash table to store the elements of the array and their indices for faster lookup.

    • If there are multiple pairs with the same sum, return any one of them.

    • If no pair is found, return null or an empty array.

  • Answered by AI
  • Q6. Find total number of k element which have a given avg in a given array in minimum time complexity
  • Ans. 

    Find total number of k element with given avg in an array in minimum time complexity.

    • Use sliding window technique to traverse the array in O(n) time complexity.

    • Maintain a sum variable to keep track of the sum of elements in the window.

    • If the sum of elements in the window is equal to k times the given avg, increment the count.

    • Move the window by subtracting the first element and adding the next element in the array.

  • Answered by AI
  • Q7. Print all elements which in not boundary element in a given binary tree
  • Ans. 

    Printing non-boundary elements of a binary tree

    • Traverse the tree in any order (preorder, inorder, postorder)

    • Check if the current node is not a boundary node (not the first or last node in its level)

    • If it is not a boundary node, print its value

    • Recursively traverse its left and right subtrees

  • Answered by AI
  • Q8. Then some question about process synchronisation,error vs exception,and then 2-3 hr question

Interview Preparation Tips

Round: Test
Experience: practice codes on paper
Tips:

Round: Technical Interview
Experience: very good
Tips: please try to explain each and every question in detail

Round: Technical Interview
Experience: my hr round is not taken by them,and some of face 3rd round ,which is HR
Tips: please prepare all types of problem from geeksforgeeks

Skill Tips: please try to understand every problem from geeksforgeeks
Skills: ds
College Name: NIT Bhopal
Motivation: best work culture,and a lots of learning opportunity in this company,and in every 6 month there is a appraisal

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: 7 CGPA cut off, The First round was an Aptitude test (quant+DI+verbal ) 20 questions + 10 basic C/C+ questions
Total Questions: 30

Round: Other Interview
Experience: Second Stage: 2 rounds Tech interview + 1 HR, Very casual personal interview with questions based on resume onlyNo core coding questions since I was from ECE but for Comps/IT they expect knowledge in DBMS.Some finance questions like what are stocks/shares, mutual funds etc. I was asked more detailed finance questions also since I had mentioned my finance interns.

Skill Tips: Be thorough with apti tests . Past CAT papers are ideal as they cover all aspects  (quant+Data Interpretation +Logical reasoning +verbal ) For learning finance jargon use Economist A-Z list and Investopedia
Skills: quant, Data Interpretation , Logical reasoning
College Name: NIT SURATHKAL

Interview Questionnaire 

4 Questions

  • Q1. Tell me about your internship, B.Tech project(BTP), CV
  • Q2. Implement LRU cache.
  • Ans. 

    Implement LRU cache

    • LRU stands for Least Recently Used

    • It is a cache eviction policy that removes the least recently used item

    • It can be implemented using a doubly linked list and a hash map

    • Newly accessed items are moved to the front of the list

    • When the cache is full, the item at the end of the list is removed

  • Answered by AI
  • Q3. What is virtual memory? Will we need virtual memory even if we have infinite amount of RAM?
  • Ans. 

    Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.

    • Virtual memory uses a combination of RAM and hard disk space to store data.

    • It allows programs to use more memory than is physically available.

    • If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.

    • Even if we had infinite RAM, virtual memory would still be n...

  • Answered by AI
  • Q4. Given an array, Find out maximum length of subarray where max of subarray <= 2*min of subarray
  • Ans. 

    Find maximum length of subarray where max <= 2*min.

    • Iterate through array and keep track of max and min values.

    • Update max length when condition is met.

    • Time complexity: O(n)

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: No CPI cut off and It was open for all departments.

Round: Test
Experience: In muliple choice question Mostly questions were base on maths, probability, c programs, algorithms, Systems. If you are prepared then Questions were not that much tough. Keep strong concepts of Operating systems. For subjective part, Some problems were from maths proofs, some were from probability, some were from algo. We had to write algorithms. etc
Duration: 180 minutes

Round: Problem Statement
Experience: Questions were doable.

Round: Interview
Experience: Everyone was cool, They made me feel comfortable and then started asking questions.
Tips: If you have good rank in online coding competition, do mention it in CV.Most of the students think that GS asks only probability-puzzles. They did not asked me any question on probability or puzzle. Everything they asked was based on Algorithms problems and Operating system. I think it depends on team for which they are hiring. Most important point is don’t lose hope because you have low CPI or you are not good at something. Keep Operating systems fundamental concepts strong.

General Tips: We should balance in Placement and Compititive online coding. Keep in mind Placements and Compititive online coding are some what different things. Keep on improving our mistakes on daily basis. I would strongly suggest you to do introspection daily it will help you to find out your weaknesses and strong points, where we are going wrong etc. There are two thing on which we shoud focus.1. Preparation (I have told everything requered for preparation).2. Get output of all hard work. How to keep our mind on 100% output while the actual exam(placement).For this, I used to go for physical exercise daily in the morning and medidate for 20-30 minutes. Along with exercise i used to do Sudarshan Kriya(Art of Living). Meditation has lot of power :).
Skill Tips: Keep your OS fundamentals strong. To improve codgin skills practice as many problems as you can. Regularly participate in online coding competitions it really helps to solve or approach any new problem. Many time instead of correct answer the approach to solve the problems is very important. How you think, How you approach the problem is checked in interview.
Skills: Coding Skills, Operating Systems , Problem solving skills
College Name: IIT Guwahati
Motivation: The name GS itself enogh for motivation.

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions on DSA and OS.

  • Q1. 

    LRU Cache Design Problem Statement

    Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    • get(key) - Retrieve the value associated with the...
  • Ans. 

    Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.

    • Implement a doubly linked list to keep track of the order of keys based on their usage.

    • Use a hashmap to store key-value pairs for quick access and updates.

    • When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.

    • When the cache reaches...

  • Answered by AI
  • Q2. 

    Maximum of All Subarrays of Size K

    Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...

  • Ans. 

    Find the maximum elements for each subarray of size K in a given array.

    • Iterate through the array and maintain a deque to store the indices of elements in decreasing order.

    • Pop elements from the deque that are out of the current window.

    • Keep track of the maximum element in each subarray of size K.

    • Return the maximum elements for each subarray.

  • Answered by AI
  • Q3. What is virtual memory?
  • Ans. 

    Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.

    • Virtual memory allows programs to use more memory than is physically available on the system.

    • It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.

    • Virtual memory uses a combination of RAM and disk...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAGoldman Sachs interview preparation:Topics to prepare for the interview - Coding Skills, Operating Systems , Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I applied via Company Website and was interviewed before Sep 2019. There were 5 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Whatever mentioned on resume , data structure must (hackerrank coding round mainly on Tree)
  • Q2. Tree traversal implementation , string based question , 2-d array

Interview Preparation Tips

Interview preparation tips for other job seekers - Tree question in hackerrank must , prepare well whatever mentioned in your resume

I applied via Naukri.com and was interviewed in May 2019. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Related debugging, views, scripting, control_m schedule related & Aws basic concepts and real time issues

Interview Preparation Tips

Interview preparation tips for other job seekers - We should be very carefully while answering the question because with in that answer again they will ask one more question.

And be confident

I applied via Campus Placement and was interviewed before Mar 2021. There were 3 interview rounds.

Round 1 - Coding Test 

2 moderate data structure problems

Round 2 - Technical 

(2 Questions)

  • Q1. Write the code for Fibonacci series
  • Ans. 

    Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.

    • Declare variables for first two numbers of the series

    • Use a loop to generate the series by adding the previous two numbers

    • Store the series in an array or print each number as it is generated

  • Answered by AI
  • Q2. Write a SQL joining two tables on a key column
  • Ans. 

    Join two tables on a key column using SQL

    • Use the JOIN keyword followed by the name of the second table

    • Specify the key column in both tables using the ON keyword

    • Choose the type of join (INNER, LEFT, RIGHT, FULL) based on your requirement

  • Answered by AI
Round 3 - HR 

(6 Questions)

  • Q1. What are your strengths and weaknesses?
  • Q2. What are your salary expectations?
  • Q3. What is your family background?
  • Q4. Why should we hire you?
  • Q5. Where do you see yourself in 5 years?
  • Q6. Tell me about yourself.

Interview Preparation Tips

Interview preparation tips for other job seekers - Be good at OOPS concepts.
Data structures is required only to clear the initial coding round.
SQL knowledge is essential for the interview.

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. All were Ds and algo questions?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared on DS and algo section. Also keep practising on online competitive coding.

Interview Questionnaire 

1 Question

  • Q1. Core Java and aws

Invesco Interview FAQs

How many rounds are there in Invesco Software Engineer interview for freshers?
Invesco interview process for freshers usually has 1 rounds. The most common rounds in the Invesco interview process for freshers are Technical.
How to prepare for Invesco Software Engineer interview for freshers?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Invesco. The most common topics and skills that interviewers at Invesco expect are Ajax, Bootstrap, C#, SQL and WCF.
What are the top questions asked in Invesco Software Engineer interview for freshers?

Some of the top questions asked at the Invesco Software Engineer interview for freshers -

  1. Best practices of cod...read more
  2. String related questi...read more
  3. Tuple related questi...read more

Tell us how to improve this page.

Invesco Software Engineer Interview Process for Freshers

based on 1 interview

Interview experience

4
  
Good
View more
Invesco Software Engineer Salary
based on 18 salaries
₹5 L/yr - ₹14.3 L/yr
26% more than the average Software Engineer Salary in India
View more details

Invesco Software Engineer Reviews and Ratings

based on 5 reviews

4.6/5

Rating in categories

4.4

Skill development

4.5

Work-life balance

4.4

Salary

4.5

Job security

4.4

Company culture

4.2

Promotions

4.6

Work satisfaction

Explore 5 Reviews and Ratings
Senior Analyst
134 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Analyst
76 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Team Lead
66 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
57 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
56 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Invesco with

Blackrock

3.8
Compare

Vanguard

4.1
Compare

Fidelity Investments

4.2
Compare

State Street Global Advisors

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview