Upload Button Icon Add office photos
Premium Employer

i

This company page is being actively managed by i-exceed technology solutions Team. If you also belong to the team, you can get access from here

i-exceed technology solutions Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

i-exceed technology solutions Java Developer Interview Questions and Answers

Updated 25 Sep 2024

i-exceed technology solutions Java Developer Interview Experiences

4 interviews found

Java Developer Interview Questions & Answers

user image Mandar Mangaonkar

posted on 28 Aug 2024

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

(2 Questions)

  • Q1. What is Session in Java
  • Ans. 

    Session in Java is a way to maintain state between client and server over multiple requests.

    • Session is a server-side storage of information related to a specific user.

    • It allows data to be persisted across multiple requests from the same client.

    • Sessions are typically managed using cookies or URL rewriting.

    • Example: Storing user login information in a session to keep the user authenticated across multiple pages.

  • Answered by AI
  • Q2. Hand's on example on Array

Skills evaluated in this interview

Java Developer Interview Questions & Answers

user image Poorvika H P

posted on 25 Sep 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

1st round was aptitude and it was easy

Round 2 - Coding Test 

Question to write a code for Amazon clone

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
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Java basic questions
  • Q2. And Spring Boot
Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I appeared for an interview in Sep 2022.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(1 Question)

  • Q1. Basic questions on Java
Round 3 - One-on-one 

(1 Question)

  • Q1. Tell me about your self
  • Ans. 

    I am a Java Developer with 5 years of experience in developing web applications using Java, Spring, and Hibernate.

    • 5 years of experience in Java development

    • Proficient in Spring and Hibernate frameworks

    • Strong knowledge of web application development

    • Experience in working with databases like MySQL and Oracle

    • Familiarity with Agile development methodologies

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - On second round they didn't even asked anything other than tell me about yourself, and after couple of days they rejected without giving valid reason.

i-exceed technology solutions interview questions for designations

 Java Full Stack Developer

 (1)

 Software Developer

 (3)

 Application Developer

 (1)

 Javascript Developer

 (1)

 Software Engineer

 (8)

 Senior Software Engineer

 (3)

 QA Engineer

 (2)

 Software Engineer II

 (1)

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

  • Q1. 

    Zigzag Traversal of Binary Tree

    Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.

    Note:

    In zigzag order, level 1 is printed from left to right...
  • Ans. 

    Implement a function to print the zigzag traversal of a binary tree.

    • Traverse the tree level by level, alternating the direction of traversal for each level.

    • Use a queue to keep track of nodes at each level.

    • Print the nodes in zigzag order as per the given pattern.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
  • Ans. 

    DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.

    • Used DBMS to store and manage project data efficiently

    • Optimized queries for better performance

    • Designed database schema to handle data effectively

    • Resolved concurrency issues by implementing proper locking mechanisms

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPayU interview preparation:Topics to prepare for the interview - Array ,DP ,Graph ,Recursion, Tree ,Queue,BSTTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 1 good projects
Tip 2 : Practice Atleast 300 Questions
Tip 3 : Should be able to explain your project

Application resume tips for other job seekers

Tip 1 : Always be true with the resume
Tip 2 : Do not put false things on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.

  • Q1. 

    Subset Sum Equal To K Problem Statement

    Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    Provide true if such a subset exists, otherwise r...

  • Ans. 

    Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.

    • Use dynamic programming to solve this problem efficiently

    • Create a 2D array to store if a subset with a particular sum exists

    • Iterate through the array and update the 2D array accordingly

    • Check if the value at the end of the iteration is true for the given K

  • Answered by AI
  • Q2. 

    BFS Traversal in a Graph

    Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...

  • Ans. 

    BFS traversal in a disconnected graph starting from vertex 0.

    • Implement BFS algorithm to traverse the graph starting from vertex 0.

    • Use a queue to keep track of visited nodes and their neighbors.

    • Ensure to print the traversal sequence in the correct order.

    • Handle disconnected components by checking for unvisited nodes.

    • Follow the BFS approach of exploring neighbors before moving to the next level.

  • Answered by AI
Round 2 - HR 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.

  • Q1. 

    Replace Spaces in a String

    Given a string STR consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".

    Input:

    The first line contains an integ...
  • Ans. 

    Replace spaces in a string with '@40'.

    • Iterate through each character in the string

    • Replace spaces with '@40'

    • Return the modified string

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal 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

I appeared for an interview before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview Round with questions based on Data structures, OOPS and SQL.

  • Q1. 

    Delete a Node from a Linked List

    You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.

    Input:

    The first line co...
  • Ans. 

    Implement a function to delete a node from a linked list at a specified position.

    • Traverse the linked list to find the node at the specified position.

    • Update the pointers of the previous and next nodes to skip the node to be deleted.

    • Handle edge cases such as deleting the head or tail of the linked list.

    • Ensure to free the memory of the deleted node to avoid memory leaks.

  • Answered by AI
  • Q2. Write an SQL query to find the nth highest salary.
  • Ans. 

    SQL query to find the nth highest salary

    • Use the ORDER BY clause to sort salaries in descending order

    • Use the LIMIT and OFFSET clauses to skip the first n-1 highest salaries

    • Combine the above steps in a single query to find the nth highest salary

  • Answered by AI
  • Q3. Can you explain the concepts of Object-Oriented Programming (OOP)?
  • Ans. 

    OOP is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.

    • OOP focuses on creating objects that interact with each other to solve problems.

    • Key concepts include encapsulation, inheritance, and polymorphism.

    • Encapsulation involves bundling data and methods that operate on the data into a single unit.

    • Inheritance allows classes to inherit at...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Was asked me about my favorite technologies, What i liked about Facebook. And asked me to design a cinema ticket reservation web site­ like the one satyam has.

  • Q1. 

    Kth Largest Element Problem

    Given an array containing N distinct positive integers and a number K, determine the Kth largest element in the array.

    Example:

    Input:
    N = 6, K = 3, array = [2, 1, 5, 6, 3, ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order and return the Kth element.

    • Handle multiple test cases efficiently.

    • Ensure all elements in the array are distinct.

  • Answered by AI
  • Q2. What are virtual functions?
  • Ans. 

    Virtual functions are functions in a base class that are overridden in derived classes to achieve runtime polymorphism.

    • Virtual functions are declared in a base class with the 'virtual' keyword.

    • They are overridden in derived classes using the 'override' keyword.

    • They allow a function to be called based on the runtime type of an object.

    • Virtual functions enable dynamic binding and late binding in C++.

    • Example: virtual void ...

  • Answered by AI
  • Q3. Design a Cinema Ticket Reservation System.
  • Ans. 

    Design a Cinema Ticket Reservation System

    • Use a database to store movie information, showtimes, and seat availability

    • Allow users to search for movies, select showtimes, and choose seats

    • Implement a payment system for ticket purchases

    • Send confirmation emails with QR codes for ticket validation

  • Answered by AI
  • Q4. In how many attempts can you find a defective ball among 10 given balls using a two-pan balance scale?
  • Ans. 

    You can find a defective ball among 10 given balls in 2 attempts using a two-pan balance scale.

    • Divide the 10 balls into two groups of 5 each.

    • Weigh the two groups on the balance scale.

    • If one group is heavier, it contains the defective ball. If they are equal, the defective ball is in the remaining 5 balls.

    • Divide the group of 5 balls with the defective one into two groups of 2 and 3 balls.

    • Weigh the two groups on the bala...

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

HR round that lasted for about 30 minutes. The interviewer asked me questions to know more about me and a puzzle.

  • Q1. Can you tell me about your projects and your extracurricular activities?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 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

I appeared for an interview before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

It was conducted in Hacker rank which consisted of 10 aptitude questions that included C, C++, Java MCQ. 2 programming questions were also given.

  • Q1. 

    Minimum Cost Path Problem Statement

    Given an N x M matrix filled with integers, determine the minimum sum obtainable from a path that starts at a specified cell (x, y) and ends at the top left corner of t...

  • Ans. 

    The problem involves finding the minimum sum path from a specified cell to the top left corner of a matrix.

    • Start from the specified cell and calculate the minimum sum path to reach the top left corner using dynamic programming.

    • Consider the three possible moves: down, right, and down-right diagonal.

    • Keep track of the minimum sum at each cell and update it based on the minimum of the three possible moves.

    • Finally, the mini...

  • Answered by AI
  • Q2. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use backtracking to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Recursively generate combinations by adding open parentheses if there are remaining, and closing parentheses if the number of open parentheses is greater than the number of clo...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Character Counting Challenge

    Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...

  • Ans. 

    Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.

    • Read characters from input stream until '$' is encountered

    • Count lowercase alphabets, digits, and white spaces separately

    • Print the counts of each character type as three integers separated by spaces

  • Answered by AI
  • Q2. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Find K largest elements in an unsorted array and return them in non-decreasing order.

    • Sort the array in non-decreasing order.

    • Return the last K elements of the sorted array.

  • Answered by AI
  • Q3. How can you check whether you have an internet connection on your system?
  • Ans. 

    To check internet connection on a system, you can use various methods like pinging a website or checking network status.

    • Use ping command to check connectivity to a website (e.g. ping www.google.com)

    • Check network status using network settings or command line tools

    • Try accessing a website or online service to verify internet connection

  • Answered by AI
  • Q4. What happens when you type a URL in a web browser?
  • Ans. 

    When you type a URL in a web browser, the browser sends a request to the server hosting the website, which then responds with the necessary files to display the webpage.

    • Browser checks cache for DNS resolution

    • If not found, browser sends a DNS query to resolve the domain name to an IP address

    • Browser establishes a TCP connection with the server

    • Browser sends an HTTP request to the server for the webpage

    • Server processes the...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on data structures, oops and networking.

  • Q1. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...
  • Ans. 

    Implement counting sort algorithm to sort an array of integers without comparisons.

    • Count the frequency of each element in the input array.

    • Calculate the prefix sum of frequencies to determine the position of each element in the sorted array.

    • Place each element in its correct position based on the prefix sum.

    • Time complexity of counting sort is O(n+k), where n is the number of elements and k is the range of input.

    • Example: ...

  • Answered by AI
  • Q2. What are the applications of the Fibonacci series in real life?
  • Ans. 

    The Fibonacci series has applications in various fields such as mathematics, computer science, art, and nature.

    • Used in algorithms for optimization problems and dynamic programming.

    • Found in nature, such as the arrangement of leaves on a stem, the branching of trees, and the spiral shapes of shells.

    • Applied in financial markets for predicting stock prices and analyzing market trends.

    • Utilized in art and design for creating

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round where the interviewer asked questions to know more about me.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPaypal 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 Preparation Tips

Round: Technical Interview
Experience: Finally, I got the offer from PayU. I was very Happy. Thanks AmbitionBox for helping me in my preparation

Skills: Algorithm, data structures
College Name: Na

I applied via Campus Placement

Interview Questionnaire 

1 Question

  • Q1. Task Scheduling

Interview Preparation Tips

Round: Test
Experience: Questions are very basic and easy to answer .Algorithms should be implemented on spot but they are also standard ones
Tips: read Richie and kernigan
Duration: 60 minutes

Round: Technical Interview
Experience: Nice question and very hard to solve .Though it is a standard problem but requires spontaneous thinking because there are some restrictions for it
Tips: Read cormen

General Tips: Learn all basic algorithms and be confident.
Skill Tips: Solve some puzzles
Skills: Problem Solving Skills, Approaching A Problem
Duration: 2
College Name: IIT Madras
Motivation: i like data engineering profile

i-exceed technology solutions Interview FAQs

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

Some of the top questions asked at the i-exceed technology solutions Java Developer interview -

  1. What is Session in J...read more
  2. Basic questions on J...read more
  3. Hand's on example on Ar...read more

Tell us how to improve this page.

i-exceed technology solutions Java Developer Interview Process

based on 4 interviews

Interview experience

3.8
  
Good
View more
i-exceed technology solutions Java Developer Salary
based on 7 salaries
₹5.5 L/yr - ₹7.6 L/yr
18% more than the average Java Developer Salary in India
View more details
Software Engineer
296 salaries
unlock blur

₹2.8 L/yr - ₹9.8 L/yr

Senior Software Engineer
195 salaries
unlock blur

₹5 L/yr - ₹18 L/yr

Team Lead
86 salaries
unlock blur

₹9.4 L/yr - ₹21.1 L/yr

Software Developer
39 salaries
unlock blur

₹4.5 L/yr - ₹9.6 L/yr

Project Lead
28 salaries
unlock blur

₹17.6 L/yr - ₹31 L/yr

Explore more salaries
Compare i-exceed technology solutions with

Broadridge Financial Solutions

3.9
Compare

MasterCard

3.9
Compare

PayPal

3.9
Compare

HighRadius

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