Upload Button Icon Add office photos

Filter interviews by

Clear (1)

AlphaSense UI Developer Interview Questions and Answers

Updated 9 Nov 2023

AlphaSense UI Developer Interview Experiences

1 interview found

UI Developer Interview Questions & Answers

user image Anonymous

posted on 9 Nov 2023

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Group Discussion 

Love marriage or arrange marriage

Round 3 - Aptitude Test 

Sums and logistics questions

Round 4 - HR 

(2 Questions)

  • Q1. My skill and personal details
  • Q2. About my family and school and College and relocate process

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

General apptitude test

Round 2 - Coding Test 

Based on project and dsa

Interview Preparation Tips

Interview preparation tips for other job seekers - bee good in dsa

Interview Preparation Tips

Round: Test
Experience: Quantitative, verbal, reasoning and basic technical questions.
Duration: 1 hour
Total Questions: 50

Round: Technical + HR Interview
Experience: Questions based on data structures, algorithms, and object oriented programming concepts.
Tested basic knowledge in Finance sector especially related to the company.

College Name: Delhi Technological University, Delhi

Interview Preparation Tips

Round: Pre-placement offer
Experience: Each intern was assigned a individual project and mentor.
In the last week of internship there was project presentation and interview.
interview was easy .For me 50% of the questions were about project and some questions about algorithms and DBMS.
More emphasis was given to the quality of work on project.

General Tips: Working in company is complete different from working on course project. learning many new frameworks required for the project was really challenging.
Programming : Tree, Btree, Tries ..
Operating System: Memory Management
Networks: OSI model
DBMS : basics. they dint ask me any. Show case your interest in big data, servers and passion for technology
Skill Tips: Be confident, even if you don't know the exact answer don't give up tell your approaches to interviewer. some times they will also help you. Software Developer some question s you can ask are: what technologies do your company works on. how are freshers will be selected to different teams in the company.
Skills:
College Name: NIT Surathkal

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: exam was easy.
Tips: Be good in C programming
Duration: 75 minutes
Total Questions: 3

General Tips: Should be good in atleast c or c++
Skills: Algorithms And Data Structures
Duration: 2
College Name: IIT Madras
Motivation: The accomodation and facilities
Funny Moments: Interviews are not funny.

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

Interview Questionnaire 

2 Questions

  • Q1. Circular queues, binary trees, recursion
  • Q2. Asked about project

Interview Preparation Tips

Round: Test
Experience: 3 very simple questions on hackerrank.
Duration: 1 hour 30 minutes
Total Questions: 3

Round: Group Discussion
Duration: 1 hour

Round: Technical Interview
Experience: Asked me to code up a simple question

College Name: IIT Madras

Interview Questionnaire 

14 Questions

  • Q1. Merge two sorted linked list and write testcases
  • Ans. 

    Merging two sorted linked lists and writing test cases.

    • Create a new linked list to store the merged list

    • Compare the first nodes of both lists and add the smaller one to the new list

    • Repeat until one of the lists is empty, then add the remaining nodes to the new list

    • Write test cases to cover all possible scenarios, including empty lists and lists of different lengths

  • Answered by AI
  • Q2. WAP to check if the binary tree is height-balanced and write testcases
  • Ans. 

    WAP to check if binary tree is height-balanced and write testcases

    • A binary tree is height-balanced if the difference between the heights of its left and right subtrees is not more than 1

    • Use recursion to check if each subtree is height-balanced

    • Write testcases to cover all possible scenarios, including empty tree, single node tree, and unbalanced trees

  • Answered by AI
  • Q3. Then he asked me about my internship and to explain my projects
  • Q4. Find the intersection point of two linked list
  • Ans. 

    Find the intersection point of two linked lists.

    • Traverse both lists and find their lengths.

    • Move the head of the longer list to make both lists equal in length.

    • Traverse both lists in parallel until the intersection point is found.

  • Answered by AI
  • Q5. You are given file pointer and integer n, write c code for printing last “n” lines in that file
  • Ans. 

    C code to print last n lines of a file given file pointer and integer n.

    • Use fseek() to move the file pointer to the end of the file

    • Count the number of newline characters encountered from the end of the file until n lines are found

    • Use fgets() to read and print the last n lines

  • Answered by AI
  • Q6. What is deadlock?Conditions for that?What are the methods to prevent it?Write code to prevent the deadlock for OS, considering that there are two processes P0 and P1 in OS and they are requesting resource...
  • Ans. 

    Deadlock is a situation where two or more processes are unable to proceed due to a circular dependency on resources.

    • Deadlock occurs when two or more processes are waiting for resources held by each other.

    • Conditions for deadlock are mutual exclusion, hold and wait, no preemption, and circular wait.

    • Methods to prevent deadlock include resource allocation graph, banker's algorithm, and deadlock avoidance.

    • To prevent deadloc...

  • Answered by AI
  • Q7. How will you avoid race condition on shared memory?
  • Ans. 

    Use synchronization techniques like locks, semaphores, or mutexes to prevent multiple processes from accessing shared memory simultaneously.

    • Implementing a locking mechanism to ensure only one process can access the shared memory at a time.

    • Using semaphores to control access to the shared memory.

    • Using mutexes to ensure mutual exclusion and prevent race conditions.

    • Using atomic operations to ensure that memory operations a...

  • Answered by AI
  • Q8. Suppose there are two processes P0 and P1 and they want write to shared memory and while writing they should have exclusive lock on memory and P0 should be first to write the memory.Write C code using sema...
  • Q9. What is IPC? What are its types? compare them
  • Ans. 

    IPC stands for Inter-Process Communication. It is a mechanism that allows processes to communicate with each other.

    • Types of IPC include shared memory, message passing, and pipes.

    • Shared memory allows processes to share a portion of memory.

    • Message passing involves sending messages between processes.

    • Pipes are a unidirectional form of communication.

    • Shared memory is faster than message passing, but message passing is more r...

  • Answered by AI
  • Q10. If you have design offline browser and what will be challenges that you will face
  • Ans. 

    Designing an offline browser poses challenges such as data storage, synchronization, and user experience.

    • Ensuring efficient data storage and retrieval

    • Implementing synchronization with online content

    • Providing a seamless user experience with limited connectivity

    • Handling updates and changes to online content

    • Managing cache and memory usage

    • Dealing with security concerns

    • Handling different file types and formats

  • Answered by AI
  • Q11. Give the data structure to represent N-ary tree and write to code for its BFS
  • Ans. 

    Data structure and code for BFS of N-ary tree

    • N-ary tree can be represented using a node class with a list of child nodes

    • BFS can be implemented using a queue data structure

    • Iterate through the queue and add child nodes to the queue

    • Pop the node from the queue and process it

    • Repeat until the queue is empty

  • Answered by AI
  • Q12. You are given binary tree. Weight of node in binary tree=data present in it*level of that node(root’s level was given to be 1).Find the node in tree with maximum weight
  • Ans. 

    Find node with maximum weight in a binary tree based on data and level of node

    • Calculate weight of each node based on data and level

    • Traverse the binary tree and keep track of node with maximum weight

    • Return the node with maximum weight

  • Answered by AI
  • Q13. You are given infinite sequence of continuos natural numbers-1,2,3,4,5,6.......... Initially you delete every 2nd element so sequence will be 1,3,,5,7,9,11,13..... now in the resultant sequence you dele...
  • Ans. 

    Program to check if a given number is a lucky number or not.

    • Create a function that takes an integer n as input

    • Initialize a variable count to 2

    • Loop through the sequence and delete every count-th element

    • Repeat the above step until the end of the sequence

    • If n is present in the final sequence, return true, else return false

  • Answered by AI
  • Q14. Write the code to find inorder successor of given node in binary tree
  • Ans. 

    Code to find inorder successor of given node in binary tree

    • Check if the given node has a right subtree, if yes then find the leftmost node in the right subtree

    • If the given node does not have a right subtree, then traverse up the tree until we reach a node which is the left child of its parent

    • If we reach the root and the given node is the rightmost node, then there is no inorder successor

  • Answered by AI

Interview Preparation Tips

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Given an integer array, find all (a,b,c) such that a^2 + b^2 = c^2 Solution is O(n^2) Write code and testcases
  • Ans. 

    Given an integer array, find all (a,b,c) such that a^2 + b^2 = c^2. Solution is O(n^2). Write code and testcases.

    • Use nested loops to iterate through all possible pairs of integers in the array

    • Check if the sum of squares of the two integers is a perfect square

    • If yes, add the triplet to the result list

    • Return the result list

  • Answered by AI
  • Q2. Find the height og a binary tree without recursion. Write code and testcases
  • Ans. 

    Find height of binary tree without recursion

    • Use a stack to keep track of nodes

    • Iteratively traverse the tree and update height

    • Testcases: empty tree, single node tree, balanced tree, unbalanced tree

  • Answered by AI
  • Q3. Given a bit pattern (in an integer INPUT), and another pattern (in an integer PATTERN, with a number n signifying the number of trailing bits to be considered as pattern - remaining bits are zero. Example:...
  • Ans. 

    Count the number of occurrences of a given bit pattern in an integer.

    • Extract the n trailing bits from the pattern and create a mask with all other bits set to zero.

    • Use a sliding window approach to compare the extracted pattern with all possible n-bit sequences in the input integer.

    • Increment a counter every time the extracted pattern matches with a sequence in the input integer.

  • Answered by AI
  • Q4. Given a pointer to the root of a binary tree, find whether the left and right subtrees are mirror images of each other
  • Ans. 

    Given a binary tree, check if left and right subtrees are mirror images of each other.

    • Traverse the tree and compare left and right subtrees recursively.

    • Use a stack or queue to traverse the tree iteratively.

    • Check if the left subtree is a mirror image of the right subtree by comparing their values and structures.

    • Consider an empty tree as a mirror image of itself.

  • Answered by AI
  • Q5. Given a string INPUT, find the longest repeating substring
  • Ans. 

    Find the longest repeating substring in a given string.

    • Create an array of all possible substrings of the given string.

    • Sort the array in lexicographic order.

    • Find the longest common prefix between adjacent strings.

    • Return the longest common prefix found.

    • If no repeating substring is found, return an empty string.

  • Answered by AI
  • Q6. 2 magnesium strips and a matchbox are given. Each burns in 60 minutes, with no relation between length burnt and time. Calculate 45 min
  • Q7. You have 3 baskets- one containing apples, one oranges and the last containing both. All baskets are incorrectly labelled.You can pick *one* fruit from *any one* basket and are supposed to correctly label ...
  • Ans. 

    Pick a fruit from the basket containing both fruits and label the baskets accordingly.

    • Pick a fruit from the basket labelled 'apples and oranges'

    • If you pick an apple, label the basket containing only apples

    • If you pick an orange, label the basket containing only oranges

    • Label the remaining basket as containing both fruits

  • Answered by AI
  • Q8. You're in the center of a circular pond, with an *intelligent* lion at the circumference - intelligent implies you can't trivially fool it. Given that, your swimming speed = x, lion's running speed on l...
  • Ans. 

    Escape from an intelligent lion at the circumference of a circular pond with given speeds.

    • Swim towards the circumference of the pond to make the lion run a longer distance.

    • Once the lion is at a considerable distance, get out of the pond and run in the opposite direction.

    • Use obstacles like trees or rocks to slow down the lion.

    • Try to confuse the lion by changing directions frequently.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Given a string INPUT, find the longest repeating substring.

Example: if INPUT = ababcbacabc, answer would be abc.

Write testcases.

The most important thing here is that you're supposed to ask questions to resolve ambiguities - the substrings cannot be overlappping.

Example: If INPUT = seattle, the expected answer is t, not e.

Example: If INPUT = ababa, answer = ab, not aba.

All such corner-cases must be considered.
Screening interview:

I had a single screening interview for conversion from Microsoft IDC to Redmond. It was more like a chat - in the initial 10-15 minutes atleast.

The first 10-15 minutes was about:

what i learnt at Microsoft
What was my project about
What did I learn from my project (my answer to this included both, learning in technical sense and personal development.
“Why test?” (IDC had selected me as an SDET, and that’s the profile they’d forwarded)

After that he asked what I liked to do (problem solving etc.) On saying “solving new and challenging problems”, he gave me the question:

Given 3 consecutinve numbers, and that the first and third are prime, is it always true that the middle number is divisible by 3 ? Prove your answer.
This question was majorly to check if I can think and zero in on the solution and the process.

Then, my second (and easy) question was to

Write a code for tokenizing a character stream. The stream starts and ends with a delimiter.
Example: Input: “
Here, the start of the string is denoted by ‘<’, and end by ‘>’.
The expected output is to return(or print) list of individual words. ie: “abc, def, msft, pr-st” (four words)

This is a ridiculously easy thing to code - but they weren’t interested in code. What he wanted to see was:
1. Approach
2. If the logic is sturdy enough and considers all test cases
2. Design choices and decision making (the whole Q revolved around this) - I made a list of test cases that the code should consider. In each case, there is a decision to be made - he wanted to see why I decided what I decided.
Example:
Input: “ a<efg>”
This obviously is something where a normal program would fail. My logic to this was: Discard everything before the first start delimiter, after the first end delimiter.
So my output: “abc, cd”

That was all.

Tips: Mine was a PrePlacement interview process - doesnt differ much from the normal campus, but competition is awesome.

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Given a string s[1...n] and a reverse function reverse(s, i, k) > which reverses the character sequence from i to k (inclusive of both) > in string s, determine what the following operations result in. > 1...
  • Ans. 

    Determining the result of string reversal and rotation operations using a reverse function.

    • The first operation reverses the first half and second operation reverses the second half of the string, resulting in a rotation of the string left k positions.

    • The third operation reverses the entire string, resulting in a reversal of the string.

    • Therefore, the correct answer is (b) Rotates the String left k positions.

    • Example: s =...

  • Answered by AI
  • Q2. If len is the length of the string and num is the number of > characters printed on the screen > Give the relation between num and len. > > void abc (char *s){ > if(s[0]=='') > return; > > abc(s+1); > a...
  • Ans. 

    Relation between num and len in a given code snippet

    • The code recursively calls the function abc() twice for each character in the string

    • The printf() statement prints each character once

    • The number of '>' characters printed on the screen is equal to num

    • The length of the string is equal to len

    • The relation between num and len is num = 2^len - 1

  • Answered by AI
  • Q3. Which of the following numbers cannot be represented accurately in > binary? > a) 0.1 b) 6.5 c) 1/16 d)1.32 e) 0.590625 (not sure abt option e) > > 1. a only > 2. a and b > 3. a, b and d > 4. a, b and e ...
  • Ans. 

    Identifying which numbers cannot be accurately represented in binary.

    • Binary cannot accurately represent decimal fractions that do not have a power of 2 as their denominator.

    • Option a (0.1) and option e (0.590625) cannot be accurately represented in binary.

    • Option b (6.5) and option d (1.32) can be accurately represented in binary.

    • Option c (1/16) can be accurately represented in binary as 0.0001.

  • Answered by AI
  • Q4. A process doesn't require additional processors to carry out 40% of > it's execution since 40% is mostly sequential. Determine how many > additional processors are required to execute the process in 150s i...
  • Ans. 

    Additional processors required to execute a process in 150s with 40% sequential execution.

    • Process takes 300s on a single processor

    • 40% of the process is sequential and doesn't require additional processors

    • Calculate the time taken by the remaining 60% of the process

    • Determine the speedup required to execute the remaining 60% in 150s

    • Calculate the number of additional processors required based on the speedup

  • Answered by AI
  • Q5. Time complexity of a function f(m) is O(m). If the array[i...n] > contains either 1 or 0 in each of it's locations, determine the worst > case time complexity of the following piece of code written in C-li...
  • Ans. 

    Determining worst case time complexity of a code snippet with given time complexity of a function and array

    • The time complexity of the given code snippet is O(n)

    • The function f(m) is called only when a 0 is encountered in the array

    • The worst case time complexity is O(n)

    • The code snippet iterates through the entire array once

  • Answered by AI
  • Q6. Increasing the RAM increases the efficiency of the CPU. The reason > is > a) Virtual memory increases > b) Number of page Page faults decreases > c) Page segmentation decreases > d) Increasing the amount o...
  • Ans. 

    Increasing RAM improves CPU efficiency due to virtual memory and reduced page faults.

    • Increasing RAM allows for more data to be stored in memory, reducing the need for frequent access to slower storage devices.

    • Virtual memory allows the operating system to use hard disk space as if it were RAM, increasing the effective amount of memory available to the CPU.

    • Reducing page faults, which occur when the CPU needs to access da...

  • Answered by AI

Interview Preparation Tips

College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: This would include puzzles, algorithm analysis, logic, probability.
Tips: Learn algorithm analysis properly. Try lots of puzzles.
Duration: 30 minutes
Total Questions: 15

Round: Technical Interview
Experience: You will be asked to tell your interests and preferred subjects. Only commit to those topics, which you know well and you are prepared to take the questions to any depth. Don't include any skills with partial knowledge in your resume. If you have to include, then make sure you tag them (use * or write "basic" in brackets).
Tips: Learn whatever interests you, but make sure to learn it deep. Focus on your strengths. Don't cover up your weakness, tell them you don't know that. Don't try to manipulate the interviewers or you might be lead to a dead end. You will only be interviewed on the things you know. They want to know what you know and how fast you can learn. They don't care about what you don't know. Just be good at something and you will surely make it. All the best

Skill Tips: Whatever you learn, be a master in it.
Skills: c, java, debugging, algorithm analysis, logic, , , , Object Oriented Programming,
Duration: 2
College Name: IIT Madras
Contribute & help others!
anonymous
You can choose to be anonymous

AlphaSense Interview FAQs

How many rounds are there in AlphaSense UI Developer interview?
AlphaSense interview process usually has 4 rounds. The most common rounds in the AlphaSense interview process are Resume Shortlist, Group Discussion and Aptitude Test.

Recently Viewed

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Tractebel

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

AlphaSense

No Interviews

INTERVIEWS

Tractebel

30 top interview questions

INTERVIEWS

DBS Bank

No Interviews

DESIGNATION

DESIGNATION

SALARIES

Siemens EDA

Tell us how to improve this page.

AlphaSense UI Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Google Interview Questions
4.4
 • 821 Interviews
Zoho Interview Questions
4.3
 • 505 Interviews
SAP Interview Questions
4.2
 • 283 Interviews
S&P Global Interview Questions
4.1
 • 275 Interviews
Morningstar Interview Questions
3.9
 • 241 Interviews
FactSet Interview Questions
3.9
 • 204 Interviews
Infinx Interview Questions
4.0
 • 183 Interviews
24/7 Customer Interview Questions
3.5
 • 175 Interviews
Globant Interview Questions
3.8
 • 172 Interviews
View all
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