Upload Button Icon Add office photos

Vivanta by Taj

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Vivanta by Taj Software Developer Interview Questions and Answers

Updated 22 Dec 2022

Vivanta by Taj Software Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. Software development lifecycle
  • Ans. 

    Software development lifecycle is a process of planning, designing, developing, testing, deploying, and maintaining software.

    • It involves various stages such as planning, analysis, design, implementation, testing, deployment, and maintenance.

    • Each stage has its own set of activities and deliverables.

    • It helps in ensuring that the software is developed efficiently and meets the requirements of the stakeholders.

    • It also help...

  • Answered by AI
  • Q2. App security & deployment in play store
  • Ans. 

    App security is crucial for deployment in Play Store. Follow best practices to ensure secure deployment.

    • Use HTTPS for all network communication

    • Implement secure authentication and authorization mechanisms

    • Regularly update and patch the app to fix security vulnerabilities

    • Use code obfuscation and encryption to protect against reverse engineering

    • Conduct regular security audits and penetration testing

    • Follow Google Play Store

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare from basic
Prepare from your resume
Prepare from the projects you have worked

Skills evaluated in this interview

Interview questions from similar companies

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

  • Q1. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

  • Q1. 

    Triangle Formation Using Array Elements

    Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...

  • Ans. 

    Determine if it is possible to form a non-degenerate triangle using array elements as sides.

    • Check if the sum of any two sides is greater than the third side for all combinations of sides.

    • If the above condition is met for any combination, return true; otherwise, return false.

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Elements

    You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...

  • Ans. 

    Find the maximum sum of non-adjacent elements in an array.

    • Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

    • At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

    • Iterate through the array and update the maximum sum accordingly.

    • Example: F...

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

  • Q1. 

    Sum Tree Conversion

    Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...

  • Ans. 

    Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.

    • Traverse the tree in a bottom-up manner, starting from the leaf nodes.

    • For each node, update its value to the sum of its children's values.

    • Set leaf nodes to 0.

    • Return the preorder traversal of the modified tree.

  • Answered by AI
  • Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
  • Ans. 

    Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.

    • Types of indexes: B-tree, Hash, Bitmap, etc.

    • Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

    • Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

    • Examples: Creating an index on a column in a table to speed up search queries

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute of Technology Delhi (New Campus). Eligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, OS, DBMS, Algorithms, Networking, Coding, OOPTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your coding, algorithms. This is one most important thing for OYO. Practice Graph, tree, DP, greedy, recursion, data structures questions.
Tip 2 : OS, DBMS concepts will give you an edge over others. Like serialisation, index, deadlock, semaphore
Tip 3 : Only mention those projects in your resume which you are very clear about. They don't ask for detailed explanation, just an overall idea about your projects will increase your chances

Application resume tips for other job seekers

Tip 1 : Mention college projects wisely. No need to mention fancy projects. Any project that you can describe to the interviewer will be a best solution
Tip 2 : Neat & clean resume with your skills, technical stacks that you mastered. That's all. They don't require you to be very active in extra-curricular activities, and these things will not give you any advantage.
Tip 3 : Keep it of single page

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

DSA , medium n easy leetcode question was there

Round 2 - One-on-one 

(2 Questions)

  • Q1. Low level design
  • Q2. DSA and computer fundamental
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(1 Question)

  • Q1. Dictionary Sort , DFS, BFS
Round 3 - Technical 

(1 Question)

  • Q1. Reverse a LinkedList from m to n
  • Ans. 

    Reverse a LinkedList from m to n

    • Traverse the list to m-1th node

    • Reverse the nodes from m to n

    • Connect the reversed list to the original list

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA as the rounds are only technical. No projects were asked

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Some medium Graph problems from leetcode
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Double-check your resume for any spelling mistakes. The recruiter may consider spelling mistakes as careless behavior or poor communication skills.
View all Resume tips
Round 2 - Coding Test 

3 coding questions and platform was hackerrank

Round 3 - One-on-one 

(1 Question)

  • Q1. Two medium graph questions from leetcode
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Aug 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Do not use an unprofessional email address such as cool_boy@email.com. It shows a lack of professionalism by the candidate.
View all Resume tips
Round 2 - Technical 

(1 Question)

  • Q1. Operating system questions
Round 3 - Coding Test 

Linked list standard questions

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Easy

This round was conducted on the HackerEarth platform. It had 2 sections and candidates were given a time of 1 hour 30 minutes. 

Programming MCQs — 18 MCQs (each of 2 marks)
Questions were a little tricky. it tested upon one’s programming fundamentals. It had C/C++ output questions, pseudocode questions, Operating systems, and SQL queries.
Coding — 2 ( one contains 75 marks and the other contains 100 marks )

Our scores of the first 2 sections weren’t revealed. My MCQs went really well. I solved 2 coding questions in the coding section. Only 15 students got selected for the interview round, and I was one of them.

  • Q1. 

    Count Ways to Complete Journey in Triangular Pyramid

    Given a triangular pyramid with vertices marked as ‘O’, ‘X’, ‘Y’, and ‘Z’, and an integer 'N', you need to calculate the number of ways Bob can start a...

  • Ans. 

    Calculate the number of ways to complete a journey in a triangular pyramid starting and ending at a specific vertex after taking a certain number of steps.

    • Use dynamic programming to calculate the number of ways to return to the starting vertex after 'N' steps.

    • Consider the possible movements from each vertex to adjacent vertices.

    • Keep track of the number of ways to reach each vertex after each step.

    • Return the total numbe...

  • Answered by AI
  • Q2. 

    Maximum Profit Problem Statement

    Mukesh is evaluating the maximum profit from his business over a series of days. Given a list of profits over 'N' days, Mukesh wants to determine the highest profit achiev...

  • Ans. 

    The task is to find the maximum profit achievable over any consecutive days within a specified range {‘A’, ‘B’}.

    • Iterate through the profit array and calculate the cumulative sum for each possible consecutive days within the range {‘A’, ‘B’}.

    • Keep track of the maximum profit obtained during the iteration.

    • Return the maximum profit as the final result.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was scheduled for 1 hour and the panel had 1 interviewer. Being a virtual interview, the first challenge that I faced was that the interviewer was not audible. I suggest you not panic in such a situation and use the chatbox feature (or contact HR if need be) to figure out something that works for you and the panel. We later connected over voice call (over the phone) with our videos ON (over a laptop) and continued with the interview.

The interview was very calm and helpful. I was able to solve all questions and I explained different approaches to solve the questions. Once he was convinced of my solution, he asked me to write the code on my own IDE.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use a min heap to store the larger half of the numbers and a max heap to store the smaller half

    • Keep the sizes of the two heaps balanced to efficiently calculate the median

    • If the total number of elements is odd, the median will be the top element of the max heap

    • If the total number of elements is even, the median will be the average of the top e

  • Answered by AI
  • Q2. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI
  • Q3. 

    Count Pairs with Given Sum

    Given an integer array/list arr and an integer 'Sum', determine the total number of unique pairs in the array whose elements sum up to the given 'Sum'.

    Input:

    The first line c...
  • Ans. 

    Count the total number of unique pairs in an array whose elements sum up to a given value.

    • Use a hashmap to store the frequency of each element in the array.

    • Iterate through the array and for each element, check if (Sum - current element) exists in the hashmap.

    • Increment the count of pairs if the complement exists in the hashmap.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

This was a technical + HR round. First, he asked me to introduce myself. This round was also based on your knowledge of DSA. I was asked 2 coding questions. Then he asked a couple of questions from OS and DBMS which were pretty easy. At last, we ended the interview on a good note. Then he asked me questions about myself.
Why I want to join OYO rooms. 
What are my hobbies?
Goals in the next five years.

  • Q1. 

    Zig-Zag String Problem Statement

    Given a string 'STR' of length 'N' and an integer 'M' representing the number of rows in the zig-zag pattern, your task is to return the string formed by concatenating all...

  • Ans. 

    Given a string and number of rows, return the concatenated string formed by arranging the input string in a zig-zag pattern over the specified number of rows.

    • Iterate through the string and distribute characters in zig-zag pattern over 'M' rows

    • Keep track of the direction of movement (up or down) while distributing characters

    • Concatenate characters row-wise to get the final zig-zag pattern string

  • Answered by AI
  • Q2. 

    Ways To Make Coin Change

    Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...

  • Ans. 

    The task is to find the total number of ways to make change for a specified value using given denominations.

    • Use dynamic programming to solve this problem efficiently.

    • Create a 2D array to store the number of ways to make change for each value using different denominations.

    • Iterate through the denominations and update the array accordingly.

    • The final answer will be stored in the last cell of the array.

    • Consider edge cases l

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaOYO interview preparation:Topics to prepare for the interview - Data Structures, Computer Networking, C++, OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 12 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice coding questions as much as you can.
Tip 2 : Your communication skills must be good.
 

Application resume tips for other job seekers

Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't write any false information on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

  • Q1. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from source to destination.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid revisiting them.

    • Explore all possible directions (up, down, left, right) from each cell.

    • Add the current direction to the path and recursively explore further.

    • When reaching the destination, add the path to the list of valid paths.

  • Answered by AI
  • Q2. 

    Minimum Cost to Destination

    You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...

  • Ans. 

    Find the minimum cost to reach a destination in a matrix with blocked cells.

    • Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

    • Keep track of the cost incurred at each cell and update it as you move through the matrix.

    • Return the minimum cost to reach the destination or -1 if it is unreachable.

    • Consider edge cases such as when the starting point is the destina

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteria6.5 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structure, OS, DBMS, Java, Problem Solving, OOPSTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Practice data structure based questions.
Tip 2 : OOPS is very important.
Tip 3 : Prepare OS and DBMS for mcq.

Application resume tips for other job seekers

Tip 1 : Mention atleast 2 projects on resume.
Tip 2 : Keep it short in length.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

  • Q1. 

    Rotate Matrix Right K Times

    You are given a matrix MAT of size 'N' * 'M', where 'N' is the number of rows and 'M' is the number of columns, along with a positive integer 'K'. Your task is to rotate the ma...

  • Ans. 

    Rotate a matrix to the right 'K' times by shifting each column to the right 'K' times.

    • Iterate 'K' times to perform right rotation on the matrix

    • Shift each column to the right by one position in each rotation

    • Handle wrapping around the matrix when shifting columns

    • Return the matrix elements row-wise after 'K' rotations

  • Answered by AI
  • Q2. 

    Word Search Problem Statement

    Given a two-dimensional grid of size N x M consisting of upper case characters and a string 'WORD', determine how many times the 'WORD' appears in the grid.

    The 'WORD' can b...

  • Ans. 

    Count how many times a given word appears in a 2D grid by moving in any of the eight possible directions.

    • Iterate through each cell in the grid and check if the word can be formed starting from that cell in any of the eight directions.

    • Use recursion to explore all possible paths from a starting cell to form the word.

    • Keep track of visited cells to avoid revisiting the same cell in the same path.

    • Return the count of how man

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

Interview started with an introduction and walk through the resume for first 5 minutes. After that, interview asked few coding questions.

  • Q1. 

    Problem Statement: Largest Island

    You are provided with a non-empty grid consisting of only 0s and 1s. Your task is to determine the maximum area of an island within the given grid.

    An island consists of a...

  • Ans. 

    Find the maximum area of an island in a grid of 0s and 1s.

    • Iterate through the grid and perform depth-first search (DFS) to find connected 1s.

    • Keep track of the area of each island found and return the maximum area.

    • Consider all four directions (horizontal, vertical, and diagonal) while exploring the island.

    • Handle edge cases like grid boundaries and already visited cells during DFS.

    • If no island is present, return 0 as the

  • Answered by AI
  • Q2. 

    Pythagorean Triplet Problem

    Determine if there exists a Pythagorean triplet within a given array of integers. A Pythagorean triplet consists of three numbers, x, y, and z, such that x^2 + y^2 = z^2.

    Expl...

  • Ans. 

    Check if there exists a Pythagorean triplet in a given array of integers.

    • Iterate through all possible triplets in the array and check if they form a Pythagorean triplet.

    • Use a nested loop to generate all possible combinations of three numbers from the array.

    • Check if the sum of squares of two numbers is equal to the square of the third number.

  • Answered by AI
  • Q3. 

    Top View of Binary Tree Problem Statement

    Given a Binary Tree of integers, you are tasked with finding the top view of the binary tree. The top view is the set of nodes visible when the tree is viewed fro...

  • Ans. 

    Find the top view of a Binary Tree by returning a list of visible nodes when viewed from the top.

    • Traverse the Binary Tree in level order and keep track of the horizontal distance of each node from the root.

    • Use a map to store the nodes at each horizontal distance, and only keep the topmost node for each horizontal distance.

    • Return the values of the topmost nodes in the map as the top view of the Binary Tree.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was focused on DSA along with short discussion on computer science fundamentals. For coding problems, I was asked to code the first problem only. For others, had to discuss the approach only. For computer science fundamentals, discussion on OOPS. Differences between process and threads were discussed.

  • Q1. 

    Fixing a Swapped Binary Search Tree

    Given a Binary Search Tree (BST) where two nodes have been swapped by mistake, your task is to restore or fix the BST without changing its structure.

    Input:

    The first...
  • Ans. 

    Restore a Binary Search Tree by fixing two swapped nodes without changing its structure.

    • Identify the two nodes that are swapped by mistake in the BST.

    • Swap the values of the two identified nodes to restore the BST.

    • Perform an in-order traversal of the BST to verify the correct restoration.

    • Ensure no extra space other than the recursion stack is used for the solution.

  • Answered by AI
  • Q2. 

    Implement Stack with Linked List

    Your task is to implement a Stack data structure using a Singly Linked List.

    Explanation:

    Create a class named Stack which supports the following operations, each in O(1...

  • Ans. 

    Implement a Stack data structure using a Singly Linked List with operations like getSize, isEmpty, push, pop, and getTop in O(1) time.

    • Create a class named Stack with methods for getSize, isEmpty, push, pop, and getTop.

    • Use a Singly Linked List to store the elements of the stack.

    • Ensure that each operation runs in constant time O(1).

    • Handle edge cases like empty stack appropriately.

    • Test the implementation with sample queri

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from TIET - Thapar Institute of Engineering And Technology. I applied for the job as SDE - 1 in GurgaonEligibility criteria7 CGPAOYO interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, OS, DBMSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Focus on DSA as you will be judged mostly on that for entry-level software engineer profiles.
Tip 2 : Don't mug up the solution as you might not be able to recall the approach or you might face new question that you haven't seen earlier.
Tip 3 : Practice as much as possible from platforms like InterviewBit, LeetCode.

Application resume tips for other job seekers

Tip 1 : Try not to mention those things about which you are not comfortable. 
Tip 2 : Having one or two good projects in resume helps.
Tip 3 : Mention good competitive programming ranks (if any)
Tip 4 : Use overleaf.com for making a resume using Latex.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Vivanta by Taj Interview FAQs

How many rounds are there in Vivanta by Taj Software Developer interview?
Vivanta by Taj interview process usually has 2 rounds. The most common rounds in the Vivanta by Taj interview process are Resume Shortlist and Technical.
What are the top questions asked in Vivanta by Taj Software Developer interview?

Some of the top questions asked at the Vivanta by Taj Software Developer interview -

  1. app security & deployment in play st...read more
  2. software development lifecy...read more

Recently Viewed

INTERVIEWS

Oyo Rooms

No Interviews

SALARIES

Warner Bros. Discovery

INTERVIEWS

Deloitte

No Interviews

INTERVIEWS

EY Global Delivery Services ( EY GDS)

No Interviews

INTERVIEWS

Wipro

No Interviews

INTERVIEWS

CloudThat Technologies Private Limited

No Interviews

INTERVIEWS

Cogoport

No Interviews

LIST OF COMPANIES

Siemens Building Technologies

Overview

INTERVIEWS

Treebo Hotels

No Interviews

INTERVIEWS

Warner Bros. Discovery

No Interviews

Tell us how to improve this page.

Vivanta by Taj Software Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Oyo Rooms Interview Questions
3.3
 • 217 Interviews
ITC Hotels Interview Questions
4.1
 • 85 Interviews
Radisson Hotels Interview Questions
4.1
 • 73 Interviews
Burger King Interview Questions
3.8
 • 68 Interviews
Hyatt Regency Interview Questions
4.1
 • 43 Interviews
Pizza Hut Interview Questions
3.9
 • 41 Interviews
View all
Team Member
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Guest Service Associate
34 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Front Office Associate
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Restaurant Manager
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Commis Chef
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Vivanta by Taj with

Oberoi Group of Hotels

4.1
Compare

ITC Hotels

4.1
Compare

Taj Hotels Resorts and Palaces

4.2
Compare

THE LEELA PALACES HOTELS & RESORTS

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