iamneo Java Developer Interview Questions and Answers

Q1. About Myself in details
Add your answer
Q2. Past internships and work experiences
Add your answer

Q1. Primary keys, Unique key
Add your answer
Q2. Usage advantages and disadvantages of Indexing
Add your answer

SQL- 1 departments with no users
2 dept_id and their respective no. of users

DSA1: Most frequent no. in an array
DSA2: Zero Sum subarray exists

Basic Aptitude test

Coding Round is little tough.

Q1. Formal conversation about the projects and all that kind of stuff
Add your answer
Q2. What kind of project you have worked on
Add your answer
Q3. How you tackles different project
Add your answer

Basics of JavaScript and HTML and CSS

Q1. All about JavaScript
Add your answer

Q1. In- detail about JavaScript and logical ability questions
Add your answer

Login/signup and to do list using react.js

Q1. Basic questions about family and all
Add your answer

Q1. 1. Coding best practices 2. Writing basic code snippets
Add your answer

Q1. 1. Current projects and challenges
Add your answer

Q1. 1. Release management
Add your answer

Basic coding maths aptitude java python communication skills test

Java coding c plus python SQL oracle dbmsos

Given two arrays [1, 1, 2, 3, 1] and [2, 1, 1, 3, 1], write the code to check for their equality, where equality means that both arrays contain the same elements. Approach 1 involves sorting the arrays and then using a for loop to check for equality; however, sorting has a higher time complexity. The interviewer prefers a solution with O(n) time complexity. Approach 2 suggests using a HashMap to count the occurrences of each element, allowing us to achieve this in O(n) time complexity.

Q1. Find duplicates in an array
Ans. 
Use a hash set to find duplicates in an array of strings.
• Create a hash set to store unique elements.

• Iterate through the array and check if the element is already in the hash set.

• If it is, then it is a duplicate. If not, add it to the hash set.
Answered by AI
Add your answer
Q2. Find single duplicate element in an array where contents of the array are length of array - 1
Ans. 
Find the single duplicate element in an array of strings with length n-1.
• Iterate through the array and use a HashSet to keep track of elements seen so far.

• If an element is already in the HashSet, that is the duplicate element.

• Return the duplicate element once found.
Answered by AI
Add your answer

Create a student support system

Q1. Design an order and payments system for an EdTech company
Ans. 
Design an order and payments system for an EdTech company
• Allow users to browse and select courses

• Implement a shopping cart for users to add courses

• Integrate payment gateways for secure transactions

• Provide order confirmation and receipt to users

• Allow users to track their order status
Answered by AI
Add your answer

They will give you problem to solve

Machine coding round