Veeva Systems Software Engineer Intern Interview Questions and Answers for Freshers

Basic maths question - given a number a and b get the nth number which is divisible by both a and b. And one sql query of concatinating the string in the column results.

Other - which movie you watched?
why do you watch?
who is your role model?
Why? What? How? Where?
Silly questions

Q1. Project based, oops concepts, average dsa questions,
Add your answer

Q1. Sql questions and scenario based questions
Add your answer

There was coding test

Q1. 2 technical rounds
Add your answer
Q2. Merge sort algorithm
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them separately, and then merges them back together in sorted order.
• Divide the input array into two halves

• Recursively sort each half

• Merge the sorted halves back together
Answered by AI
Add your answer

Q1. Leetcode Easy question
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was technical round and it was held on google meet around 1 pm

Q1. Puzzle
Given two hourglass of 4 minutes and 7 minutes, the task is to measure 9 minutes.
Add your answer
Q2. Technical Questions
What is multithreading ?
What is diamond problem ?
He asked some technical questions related to my projects
Add your answer
Q3. Maximum Sum Rectangle
You are given an M X N matrix of integers ARR. Your task is to find the maximum sum rectangle.
Maximum sum rectangle is a rectangle with the maximum value for the sum of integers pr...read more
Ans. Brute force
In this approach, we'll try to consider each rectangle that can be formed using elements of the array. To do this we fix (X1,Y1) coordinates of starting vertex and iterate through the matrix for every pair (X2,Y2) as the coordinates of ending vertex. Now we have a rectangle with coordinates (X1,Y1), (X1,Y2), (X2,Y1) and (X2,Y2).
We'll find the sum of elements within this rectangle and compare it with MAXSUM. ...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 60 minutes
Round difficulty - Medium

It was managerial round and took place around 3 pm

Q1. OS Questions
Producer Consumer Problem using Semaphores
What is Banker's algorithm?
What is Belady's Anomaly ?
Add your answer
Q2. Infix to Postfix
You are given a string EXP which is a valid infix expression. Convert the given infix expression to postfix expression.
Infix expression is of the form a op b. Where operator is is betwe...read more
Ans. Stack
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
1. ANS ...read more
Answered by CodingNinjas
Add your answer

Q1. How do you measure success at work?
Ans. 
Success at work is measured by achieving goals, delivering high-quality work, and receiving recognition.
• Achieving goals set by the team or organization

• Delivering high-quality work that meets or exceeds expectations

• Receiving recognition from colleagues, managers, or clients

• Meeting deadlines and completing tasks efficiently

• Contributing to the overall success of the team or project
Answered by AI
View 2 more amswers
Q2. How many programming languages do you know?
Ans. 
I know multiple programming languages.
• I am proficient in Java, Python, and C++.

• I have experience with web development languages such as HTML, CSS, and JavaScript.

• I am familiar with scripting languages like Bash and PowerShell.

• I have worked with database query languages like SQL.

• I have knowledge of mobile app development languages like Swift and Kotlin.
Answered by AI
View 1 more amswer

Round duration - 120 Minutes
Round difficulty - Medium

I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.

Q1. Ninja Competition
Our hero Ninja is organizing a coding competition where only two teams can participate simultaneously. To make the competition interesting and fair, both the teams should have an equal nu...read more
Ans. Brute Force
We will iterate from 1 to ‘N’ and count the number of even divisors and odd divisors. If they are equal, we will return true, else false.
 
Algorithm:
 
1. Declare two variables, ‘Odd_Count’ and ‘Even_Count’, and initialize them with zero.
2. Start iterating from 1 to ‘N’.
3. If the current iterator ( say i ) is a divisor of ‘N’ ( N % i == 0 ):
   1. If ‘i’ is odd, increase the ‘Odd_Count’ by 1.
   2. If ‘i’ is even, increase ...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Help Bob Out!
Bob has just turned 18 years old and has opened a Bank account. However, since he has just opened his bank account he is not very experienced about the working of banks, therefore he asks for...read more
Ans. Brute Force
To check whether the string is a valid IFSC Code or not we can check every character of the string explicitly and check whether the string is in the correct format or not.
 
Algorithm:-
1. If the length of the string is not equal to 11, return False.
2. Else, iterate from the first index to the fourth index.
   1. Check whether the ASCII values of the characters lie between 65 - 90. If not, return False.
3. If yes, check wh...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 50 Minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

Q1. OOPS Questions
Tell me somethings about OOPs.
Functional v/s OOPS programming language
Polymorphism
Static and Final Keyword in JAVA
Add your answer
Q2. Technical Questions
Explain your project.
Show working of your project.
Tech stack used.
Rest API
There are 3 boxes of green, orange and green+orange. how will you know the all boxes after picking from one box ...read more
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.

Q1. Technical Questions
Tree traversal(Pre-order, Post-order, In-order, Level-order) and code of all orders.
All type Sorting Algorithms and their use cases
How will you make 102-102=1
make 30 using 5 2's
Add your answer