Virinchi Technologies Software Developer Interview Questions and Answers for Freshers

Was tough but can be cracked in one go

Easy to moderate need to study dsa

Q1. Self introduction
Add your answer
Q2. Tell me about your projects
Ans. 
I have worked on various projects including a web application for a healthcare company and a mobile app for a retail business.
• Developed a web application for a healthcare company to manage patient records and appointments

• Created a mobile app for a retail business to enhance customer shopping experience

• Implemented features such as user authentication, data visualization, and real-time updates

• Utilized technologies like R
Answered by AI
Add your answer

How to remove duplicate words from string and print the occurrence of words

Q1. Collection frameworks, streams , interfaces why interface why not abstract classes
Add your answer
Q2. Springbooot annotations, scenarios about profile, repository dtos pojos
Add your answer
Q3. React basic questions
Add your answer

40 MCQ and 7 coding mcq and 10 english

Q1. Time complexity and space complexity
Add your answer
Q2. Coding pattern question and explain its complexity
Add your answer

Q1. Sql injection and how to prevent
Ans. 
SQL injection is a type of attack where malicious SQL statements are inserted into an entry field for execution.
• Use parameterized queries or prepared statements

• Sanitize user input by validating and escaping special characters

• Limit database user privileges

• Use a web application firewall

• Regularly update and patch software
Answered by AI
Add your answer

Q1. How to optimize websites
Ans. 
Optimizing websites involves improving speed, user experience, and search engine ranking.
• Minimize HTTP requests

• Optimize images and videos

• Use caching and compression

• Reduce server response time

• Implement lazy loading

• Use a content delivery network (CDN)

• Optimize code and scripts

• Ensure mobile responsiveness

• Improve website security

• Use structured data for SEO
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

We were supposed to give test in any time between 3 PM to 9 PM.

Q1. Total Unique Paths
You are present at point ‘A’ which is the top-left cell of an M X N matrix, your destination is point ‘B’, which is the bottom-right cell of the same matrix. Your task is to find the tot...read more
Ans. Recursive Approach
We can easily count the total number of paths by making a recursive algorithm.
 
The steps are as follows:
 
1. We are given a function UNIQUEPATHS(), which takes two integers ‘M’ and ‘N’ as parameters and returns a single integer. This will be the definition of our recursive function too.
2. As our base condition, we will check if our number of rows (‘M’) or a number of columns (‘N’) is equal to 1. If...read more
Answered by CodingNinjas
View 3 more answers
Q2. Count elements in all subtrees
You are given an arbitrary tree consisting of 'N' nodes numbered from 0 to 'N' - 1. You need to find the total number of elements in all the subtrees of the g...read more
Ans. DFS
An easy way to solve this problem will be to run a modified DFS over the given tree. 
1. Create the output array, “arr” of size ‘N’, where ‘N’ is the number of nodes in the tree.
2. Call the DFS function with source as 0, parent of source as -1(root has no parent) and the given adjacency list.
3. In the DFS function, initialize the count of nodes in the subtree rooted at src with 1.
4. Then, iterate through all the immediate c...read more
Answered by CodingNinjas
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM

Focus Areas: Problem solving and implementation of extensions.

The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
 

Q1. Help Ninja to Cross River
Ninja is standing on the edge of a river and wants to cross the river. There is a wooden bridge over the river but some units of the bridge are damaged. Ninja can not step over a ...read more
Ans. Recursion
Complete Algorithm:
• First of all, we will make a HashMap say ‘MY_MAP’ to store safe units where the key will be ‘SAFE[i]’ and the value will be ‘i’.
• We will make a helper recursive function named ‘SOLVE’ which will receive 4 parameters ‘SAFE’, ‘MY_MAP’, index of current unit ‘INDEX’ and size of previous jump ‘X’.
• Base Case:
  • If ‘INDEX’ is equal to last safe unit:
    • Return true.
• Recursive Calls:
  • Now we have three possibl...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 120 minutes
Round difficulty - Medium

Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.

Q1. Technical Questions
It was more focused on resume they discussed my projects and internships.

1. Asked me to make the tables used in project and discussed the relation between them, joins applied,types of ke...read more
Add your answer
Q2. Middle Of Linked List
Given the head node of the singly linked list, return a pointer pointing to the middle of the linked list.
If there are an odd number of elements, return the middle element if there...read more
Ans. Count Nodes Approach
• If we want to know the midpoint of any linked list, it is very easy to do so if we know the number of elements in the linked list.
• We take a pointer ‘p’ and use it to traverse the linked list and until we find NULL we increment a variable ‘count’ to count the number of elements in the linked list.
• We then divide the number of elements by 2 to get the position of the middle element of the linked list.
• F...read more
Answered by CodingNinjas
View 1 more answer

1st Round was Written Coding test Q> Next Palindrome, Q> ATM machine design Q> SQl query Q> Elephant and banana Prime number Story base question

Q1. Find the Next Palindrome
Ans. 
A program to find the next palindrome number after a given number.
• Convert the given number to a string to easily manipulate individual digits.

• Increment the number by 1 and check if it is a palindrome.

• If not a palindrome, repeat the process until a palindrome is found.
Answered by AI
Add your answer
Q2. Prime number optimisation and why ?
Ans. 
Optimizing prime number algorithms is crucial for efficient computation in software development.
• Optimizing prime number algorithms can improve the performance of applications that rely on prime numbers, such as cryptography or number theory.

• Efficient algorithms like the Sieve of Eratosthenes can significantly reduce the time complexity of finding prime numbers.

• Using techniques like memoization or dynamic programming ca...read more
Answered by AI
Add your answer

78 mcq questions and 2 dsa

Coding based round on dsa