Vuram Software Developer Interview Questions and Answers for Freshers

30 questions - aptitude+DSA +Java+Sql MCQ Questions

3 codes are given
1)if number is divisible by 15 then print "Foo" ,if number is divisible by 17 then print "bar" ,
if number is divisible by 15 and 17 then print "Foo Bar"
2) find third largest element of array
3)find factors of number

Q1. Explain Access modifiers public and default difference how to connect java to database 20 % of 25 superclass of all class sql query for delete last 10 rows from employee table
Ans. 
Access modifiers control the visibility and accessibility of classes, methods, and variables in Java.
• public access modifier allows a class, method, or variable to be accessed from any other class.

• default access modifier (no keyword) allows a class, method, or variable to be accessed only within the same package.

• To connect Java to a database, you can use JDBC (Java Database Connectivity) API.

• The superclass of all classe...read more
Answered by AI
Add your answer

Q1. Why you want join our company
Add your answer
Q2. Why should hire you?
Add your answer

DSA coding 2-3 question

Java, DSA coding, java 8 coding, multithreading

Java8, spring-boot, DSA coding

Q1. DSA coding, java 8 coding, spring boot, mysql
Add your answer

Q1. What is Oops concept
Ans. 
Oops concept stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects.
• Oops concept focuses on creating objects that contain data in the form of fields (attributes) and code in the form of procedures (methods).

• It allows for the creation of reusable code and modular programs.

• Encapsulation, inheritance, polymorphism, and abstraction are the four main principles of Oops concept.

• E...read more
Answered by AI
Add your answer
Q2. An situational question
Add your answer

They want you to solve pattern questions

Same complex patterns then first round

Q1. Basics of html sql, linear equations
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

Timing was 9: 30 AM. Platform was quite good and easy to understand.

Q1. Reverse Only Letters
You are given a string, ‘S’. You need to reverse the string where characters that are not an alphabet stay in the same place, and the rest reverse their positions.
Eg: “a-bcd” become...read more
Ans. Two Pointer Approach
Approach: Just like in order to reverse a string ‘S’ = “abcd”, we can can swap(S[0], S[3]) and swap(S[1],S[2]) to get new string “dcba”.
 
Similarly in this problem, we do the same using two pointers while ignoring the non-letter characters.
 
Eg: S = “a-bcd” we swap(S[0], S[4]) and swap(S[2], S[3]) to get the result.
 
Algorithm:
1. In the given string what we can do is maintain two variables ...read more
Answered by CodingNinjas
Add your answer
Q2. Find Duplicate
You have been given an integer array/list(ARR) of size N which contains numbers from 0 to (N - 2). Each number is present at least once. That is, if N = 5, the array/list constitutes values ...read more
Ans. Space Complexity: Explanation: Time Complexity: Explanation:
Answered by CodingNinjas
Add your answer
Q3. Reverse the array
Given an array with N elements, the task is to reverse all the array elements and print the reversed array.
Input Format:
The first line contains an integer N representing the size of ...read more
Ans. Brute Force approach
• Initialise start and end indices with start = 0, end = N-1 where N is the total number of elements in array.
• We then run a loop while start < end and swap arr[start] with arr[end].
• Finally, we increment start and decrement end variable
Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered by CodingNinjas
Add your answer
Q4. Sum of Digits
Ninja is given an integer ‘N’. One day Ninja decides to do the sum of all digits and replace the ‘N’ with the sum of digits until it becomes less than 10. Ninja wants to find what will be the...read more
Ans. Brute Force Approach
The main idea is to do the sum of digits until it becomes less than 10.
 
Algorithm:
• Add a condition if N is less than 10 then return N.
• Do the sum of all digits.
• Make a recursive call and pass the sum of digits as N.
• Return the answer which you get from a recursive call.
Space Complexity: O(1)Explanation:
O(1).
 
We are using constant space to solve this.
Time Complexity: OtherExplanation:
O(log10(...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 30 minutes
Round difficulty - Easy

Timing was 9:30 AM. The interviewer was very nice.

Q1. Nth Fibonacci Number
Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1
Provided N you have...read more
Ans. Recursive Approach
• In this approach, we use recursion and uses a basic condition that :
  • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
  • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
• In this way, we reached our answer.
Space Complexity: O(n)Explanation:
O(N),  where ‘N’ is the given number.  
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:
O(2^N), where ‘N’ i...read more
Answered by CodingNinjas
View 2 more answers
Q2. SQL Question
Write SQL query to find second highest salary from a Table.
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

Q1. Count Frequency
You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.
Example :
Given 'S' : abcd...read more
Ans. Count Frequency
Since there are just 26 lower case characters, we can use an array of size 26 to store the result.
 
Here is the algorithm : 
 
1. Create an array (say, ‘FREQ’), where 0-th index stores the frequency of ‘a’, 1st index stores the frequency of ‘b’ and so on. So the last index i.e. 25th index stores the frequency of ‘z’.
2. Run a for loop from 0 to ‘N’ - 1 (say, iterator ‘i’), on the string and do the f...read more
Answered by CodingNinjas
Add your answer
Q2. DBMS Question
What is Normalization and 3NF?
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. Find a Node in Linked List
You have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise.
...read more
Ans. Recursive Approach
The steps are as follows:
 
1. If the head is null, return -1 since an empty list will obviously not contain the element that we need to look for.
2. Check whether the head’s data is equal to the element we want to search. Return 0 if it is.
3. Then recurse on the next node from the head and get its answer.
4. If the answer from the recursive call is -1, your answer is also -1 since you already check the head’s d...read more
Answered by CodingNinjas
View 1 more answer
Q2. Implement Stack With Linked List
You need to implement the Stack data structure using a Singly Linked List.
Create a class named 'Stack' which supports the following operations(all in O(1) time):
...read more
Ans. Best Approach
1. Maintain a linked list. Keep track of its head, and size at all times, and update them accordingly whenever a new operation is performed.
2. Following is the way we can implement all functions of the stack using linked list:
   1. First, initialize a head node, and the size of the list as NULL and 0 respectively.
   2. Then for push function, insert new elements at the head of the list, i.e. the new element will become the ...read more
Answered by CodingNinjas
Add your answer
Q3. Cycle Detection in a Singly Linked List
You have given a Singly Linked List of integers, determine if it forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the ...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer-loop.
2. For every node of the outer-loop, start the inner loop from head.
3. If the inner-loop visits the node next to the outer-loop node, then return true, else repeat the process for the next iteration of outer-loop.
4. If outer-loop reaches the end of list or null, then return false.
Space ...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 20 minutes
Round difficulty - Easy

Q1. Top View Of The Tree
You are given a Binary Tree of integers. You are supposed to return the top view of the given binary tree. The Top view of the binary tree is the set of nodes that are visible when we ...read more
Ans. Using Pre-Order Traversal
As we know that all three traversals, i.e. pre-order, in-order and post-order, visit the tree node at once. We can use any of them. Here we are going to use pre-order traversal for the explanation. So while traversing in the pre-order traversal, we will keep track of horizontal distance of the node which is going to be visited from the root node, and we also keep track of the vertical level of ...read more
Answered by CodingNinjas
View 2 more answers
Q2. Delete Node In A Linked List
You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a unique value written on it. Your task is to delete...read more
Ans. Brute-force
Approach:
 
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K. 
Although the reference to node K is giv...read more
Answered by CodingNinjas
Add your answer

Q1. OOPS , multi thread, exception
Add your answer
Q2. Java 8 features
Add your answer