Upload Button Icon Add office photos

Filter interviews by

VProtect Store Incharge Interview Questions and Answers for Experienced

Updated 5 Aug 2021

VProtect Store Incharge Interview Experiences for Experienced

1 interview found

I applied via Walk-in and was interviewed in Jul 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. I ask about job profile In last job in so many Company and about qualifications and interview time 2 hours 25minutes

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer is shortly should be communication way and Cleary so that's my answer one by one very clearly with no habitations my answer liston Vprotect company staff is very impressive so all topics are about job profile and qualifications

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. What's is your ambition

Interview Preparation Tips

Interview preparation tips for other job seekers - Go and attend the interview with fearless
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
No response
Round 1 - Aptitude Test 

Operating system data base management system

Round 2 - HR 

(2 Questions)

  • Q1. Tell me about yourself
  • Ans. 

    I am a dedicated and hardworking individual with a passion for learning and growth.

    • I have a background in finance and have worked in the industry for 5 years.

    • I am currently pursuing my MBA to further enhance my skills and knowledge.

    • I am a team player and enjoy collaborating with others to achieve common goals.

  • Answered by AI
  • Q2. Tell me about your project
  • Ans. 

    I led a team to develop a mobile app for tracking fitness goals and progress.

    • Responsible for project planning, design, and implementation

    • Collaborated with developers, designers, and stakeholders

    • Implemented features such as goal setting, workout tracking, and progress visualization

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - focus on core subject

I applied via Approached by Company and was interviewed in Mar 2022. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Translation English to Hindi and departmental training after that final interview

Interview Preparation Tips

Interview preparation tips for other job seekers - No any advice for job seekers.
Interview experience
4
Good
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Company Website and was interviewed in Aug 2023. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. How do you handle difficult situation
Round 2 - HR 

(1 Question)

  • Q1. What is your salary expectation

I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. Questions on linked list
  • Q2. Questions on resume
  • Q3. About my interests
  • Q4. My interest in symantec
  • Q5. Place to work

Interview Preparation Tips

College Name: IIT Madras

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. How you find loop in a linked list
  • Ans. 

    To find a loop in a linked list, we use Floyd's cycle-finding algorithm.

    • Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.

    • If there is a loop in the linked list, the two pointers will eventually meet.

    • To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.

    • The meeting point is the start of the loop.

  • Answered by AI
  • Q2. What is LRU, MRU and LFU
  • Ans. 

    LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.

    • LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.

    • MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.

    • LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...

  • Answered by AI
  • Q3. Camel banana problem

Interview Preparation Tips

Round: Test
Experience: coding test in hacker rank. can code in any language except in C and C++.
Duration: 1 hour
Total Questions: 2

Round: Technical Interview
Experience: In technical round the questions are on OS, basics of C(mainly in linked lists) and maths puzzle

They mostly see how you are approaching towards a problem.
It is first time that I heard the camel banana problem. So I struggled for some time and came up with a solution. He said he liked the approach but it can be optimized.

Round: HR Interview
Experience: It started with explain about yourselves. and then he asked to explain about one project with technical details. Later he asked me to explain binary search for a guy who don't know much of technical knowledge. He continued with why we only do 2 partitions why can we make it up to 3. Later he asked me what I liked most in my mobile phone. I said chatting apps. So he asked me that if I was hired as a developer to make a chatting app how will I do it.
Tips: way of thinking and way of approaching towards a problem.

Round: HR Interview
Experience: This round was focused mainly on whether I like to work in Bangalore or not. How I first heard about Symantec. how I will suit for the company. what are my future plans.

Skills: C, OS, Math Puzzles
College Name: IIT Madras

Skills evaluated in this interview

I was interviewed in Feb 2017.

Interview Preparation Tips

Round: Test
Experience: Very first, the interviewers and their employees gave presentation about their products and company. They were very cool and very positive to motivate candidates. After that they started Round 1 that is test based on aptitude and logical problem, also containing c programmin and operating system problems.
Tips: If you have studied basics very well, you will clear the round 1 very easily. Study C programming and Linux Operating System concepts.
Duration: 1 hour 30 minutes
Total Questions: 60

Round: Technical Interview
Experience: I am not specifying any question above because 2nd round i.e Technical Round 1 was continued to abt 1 and hour hours taken by 1 interviewer. If you give all answers confindently, obviously they all must be correct, you will be qualified to next techincal round.
Tips: Same as mentioned in round 1.
Study C programming & Operating System.

Round: Technical Interview
Experience: This was Technical Round 2. It was taken by 3 interviewers asking questions randomly from random subject. Also, one took rapid fire round for 20-25 questions. If you qualified this round, then you can assume that you are selected. This round was also continued more than 1 hour.
Tips: Study Networking concepts

Round: HR Interview
Experience: If you are called for HR interview, then you can assume that you already selected as employee for company. This is round is just for formality to tell you CTC and location and joining, etc.
One thing I would like to mention that in each round they will ask you to tell about yourself. So prepare that too. In HR round, they asked me some tricky puzzles to solve since I mentioned that I am very good in maths so.

College Name: Datta Meghe College of Engineering

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Return the valid combinations as an array of strings.

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q3. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.

    • Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.

    • Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.

    • Update the grid with the new state of oranges after each second.

    • Handle edge cases such as empty grid or no fresh oranges present.

    • Example...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.

  • Q1. 

    Queue Using Stacks Implementation

    Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.

    Explanation:

    Your task is to complete predefined functions t...

  • Ans. 

    Implement a queue using stacks following FIFO principle.

    • Use two stacks to simulate a queue.

    • For enQueue operation, push elements onto stack1.

    • For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.

    • For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.

    • For isEmpty operation, check if both stack1 and st...

  • Answered by AI
  • Q2. 

    Merge Intervals Problem Statement

    You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

    Your task is to merge all overlapping intervals a...

  • Ans. 

    Merge overlapping intervals and return sorted list of merged intervals by start time.

    • Sort the intervals based on start time.

    • Iterate through intervals and merge overlapping ones.

    • Return the merged intervals in sorted order.

  • Answered by AI
  • Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.

  • Q1. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. 

    The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.

    • Traverse the tree to find the longest path between two nodes.

    • Keep track of the maximum diameter found during traversal.

    • The diameter may not necessarily pass through the root node.

    • Consider both left and right subtrees while calculating the diameter.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1

  • Answered by AI
  • Q2. 

    Power of 2 Problem Statement

    Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.

    Input:

    The fir...
  • Ans. 

    The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.

    • Iterate through all possible permutations of the digits of the given integer.

    • Check if any of the permutations form a power of 2.

    • Return 1 if a valid permutation is found, else return 0.

  • Answered by AI
  • Q3. What are some advantages of using Object-Oriented Programming (OOP)?
  • Ans. 

    Advantages of OOP include code reusability, modularity, and easier maintenance.

    • Code reusability: Objects can be reused in different parts of the program, reducing redundancy.

    • Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.

    • Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.

    • Encapsulation: Data hiding and ab...

  • Answered by AI
  • Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
  • Ans. 

    Access specifiers define the level of access to class members in Object-Oriented Programming.

    • Access specifiers include public, private, protected, and default

    • Public members are accessible from outside the class

    • Private members are only accessible within the class

    • Protected members are accessible within the class and its subclasses

    • Default access is when no access specifier is specified

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

  • Q1. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Implement queue with the help of two stacks
  • Ans. 

    Queue can be implemented using two stacks by maintaining the order of elements in the stacks.

    • Create two stacks, let's call them stack1 and stack2

    • When an element is enqueued, push it to stack1

    • When an element is dequeued, pop all elements from stack1 and push them to stack2

    • Pop the top element from stack2 and return it as the dequeued element

    • If stack2 is empty, repeat step 3

    • To get the front element of the queue, peek the

  • Answered by AI
  • Q2. Iven a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number
  • Q3. What is left join. Give example. And Full outer join?
  • Ans. 

    Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.

    • Left join is used to combine two tables based on a common column.

    • In left join, all records from the left table are returned along with matching records from the right table.

    • If there is no match in the right table, NULL values are returned.

    • Example: SELECT * FROM table1 LEFT JOIN table...

  • Answered by AI
  • Q4. What is magic functions and autoloading in PHP?
  • Ans. 

    Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.

    • Magic functions are used to handle certain events in PHP, such as object creation or property access.

    • Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.

    • Magic functions can be used in conjunction with autoloading to dynamically load classes or handle

  • Answered by AI
  • Q5. Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6, 7, 20, 80, 100} ar3[] = {3, 4, 15, 20, 30, 70, 80, 120} Ou...
  • Ans. 

    Given three sorted arrays, find common elements.

    • Create three pointers to traverse each array

    • Compare the elements at the pointers and move the pointer of the smallest element

    • If all pointers point to the same element, add it to the result and move all pointers

    • Repeat until any pointer reaches the end of its array

  • Answered by AI
  • Q6. A puzzle. You will be given with a 3 Litre container & a 7 Litre Container. Measure exactly 5 Litres of water
  • Q7. Asked about one of my projects I mentioned in my resume?
  • Q8. Find if a number is a power of 2 or not?
  • Ans. 

    Check if a number is a power of 2 or not.

    • A power of 2 has only one bit set in its binary representation.

    • Use bitwise AND operator to check if the number is a power of 2.

    • If n is a power of 2, then n & (n-1) will be 0.

  • Answered by AI

Interview Preparation Tips

Skills: Data structures, PHP, Algortihm
College Name: na
Motivation: Overall it was a very good experience. They test you from every aspect. In the End I would like to say that Practo is one of the best companies to work for.

Skills evaluated in this interview

Tell us how to improve this page.

Interview Questions from Similar Companies

Deltax Interview Questions
2.7
 • 84 Interviews
Practo Interview Questions
3.2
 • 74 Interviews
Wayfair Interview Questions
3.8
 • 56 Interviews
Busibud Interview Questions
4.0
 • 42 Interviews
McAfee Interview Questions
4.0
 • 30 Interviews
View all
VProtect Store Incharge Salary
based on 4 salaries
₹5.6 L/yr - ₹6.5 L/yr
69% more than the average Store Incharge Salary in India
View more details

VProtect Store Incharge Reviews and Ratings

based on 1 review

1.0/5

Rating in categories

-

Skill development

-

Work-life balance

-

Salary

-

Job security

-

Company culture

-

Promotions

-

Work satisfaction

Explore 1 Review and Rating
Service Engineer
24 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Relationship Manager
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Support Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Security Consultant
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Consultant
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare VProtect with

QUICK HEAL TECHNOLOGIES

3.7
Compare

Seqrite

1.7
Compare

K7 Computing

4.1
Compare

eScan Antivirus

1.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview