Upload Button Icon Add office photos

Questionpro

Compare button icon Compare button icon Compare

Filter interviews by

Questionpro Senior Java Developer Interview Questions and Answers

Updated 14 Feb 2025

Questionpro Senior Java Developer Interview Experiences

2 interviews found

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
More than 8 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Assignment 

First round is Assignment in which have to develop simple store APIs

Round 2 - Technical 

(1 Question)

  • Q1. Questions related to Java, and assignment
Round 3 - HR 

(1 Question)

  • Q1. Simple Questions

Interview Preparation Tips

Interview preparation tips for other job seekers - I advise to the developers, Do not apply for this company as they are not clear about there hiring process. After you apply, generally company HRs will help you throughout the process, but here HRs will not call you or not update you about anything. You take to take the initiative and call and take updates.
As my personal Experience, I have cleared All the rounds and provided the Documents also, Still they haven't provided the offer. Personally i wasted so much time for preparation and interviews by taking personal leaves and interviewed at there office. and as a result no response, no updates and no offer.
So this can be happen with you. its better apply some other good company and prepare for that and save your time, energy and efforts.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I appeared for an interview before Feb 2024.

Round 1 - Technical 

(1 Question)

  • Q1. Can you describe the details and architecture of your current project, and how do interviewers assess your knowledge and aptitude for handling complex problems based on this information?
Round 2 - Case Study 

How would you optimize the search function for level 1, 2, and 3 connections in a LinkedIn connection network design?

Senior Java Developer Interview Questions Asked at Other Companies

asked in Amdocs
Q1. Remove the Kth Node from the End of a Linked List You are given a ... read more
asked in Amdocs
Q2. Intersection of Linked List Problem You are provided with two sin ... read more
asked in Amdocs
Q3. Merge Two Sorted Linked Lists Problem Statement You are provided ... read more
asked in Amdocs
Q4. LRU Cache Design Question Design a data structure for a Least Rec ... read more
asked in Caspex Corp
Q5. How would you configure Jenkins or GitLab's CICD pipelines to tri ... read more

Top trending discussions

View All
Office Jokes
2w
an executive
CTC ≠ Confidence Transfer Credit
Ab toh aisa lagta hai, chillar jaise salary ke liye main kaju katli ban ke jaa rahi hoon. Samajh nahi aata, main zyada ready ho ke jaa rahi hoon ya ye mujhe kam pay kar rahe hain? #CorporateLife #OfficeJokes #UnderpaidButWellDressed
FeedCard Image
Got a question about Questionpro?
Ask anonymously on communities.

Interview questions from similar companies

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Questions about Oops, data structures based on the projects I had done, and my resume
  • Q2. Questions about classes and abstraction

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 parts; part 1 is a coding test and part 2 is discussion.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Implement tail -f command

Round 2 - Technical 

(2 Questions)

  • Q1. Kafka partitions
  • Q2. Elasticsearch queries
Round 3 - HR 

(2 Questions)

  • Q1. Why Browserstack?
  • Ans. 

    Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.

    • Provides access to a wide range of browsers and devices for testing

    • Allows for parallel testing to save time and increase efficiency

    • Integrates with popular testing frameworks like Selenium and Appium

    • Offers features like screenshots, video recordings, and debugging tools

    • Used by companies like Microsoft, Twitter, and Airbnb for t...

  • Answered by AI
  • Q2. Any challenge you faced at current company?
  • Ans. 

    Yes, I faced a challenge in integrating a new third-party API with our existing system.

    • Had to understand the documentation of the API thoroughly

    • Encountered compatibility issues with our system

    • Worked closely with the API provider to troubleshoot and resolve issues

  • Answered by AI
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Implement tail f
  • Ans. 

    Implementing 'tail -f' allows real-time monitoring of file changes, displaying new lines as they are added.

    • Use file handling in Python to open a file in read mode.

    • Utilize a loop to continuously read new lines from the file.

    • Implement a sleep function to avoid busy waiting and reduce CPU usage.

    • Example: Use 'with open(filename) as f:' to manage file context.

    • Use 'f.seek(0, 2)' to move to the end of the file before reading ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn development along with DSA
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed before May 2023. There were 4 interview rounds.

Round 1 - Coding Test 

Coding was hard conducted on the platform called interview.io

Round 2 - Coding Test 

Consits of 2 q 1 is Dp, and the other is Graph

Round 3 - Aptitude Test 

Bit harder compared to other companies

Round 4 - Aptitude Test 

Reasoning like questions

Are these interview questions helpful?
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

It was an easy online test

Round 2 - Coding Test 

Question relates to graph like minimum spanning tree,hashing questiond

Round 3 - HR 

(1 Question)

  • Q1. Projects related to questions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.

Round 1 - Coding Test 

On hacker rank , included subjects like DBMS , OS and coding questions on priority queue

Round 2 - Technical 

(2 Questions)

  • Q1. Questions on OOPS
  • Q2. One DSA question on HashMap

I appeared for an interview in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.

  • Q1. 

    Ninja Competition Problem Statement

    Ninja is organizing a coding competition where two teams compete at a time. To keep it fair and interesting, both teams must have an equal number of members. Ninja’s ta...

  • Ans. 

    Check if Ninja can create two teams with equal members given an integer N and its divisors.

    • Iterate through all divisors of N and assign members to the first or second team based on whether the divisor is even or odd.

    • Keep track of the total members in each team and check if they are equal at the end.

    • Return true if the total members in both teams are equal, false otherwise.

  • Answered by AI
  • Q2. 

    Help Bob Out! - Validating IFSC Code

    Bob has just turned 18 and opened a bank account. Being inexperienced with banking, Bob needs your help to validate whether an IFSC code provided by his bank is valid.

    ...
  • Ans. 

    Validate IFSC code based on given rules and return True or False for each test case.

    • Check if the code is 11 characters long.

    • Verify the first four characters are uppercase alphabets.

    • Ensure the fifth character is '0'.

    • Validate that the last six characters are alphanumeric.

  • Answered by AI
Round 2 - Video Call 

Round duration - 50 Minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

Round 3 - Video Call 

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaBottomline Technologies interview preparation:Topics to prepare for the interview - Data Structure, Algorithms, Development, Programming Languages, OOPsTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be strong at your basics.
Tip 2 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?

Application resume tips for other job seekers

Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.

Final outcome of the interviewRejected

Questionpro Interview FAQs

How many rounds are there in Questionpro Senior Java Developer interview?
Questionpro interview process usually has 2-3 rounds. The most common rounds in the Questionpro interview process are Technical, Assignment and HR.
How to prepare for Questionpro Senior Java Developer 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 Questionpro. The most common topics and skills that interviewers at Questionpro expect are HTML, Hibernate, Javascript, Software Development and Spring.
What are the top questions asked in Questionpro Senior Java Developer interview?

Some of the top questions asked at the Questionpro Senior Java Developer interview -

  1. Can you describe the details and architecture of your current project, and how ...read more
  2. Questions related to Java, and assignm...read more

Tell us how to improve this page.

Overall Interview Experience Rating

3/5

based on 2 interview experiences

Difficulty level

Easy 50%
Moderate 50%

Duration

2-4 weeks 50%
More than 8 weeks 50%
View more

Interview Questions from Similar Companies

BrowserStack Interview Questions
3.6
 • 50 Interviews
Fingent Interview Questions
4.2
 • 25 Interviews
Backbase Interview Questions
3.7
 • 23 Interviews
Khoros Interview Questions
3.7
 • 20 Interviews
3Pillar Global Interview Questions
3.2
 • 20 Interviews
Bottomline Interview Questions
3.4
 • 20 Interviews
Fourkites Interview Questions
3.7
 • 18 Interviews
Mentor Graphics Interview Questions
4.0
 • 18 Interviews
View all
Questionpro Senior Java Developer Salary
based on 21 salaries
₹7.5 L/yr - ₹33 L/yr
18% more than the average Senior Java Developer Salary in India
View more details

Questionpro Senior Java Developer Reviews and Ratings

based on 2 reviews

4.8/5

Rating in categories

4.8

Skill development

3.3

Work-life balance

3.2

Salary

3.8

Job security

4.2

Company culture

4.8

Promotions

4.2

Work satisfaction

Explore 2 Reviews and Ratings
Technical Support Engineer
34 salaries
unlock blur

₹2.3 L/yr - ₹7.5 L/yr

Customer Success Manager
23 salaries
unlock blur

₹6.6 L/yr - ₹13 L/yr

Senior Java Developer
21 salaries
unlock blur

₹7.4 L/yr - ₹33 L/yr

Product Manager
21 salaries
unlock blur

₹8.6 L/yr - ₹22.7 L/yr

Software Engineer
17 salaries
unlock blur

₹5.4 L/yr - ₹17.6 L/yr

Explore more salaries
Compare Questionpro with

Yodlee

3.8
Compare

Fingent

4.2
Compare

Bravura Solutions

3.9
Compare

CloudMoyo

4.1
Compare
write
Share an Interview