Upload Button Icon Add office photos

Filter interviews by

Clear (1)

AlphaSense Automation Test Engineer Interview Questions and Answers

Updated 12 Jan 2021

AlphaSense Automation Test Engineer Interview Experiences

1 interview found

I applied via Naukri.com and was interviewed before Jan 2020. There were 4 interview rounds.

Interview Questionnaire 

10 Questions

  • Q1. Oops concepts
  • Q2. Collection
  • Q3. Difference between abstract and interface
  • Ans. 

    Abstract class is a class that cannot be instantiated and can have both abstract and non-abstract methods. Interface is a blueprint for a class and can only have abstract methods.

    • Abstract class can have constructors while interface cannot

    • A class can implement multiple interfaces but can only inherit from one abstract class

    • Abstract class can have instance variables while interface cannot

    • Abstract class is used for code r...

  • Answered by AI
  • Q4. Pom module
  • Q5. Maven
  • Q6. Jenkins
  • Q7. File downloading wait
  • Q8. Array max, second array max
  • Q9. Login with multiple credentials which are stored in one excel sheet
  • Ans. 

    Multiple credentials can be logged in using data from an excel sheet.

    • Read the excel sheet using a library like Apache POI

    • Iterate through the rows and columns to get the data

    • Use a loop to login with each set of credentials

    • Assert the login success or failure for each set of credentials

  • Answered by AI
  • Q10. Explicit wait and implicit wait

Interview Preparation Tips

Interview preparation tips for other job seekers - Try to give answer in straight forward way, if don't know then move forward

Skills evaluated in this interview

Interview questions from similar companies

Interview Preparation Tips

Round: Technical Interview
Tips: * Easy technical questions
* Hiring procedure is more of technical assessment + personality assessment

Skills:
College Name: IIT Madras

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

I was interviewed in Dec 2016.

Interview Preparation Tips

Round: Technical Interview
Experience: On-site interview (5 hours).

4 back-to-back 45-minute coding interviews, followed by a design interview, with a lunch break with a Googler in the middle.

The first coding interview was a set of (surprisingly) trivial (no algorithms needed) incremental coding questions.

The two next coding interviews were problems straight from the "Cracking the coding interview" book. Even though I divulged that I'd solved pretty much exactly the same problem before, they didn't give me an alternative problem and I quickly coded up a general and optimal solution for the problems. Follow-up in-depth questions were minimal and not hard.

The last coding question was a pure algorithm question related to search trees/tries. No coding required, spent the whole time reasoning about the most effective algorithm. This was a bit of a brain twister.

The design question was related to high-level system design (not OO design) for storage and search in geographic data. Focus was effective search as well as scalability both in traffic and data volumes.

Tips: Read "Cracking the coding interview" or other similar literature. Solve all the problems and you should be good to go. If you solve a bunch of problems at HackerRank (or similar) as well, you'll have the added bonus of training on how to generalize the algorithms.

Interview Questionnaire 

1 Question

  • Q1. Off-campus interviews in Bangalore

Interview Preparation Tips

Round: Test
Experience: Only a few students will get shortlisted who do all the questions correctly.

Round: Other Interview
Experience: First 4 rounds on day 1 and this are just to shortlist for more rounds on some other day.
Tips: They will focus on almost all the concepts of computer science.You need to practice a lot and start it right now. Should be easy if you have prepared well enough. Use your holidays to start preparing for placements.

General Tips: Sooner you start, better your placement will be as lack of practice & last day study works only for exams but never for interviews. You'll get enough time to prepare for interviews once you get shortlisted. Focus on it even if you are placed already.
Skill Tips: They will focus on almost all the concepts of computer science.
Skills: C , Aptitude
College Name: NIT SURATHKAL

I applied via Campus Placement and was interviewed in Dec 2016. There were 6 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Coding Questions and Thinking Process Analysis.
  • Q2. Analysis about app performance
  • Ans. 

    App performance analysis involves identifying and resolving bottlenecks to improve user experience.

    • Collect and analyze performance metrics such as response time, CPU usage, memory usage, and network latency.

    • Identify and prioritize bottlenecks based on impact on user experience and frequency of occurrence.

    • Implement optimizations such as caching, code refactoring, and database tuning.

    • Continuously monitor and test perform...

  • Answered by AI
  • Q3. Discussion about the project mentioned in resume.

Interview Preparation Tips

Round: Test
Experience: Two questions were given and we are supposed to write code for the same.
Tips: Whatever idea is there, just discuss with interviewer.
Duration: 1 hour
Total Questions: 2

Round: Problem Statement
Experience: You have to solve the question for next round.
Tips: Practice coding well.

Round: Technical Interview
Experience: A coding question was given, but much difficult one, they were looking for approach.
Tips: Share your thought Process Clearly.

Round: Case Study Interview
Experience: A full depth project round was there. They asked my role and responsibility.

Round: Technical Interview
Experience: An application was given to you and you have to make it better the way you can.

Skills: Technical Questions, Technical Analysis, Ability To Cope Up With Stress
College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Data structures

Interview Preparation Tips

Round: Test
Experience: 3 coding questions.
Tips: Prepare data structures well
Duration: 2 hours
Total Questions: 3

Round: Group Discussion
Experience: 2 coding questions on prem and paper.
Tips: Consider all test cases, provide comments on code
Duration: 1 hour 30 minutes

Round: Technical Interview
Experience: Mostly checked problem solving skills, some questions regarding your project, operating systems
Tips: Be confident, try and get the hints provided

College Name: IIT Madras

I applied via Campus Placement and was interviewed in Jan 2016. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Finding a loop in a directed graph, find the last element in a binary tree
  • Ans. 

    To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.

    • For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.

    • To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.

  • Answered by AI
  • Q2. On circular queue and finding the last number which is highest and contains same number. Of digits a the given numbber
  • Ans. 

    The question is about finding the last number in a circular queue that has the highest number of digits.

    • Implement a circular queue data structure

    • Iterate through the circular queue to find the last number with the highest number of digits

    • Compare the number of digits of each number in the circular queue

    • Keep track of the last number with the highest number of digits

  • Answered by AI
  • Q3. Tell me your passions and what. Is the one thing I want to know about you

Interview Preparation Tips

Round: Test
Experience: Coding round based on logic was given
Tips: Practice coding
Duration: 2 hours
Total Questions: 3

College Name: IIT Madras

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Dec 2016. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Binary tree question. Check if left child is less than right child. Recursive and iterative implementation
  • Ans. 

    Check if left child is less than right child in a binary tree

    • Traverse the tree recursively and compare left and right child values

    • Use a stack to traverse the tree iteratively and compare left and right child values

    • Return true if all left children are less than right children, else false

  • Answered by AI
  • Q2. Check if a string is a substring in another string. Discussed speed (not time complexity). not neccessarily always correct but fast
  • Ans. 

    Use built-in string method to check substring presence for faster execution.

    • Use 'indexOf' method to check if substring is present in the main string.

    • If the method returns -1, the substring is not present.

    • If the method returns a non-negative integer, the substring is present.

  • Answered by AI
  • Q3. Maze question. write code on paper in 5 mins. automatically check if function is correct (not testcases)

Interview Preparation Tips

Round: Technical Interview
Tips: Practice writing code on paper

College Name: IIT Madras

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: Questions on linked list, basic logic and an adhoc math problem. Questions were very doable, but time maybe the only constraint
Tips: Manage time, get used to fluently coding in C Java or C++. You wont have access to Internet, man pages during contest so practice coding g without them.
Duration: 3 minutes
Total Questions: 75

Skills:
Duration: 2
College Name: IIT Madras
Contribute & help others!
anonymous
You can choose to be anonymous

AlphaSense Interview FAQs

How to prepare for AlphaSense Automation Test Engineer interview?
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 AlphaSense. The most common topics and skills that interviewers at AlphaSense expect are Selenium, Java, Automation Testing, Python and Software Testing.
What are the top questions asked in AlphaSense Automation Test Engineer interview?

Some of the top questions asked at the AlphaSense Automation Test Engineer interview -

  1. Login with multiple credentials which are stored in one excel sh...read more
  2. Difference between abstract and interf...read more
  3. Explicit wait and implicit w...read more

Recently Viewed

INTERVIEWS

Siemens EDA

No Interviews

INTERVIEWS

AlphaSense

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Siemens EDA

No Interviews

INTERVIEWS

Tractebel

No Interviews

INTERVIEWS

Gabriel India

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Siemens EDA

No Interviews

INTERVIEWS

Tractebel

No Interviews

INTERVIEWS

Tractebel

No Interviews

Tell us how to improve this page.

AlphaSense Automation Test Engineer Salary
based on 4 salaries
₹9.7 L/yr - ₹17 L/yr
58% more than the average Automation Test Engineer Salary in India
View more details
Content Analyst
43 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
27 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
23 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Engineer
16 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Analyst
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare AlphaSense with

Bloomberg

3.4
Compare

Thomson Reuters

4.1
Compare

FactSet

3.9
Compare

S&P Global

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