Velocity Software Pvt. Ltd. interview experience Real time questions & tips from candidates to crack your interview

Php Developer

Velocity Software Pvt. Ltd.

4 rounds | 16 Coding problems

Anonymous

Fresher | Dec 2022

Selected

Interview preparation journey

Journey

I started preparing for this job interview during my graduation in the forth year as I have to apply for campus placements. I got to know about this from naukri.com. This drive was specially for the freshers. There were total 4 rounds 1. Aptitude, Coding MCQ, DBMS and Verbal 2. 4 Coding Problems 3. Technical Interview 4. Hr Interview

Application story

I applied through the naukri.com. I submitted my resume after that I got shortlisted for the next round. I got mail from velocity softwares one day before the first round.

Why selected/rejected for the role?

I got selected for this role because I was able to give them best approach for the given coding problems.

Preparation

Duration: 3 months

Topics: Data Structures, Pointers, OOPS, Algorithms, Dynamic Programming, My SQL, Database, Operating System

Tip

Tip 1 : Practice Atleast 250 Questions on GFG/Leetcode
Tip 2 : For DSA questions in interviews, start explaining from the brute force approach and then move to the optimal one. Convey your thought process to the interviewers, so that they can help you out if you get stuck.
Tip 3 : Do not write anything that you are not confident of in resume
Tip 4 : Do atleast 2 projects

Application process

Where: Naukri

Eligibility: 60 percent

Resume tip

Tip 1: Try to include at least one development project in your resume.
Tip 2: Interviewer will ask anything from your resume so be prepared for it.
Tip 3 : Don't mention some random projects which you are not sure about or copied from Google or somewhere else.

Interview rounds

Round

Medium

Coding Test - Pen and paper

Duration90 min

Interview date20 Dec 2022

Coding problem6

There were total 40 mcq based upon Aptitude, Coding, DBMS
and we had to write one essay on the given topic

1. Puzzle

David can do a piece of work in 2 days while Ron can do the same work in 5 days. How long will it take if both of them work together?

Problem approach

Time taken by David to do the work = 2 days

Work done by David in 1 day = 1/2

Time taken by Ron to do the work = 5 days

Work done by Ron in 1 day = 1/5

So, work by David and Ron in one day = 1/2 + 1/5

= (5 + 2)/10

= 7/10

Therefore, David and Ron can do a piece of work in 10/7 days, i.e., 1 3/7 days.

2. Binary Search

Easy

15m average time

85% success

0/40

Asked in companies

You are given an integer array 'A' of size 'N', sorted in non-decreasing order. You are also given an integer 'target'. Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. If 'target' is not present in the array 'A', return -1.

Note:

You must write an algorithm whose time complexity is O(LogN)

Try solving now

3. Predict the output

-#include int main(){

int x = 80; int y& = x; x++; cout << x << " " << --y;

return 0;}

Problem approach

It will result in a compile time error.

4. Predict the output

#include using namespace std;

int f(int &n){ n--; return n;}

int main(){ int n=10; n=n-f(n); cout<<n;

return 0;}

Problem approach

5. DBMS Question

Write a query to fetch the EmpFname from the EmployeeInfo table in upper case and use the ALIAS name as EmpName.

Problem approach

SELECT UPPER(EmpFname) AS EmpName FROM EmployeeInfo;

6. DBMS Question

Write a query to retrieve the list of employees working in the same department.

Problem approach

Select DISTINCT E.EmpID, E.EmpFname, E.Department
FROM EmployeeInfo E, Employee E1
WHERE E.Department = E1.Department AND E.EmpID != E1.EmpID;

Round

Medium

Face to Face

Duration90 min

Interview date27 Dec 2022

Coding problem3

In this round there were total 4 coding questions, we were not allowed to use any inbuilt data structure or function.

1. All Prime Numbers less than or equal to N

Moderate

10m average time

90% success

0/80

Asked in companies

You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the 'N'.

Note:

1) A prime number is a number that has only two factors: 1 and the number itself.

2) 1 is not a prime number.

Try solving now

2. Frequency In A Sorted Array

Easy

15m average time

85% success

0/40

Asked in companies

You are given a sorted array 'ARR' and a number 'X'. Your task is to count the number of occurrences of 'X' in 'ARR'.

Note :

1. If 'X' is not found in the array, return 0.
2. The given array is sorted in non-decreasing order.

Try solving now

3. Star Pattern

Easy

10m average time

85% success

0/40

Asked in companies

Print the following pattern

Pattern for N = 4

The dots represent spaces.

Problem approach

import java.util.Scanner;
public class Edureka
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);

System.out.println("Enter the number of rows: ");

int rows = sc.nextInt();
for (int i=1; i<= rows ; i++) { for (int j = rows; j > i ; j--) {
System.out.print(" ");
}
System.out.print("*");
for (int k = 1; k < 2*(i -1) ;k++) { System.out.print(" "); } if( i==1) { System.out.println(""); } else { System.out.println("*"); } } for (int i=rows-1; i>= 1 ; i--)
{
for (int j = rows; j > i ; j--) {
System.out.print(" ");
}
System.out.print("*");
for (int k = 1; k < 2*(i -1) ;k++) {
System.out.print(" ");
}
if( i==1)
System.out.println("");
else
System.out.println("*");
}
sc.close();
}
}

Try solving now

Round

Medium

Face to Face

Duration40 min

Interview date27 Dec 2023

Coding problem6

Interviewer asked me 2 coding problems, told me to explain my projects and some questions from oops and DBMS

1. Sort Array

Moderate

15m average time

85% success

0/80

Asked in companies

You are given an array consisting of 'N' positive integers where each integer is either 0 or 1 or 2. Your task is to sort the given array in non-decreasing order.

Note :

1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.

Try solving now

2. Cycle Detection in a Singly Linked List

Moderate

15m average time

80% success

0/80

Asked in companies

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.

A cycle occurs when a node's next points back to a previous node in the list.

Example:

In the given linked list, there is a cycle, hence we return true.

Try solving now

3. ML Question

What is Convolution Neural Network?

4. OOPs Question

Explain 4 pillars of OOPS

5. DBMS Question

Difference between Inner Join, Left Join and Right Join

6. DBMS Question

Group by in MYSQL

Round

Easy

HR Round

Duration25 min

Interview date30 Dec 2022

Coding problem1

Basic HR Questions

1. Basic HR Questions

1. Why did you decide to apply to this role?
2. Tell me about your project
3. What do you know about our company’s product/services?
4. Your Strength and Weakness