Upload Button Icon Add office photos
Engaged 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

Clear (1)

i-exceed technology solutions Java Full Stack Developer Interview Questions and Answers

Updated 14 Dec 2024

i-exceed technology solutions Java Full Stack Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

Java Full Stack Developer Jobs at i-exceed technology solutions

View all

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: Apti was quite easy . In Basic CS concepts software engineering is prominent.
Tips: Brush up Software Engineering before written test
Duration: 90 minutes
Total Questions: 50

College Name: NIT BHOPAL

I appeared for an interview before Aug 2016.

Interview Preparation Tips

Round: General and technical aptitude
Experience: There were questions on basics of programming and general questions on verbal,reasoning and quantitative.
Tips: Time will be short to answer all so keep watch on time

Round: Group Discussion
Experience: They segregated us in to batches and in our team there were 10 members.
Tips: Easy round
Duration: 15 minutes

Round: Telephonic
Experience: They tested my communication skill in that round

College Name: Dhanalakshmi college of engineering

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

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 in Apr 2017.

Interview Questionnaire 

2 Questions

  • Q1. Java questions...
  • Q2. Tell me about urself and about us family and all
  • Ans. 

    I am a software developer with a passion for coding and problem-solving. My family is supportive and has always encouraged my career in tech.

    • Experienced software developer

    • Passionate about coding and problem-solving

    • Supportive family that encourages my career in tech

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Easy questions are there
Duration: 1 hour
Total Questions: 90

Round: Group Discussion
Experience: 12 members are there only 9 got selected
Tips: Be confident in urself and specially work in Communication skills
Duration: 15 minutes

Round: Technical Interview
Experience: Asking all the concepts of Java like oops collections threads
Tips: Prepare well on Java

Round: HR Interview
Experience: Everything was Gud but due to my certificate problem I got rejected.. Otherwise everything is good.
Tips: Be confident

College Name: C. V. Raman College of Engineering

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This was an easy round which went really smooth.

  • Q1. 

    Nth Fibonacci Number Problem Statement

    Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

    Input:

    ...
  • Ans. 

    Calculate the Nth Fibonacci number efficiently using dynamic programming.

    • Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.

    • Start with base cases F(1) and F(2) as 1, then iteratively calculate F(n) using F(n-1) and F(n-2).

    • Ensure the input N is within the constraints 1 <= N <= 10000.

    • Example: For N = 5, the 5th Fibonacci number is 5 (1, 1, 2, 3, 5).

  • Answered by AI
  • Q2. 

    Prime Numbers Problem Statement

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

    Input:

    N = 10

    Output:

    2 3 5 7

    Example:

    Input:
    N = 20
    Out...
  • Ans. 

    Implement a function to return all prime numbers less than or equal to a given positive integer N.

    • Create a function that takes a positive integer N as input

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

    • Use a helper function to determine if a number is prime

    • Return an array of all prime numbers less than or equal to N

  • Answered by AI
  • Q3. What is a merge join in SQL?
  • Ans. 

    A merge join in SQL is a method of combining two sorted datasets by matching corresponding rows based on a specified condition.

    • Merge join is used when joining two large datasets that are already sorted.

    • It is more efficient than other join methods like nested loop join or hash join for sorted datasets.

    • The join condition must be an equality condition.

    • Example: SELECT * FROM table1 INNER JOIN table2 ON table1.id = table2.i

  • Answered by AI
Round 2 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The round went excellent. I really enjoyed it. Just be confident about whatever you answer

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALarsen & Toubro Infotech (LTI) interview preparation:Topics to prepare for the interview - Database, Basic C/C++, 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 Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

This round went well. Interview depends on your basic knowledge of C/C++.

  • Q1. 

    Matrix Multiplication Task

    Given two sparse matrices MAT1 and MAT2 of integers with dimensions 'N' x 'M' and 'M' x 'P' respectively, the goal is to determine the resulting matrix produced by their multipl...

  • Ans. 

    Implement a function to multiply two sparse matrices and return the resulting matrix.

    • Create a function that takes two sparse matrices as input and returns the resulting matrix after multiplication

    • Iterate through the non-zero elements of the matrices to perform the multiplication efficiently

    • Handle the edge cases such as empty matrices or matrices with all zero elements

    • Ensure the dimensions of the matrices are compatible

  • Answered by AI
  • Q2. 

    Problem: Count Even or Odd in Array

    Tanmay and Rohit are best buddies. Tanmay gives Rohit a challenge involving an array of N natural numbers. The task is to perform and answer a series of queries on the ...

  • Ans. 

    Count the number of even or odd numbers in a range of an array based on given queries.

    • Create an array to store the input numbers.

    • Iterate through the queries and update or count even/odd numbers based on the query type.

    • Output the count of even or odd numbers for each query of type 1 or 2.

  • Answered by AI
Round 2 - HR 

Round duration - 30 minutes
Round difficulty - Easy

Typical HR round with behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPALarsen & Toubro Infotech (LTI) 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 in Jul 2017.

Interview Questionnaire 

1 Question

  • Q1. Android basics and programs

Interview Preparation Tips

Round: Resume Shortlist
Experience: Resume shortlisted on the basis of 60% through out and experience in development more than 6 months.

Round: Technical Interview
Experience: Core java.. String, oops, exception,

Round: HR Interview
Experience: As usual.. tell me about your self.expectations and salary discussion.
Tips: Be confident whatever you say.

Contribute & help others!
anonymous
You can choose to be anonymous

i-exceed technology solutions Interview FAQs

How many rounds are there in i-exceed technology solutions Java Full Stack Developer interview?
i-exceed technology solutions interview process usually has 1 rounds. The most common rounds in the i-exceed technology solutions interview process are One-on-one Round.
How to prepare for i-exceed technology solutions Java Full Stack 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 Design Patterns, Full Stack, Hibernate, J2EE and JSP.
What are the top questions asked in i-exceed technology solutions Java Full Stack Developer interview?

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

  1. Basic problem solvi...read more
  2. Java princip...read more

Recently Viewed

LIST OF COMPANIES

Discover companies

Find best workplace

INTERVIEWS

i-exceed technology solutions

No Interviews

INTERVIEWS

Revstrat Strategy Consulting

No Interviews

INTERVIEWS

i-exceed technology solutions

No Interviews

INTERVIEWS

Revstrat Strategy Consulting

No Interviews

INTERVIEWS

i-exceed technology solutions

No Interviews

DESIGNATION

SALARIES

Fresenius Kabi

INTERVIEWS

i-exceed technology solutions

No Interviews

INTERVIEWS

Family Health Plan

No Interviews

Tell us how to improve this page.

i-exceed technology solutions Java Full Stack Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Software Engineer
298 salaries
unlock blur

₹3.2 L/yr - ₹9.8 L/yr

Senior Software Engineer
191 salaries
unlock blur

₹5.7 L/yr - ₹15.3 L/yr

Team Lead
83 salaries
unlock blur

₹9.4 L/yr - ₹21.1 L/yr

Software Developer
38 salaries
unlock blur

₹4.5 L/yr - ₹9.6 L/yr

Project Lead
26 salaries
unlock blur

₹17.6 L/yr - ₹28.5 L/yr

Explore more salaries
Compare i-exceed technology solutions with

TCS

3.7
Compare

Infosys

3.6
Compare

Wipro

3.7
Compare

HCLTech

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