New Baja Java Developer Interview Questions and Answers for Experienced

2 Graph question of leetcode

Q1. DSA Questions of leetcode
Add your answer
Q2. DSA Questions
Add your answer

Q1. TimeMap impl from Leetcode
Add your answer
Q2. SQL query, Your project architecture , GC tuning
Add your answer

Sorting of an array and aptitude

Q1. BFS graph traversal
Add your answer

Q1. Binary tree question
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 0 1 Knapsack
A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum we...read more
Ans. Dynamic Programming
Approach: In the Dynamic programming we will work considering the same cases as mentioned in the recursive approach. In a DP[][] table let’s consider all the possible weights from ‘1’ to ‘W’ as the columns and weights that can be kept as the rows. 
The state DP[i][j] will denote maximum value of ‘j-weight’ considering all values from ‘1 to ith’. So if we consider ‘wi’ (weight in ‘ith’ row) we can...read more
Answered by CodingNinjas
Add your answer
Q2. Second largest element in the array
You have been given an array/list 'ARR' of integers. Your task is to find the second largest element present in the 'ARR'.
Note:
a) Duplicate elements ...read more
Ans. Simple solution
The idea is to sort the array in decreasing order and return the second largest element in the array.
1. Sort the array in decreasing order.
2. We can create a function to sort the elements using a sorting algorithm such as quicksort or use inbuilt sorting functions.
3. Traverse from index 1(0-based indexing) because the element at index 0 will clearly be the first largest and check whether duplicates of the larger ...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

Q1. System Design Question
Design Twitter
Add your answer
Q2. DBMS Questions
Normalizations, Indexing, Transactions etc
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Q1. Basic HR Questions
Where do you see yourself in 5 years?
What are your weakness ?
Add your answer