Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Apexon Team. If you also belong to the team, you can get access from here

Apexon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Apexon Java Developer Interview Questions and Answers

Updated 25 Nov 2024

Apexon Java Developer Interview Experiences

3 interviews found

Java Developer Interview Questions & Answers

user image Seban Thomas

posted on 2 Sep 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Explain Sonarqube, different type of code smells, and how its implemented in CI CD
  • Ans. 

    Sonarqube is a static code analysis tool used to detect code smells and bugs in code. It is integrated into CI/CD pipelines for continuous code quality checks.

    • Sonarqube is a static code analysis tool that identifies code smells, bugs, and security vulnerabilities in code.

    • Code smells are common programming issues that may indicate a deeper problem in the code. Examples include duplicated code, long methods, and complex ...

  • Answered by AI
  • Q2. Write a program to find the numbers divisble by 3 in a string - and reverse its indexes eg : - input : String s = "123456789" output String s = "129456783"
  • Ans. 

    Program to find numbers divisible by 3 in a string and reverse their indexes.

    • Iterate through the string and check if each character is a number divisible by 3.

    • Store the divisible numbers in an array and reverse their indexes.

    • Join the array back into a string and return the result.

  • Answered by AI

Java Developer Interview Questions & Answers

user image Manimaran S

posted on 25 Nov 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Easy level java programming questions like Duplicate array

Java Developer Interview Questions Asked at Other Companies

asked in Deloitte
Q1. Sort 0 and 1 Problem Statement Given an integer array ARR of size ... read more
Q2. Parent class has run() and walk() . Parent run() - calls walk() C ... read more
asked in Infosys
Q3. Which should be preferred between String and StringBuffer when th ... read more
asked in Deloitte
Q4. Convert BST to Greater Sum Tree Given a Binary Search Tree (BST) ... read more
Q5. 2. What will happen if hashcode only returns a constant? How will ... read more
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Reasoning and logical thinking it was a good experience

Round 2 - Coding Test 

Dsa questions mainly focus on that

Interview Preparation Tips

Interview preparation tips for other job seekers - good

Java Developer Jobs at Apexon

View all

Interview questions from similar companies

I appeared for an interview before Mar 2016.

Interview Preparation Tips

Round: Test
Experience: 1. output of simple static variable programs
2. hashmap program
3. spring annotations
4.wrapper classes
5. validation script for email
Tips: go through the basics
Total Questions: 6

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Exam was conducted on programmes. 10 questions were asked

Interview Questionnaire 

1 Question

  • Q1. Richardson maturity model

Interview Questionnaire 

1 Question

  • Q1. Focus mainly on Javascript basics and React or Angular.

Interview Questionnaire 

1 Question

  • Q1. Interview questions on .net technology
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
No response

I applied via Approached by Company and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Testing in React
  • Q2. Redux, Async Thunk
Round 2 - Coding Test 

- Test Cases
- Redux

Interview Preparation Tips

Topics to prepare for Brillio Software Developer interview:
  • React
  • Jest

Apexon Interview FAQs

How many rounds are there in Apexon Java Developer interview?
Apexon interview process usually has 1-2 rounds. The most common rounds in the Apexon interview process are Coding Test, Aptitude Test and One-on-one Round.
How to prepare for Apexon 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 Apexon. The most common topics and skills that interviewers at Apexon expect are Java, Spring Boot, Hibernate, Javascript and Microservices.
What are the top questions asked in Apexon Java Developer interview?

Some of the top questions asked at the Apexon Java Developer interview -

  1. Write a program to find the numbers divisble by 3 in a string - and reverse its...read more
  2. Explain Sonarqube, different type of code smells, and how its implemented in CI...read more

Tell us how to improve this page.

Apexon Java Developer Interview Process

based on 3 interviews

Interview experience

4
  
Good
View more
Apexon Java Developer Salary
based on 31 salaries
₹2.8 L/yr - ₹7.3 L/yr
8% less than the average Java Developer Salary in India
View more details

Apexon Java Developer Reviews and Ratings

based on 6 reviews

4.4/5

Rating in categories

4.6

Skill development

4.4

Work-life balance

4.6

Salary

4.7

Job security

4.7

Company culture

4.7

Promotions

4.6

Work satisfaction

Explore 6 Reviews and Ratings
Java Developer

Bangalore / Bengaluru

4-9 Yrs

Not Disclosed

Explore more jobs
Senior Software Engineer
766 salaries
unlock blur

₹6.2 L/yr - ₹26 L/yr

Software Engineer
582 salaries
unlock blur

₹3.9 L/yr - ₹14.4 L/yr

Softwaretest Engineer
257 salaries
unlock blur

₹2.8 L/yr - ₹10.8 L/yr

Senior Engineer
239 salaries
unlock blur

₹7 L/yr - ₹25.8 L/yr

Technical Lead
191 salaries
unlock blur

₹10.2 L/yr - ₹35 L/yr

Explore more salaries
Compare Apexon with

Xoriant

4.1
Compare

CitiusTech

3.4
Compare

HTC Global Services

3.6
Compare

HERE Technologies

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