Edunext Technologies Java Developer Interview Questions, Process, and Tips

Q1. Count occurence of character from a given string without using stream API.

Q2. Rotate given an array by given number

Q1. Count vowels and consonants for the given string
Ans. 
Count vowels and consonants in a given string
• Iterate through each character in the string and check if it is a vowel or consonant

• Keep separate counters for vowels and consonants

• Consider both uppercase and lowercase characters

• Exclude spaces and special characters from counting
Answered by AI
Add your answer
Q2. Find prime number between 1 to n
Ans. 
Use Sieve of Eratosthenes algorithm to find prime numbers between 1 to n.
• Implement Sieve of Eratosthenes algorithm

• Iterate through numbers from 2 to n

• Mark multiples of each number as non-prime

• Remaining unmarked numbers are prime
Answered by AI
Add your answer
Q3. Arraylist vs linkedlist
Ans. 
ArrayList is better for random access and LinkedList is better for frequent insertions and deletions.
• ArrayList uses dynamic array to store elements, allowing fast random access but slower insertions and deletions.

• LinkedList uses doubly linked list to store elements, allowing fast insertions and deletions but slower random access.

• Example: Use ArrayList when you need to frequently access elements by index. Use LinkedList...read more
Answered by AI
Add your answer
Q4. List vs set vs Map
Ans. 
List is an ordered collection, Set is a collection with no duplicates, Map is a key-value pair collection.
• List maintains insertion order, Set does not allow duplicates, Map stores key-value pairs

• List example: ArrayList, Set example: HashSet, Map example: HashMap
Answered by AI
Add your answer
Q5. Count average salary
Ans. 
Calculate average salary of employees
• Sum up all the salaries of employees

• Divide the total sum by the number of employees to get the average

• Example: salaries = [50000, 60000, 70000], average = (50000 + 60000 + 70000) / 3
Answered by AI
Add your answer

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. Oops dsa poly encap merge bubble sort
Add your answer