Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Satguru Travels and Tour Services Team. If you also belong to the team, you can get access from here

Satguru Travels and Tour Services Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Satguru Travels and Tour Services Assistant Manager Internal Audit Interview Questions and Answers

Updated 1 Mar 2025

Satguru Travels and Tour Services Assistant Manager Internal Audit Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Mar 2024.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Audit and tax related questions
  • Q2. Genral question related to audit and tax
Round 2 - One-on-one 

(2 Questions)

  • Q1. Behavioral question
  • Q2. Asked about previous company

Interview questions from similar companies

I applied via Referral

Interview Questionnaire 

1 Question

  • Q1. It's about Family & Academic background

Interview Preparation Tips

Interview preparation tips for other job seekers - It's an good company

Interview Questionnaire 

17 Questions

  • Q1. Find if a string is substring of other string
  • Ans. 

    The function checks if a string is a substring of another string.

    • Use the built-in string methods like 'indexOf' or 'includes' to check for substring.

    • If the language supports regular expressions, you can also use them to find substrings.

    • Consider the case sensitivity of the strings when comparing.

  • Answered by AI
  • Q2. Write a code to multiply two matrices of dimension M*N and N*K
  • Ans. 

    Code to multiply two matrices of dimension M*N and N*K.

    • Create a result matrix of dimension M*K.

    • Iterate through each row of the first matrix.

    • For each row, iterate through each column of the second matrix.

    • For each element in the row of the first matrix, multiply it with the corresponding element in the column of the second matrix.

    • Sum up the products and store the result in the corresponding position of the result matrix.

    • ...

  • Answered by AI
  • Q3. Write a Sql to perform Matrix Multiplication.Two tables has three columns row,col and value
  • Ans. 

    SQL query to perform matrix multiplication using two tables with row, col, and value columns.

    • Use JOIN operation to combine the two tables based on matching row and col values.

    • Use GROUP BY clause to group the result by row and col values.

    • Use SUM function to calculate the dot product of corresponding row and col values.

    • Use INSERT INTO statement to insert the result into a new table.

  • Answered by AI
  • Q4. What is prototype in javascript?
  • Ans. 

    Prototype in JavaScript is an object that is associated with every function and object by default.

    • Prototype is used to add properties and methods to an object.

    • It allows objects to inherit properties and methods from other objects.

    • Modifying the prototype of a function affects all instances of that function.

    • Prototypes can be used to create new objects based on existing objects.

    • The prototype chain allows for property and

  • Answered by AI
  • Q5. How do we write classes in javascript?
  • Ans. 

    Classes in JavaScript are written using the class keyword.

    • Use the class keyword followed by the class name to define a class.

    • Use the constructor method to initialize class properties.

    • Add methods to the class using the class prototype.

    • Use the new keyword to create an instance of the class.

  • Answered by AI
  • Q6. There is a ladder of N steps.We can either take 1 step or 2 steps.In how many different ways one can climb the ladder?
  • Ans. 

    The number of different ways to climb a ladder of N steps by taking 1 or 2 steps at a time.

    • This is a classic problem that can be solved using dynamic programming.

    • The number of ways to climb N steps is equal to the sum of the number of ways to climb N-1 steps and N-2 steps.

    • The base cases are when N is 0 or 1, where there is only 1 way to climb the ladder.

    • For example, for N=4, there are 5 different ways: [1, 1, 1, 1], [1

  • Answered by AI
  • Q7. Print a square matrix in spiral order
  • Ans. 

    Print a square matrix in spiral order

    • Start by defining the boundaries of the matrix

    • Iterate through the matrix in a spiral pattern, printing each element

    • Adjust the boundaries after each iteration to move inward

    • Repeat until all elements are printed

  • Answered by AI
  • Q8. Given a table with 3 columns StudentName,Subject and Marks.Write a sql to retrieve second highest Marks Obtained for each student
  • Ans. 

    Retrieve the second highest marks obtained by each student from a table with student name, subject, and marks.

    • Use the RANK() function to assign a rank to each row based on the marks in descending order.

    • Filter the result to only include rows with rank 2 for each student.

    • Group the result by student name to get the second highest marks for each student.

  • Answered by AI
  • Q9. Given a Website with header,footer,side ads(Google ads,Internal ads).How will you extract only useful data from the page
  • Q10. Difference between .live() and .delegate() in jquery
  • Ans. 

    The .live() method attaches an event handler to the current and future elements, while .delegate() attaches an event handler to a parent element.

    • The .live() method is deprecated in newer versions of jQuery.

    • The .delegate() method is preferred over .live() for performance reasons.

    • Both methods are used to handle events for dynamically added elements.

    • Example: $(document).live('click', 'button', function() { ... });

    • Example:...

  • Answered by AI
  • Q11. What is chaining in jquery?
  • Ans. 

    Chaining in jQuery allows multiple methods to be called on a single element in a single line of code.

    • Chaining simplifies code and improves readability.

    • Each method in the chain operates on the result of the previous method.

    • The chain ends with a method that does not return a jQuery object.

    • Example: $('div').addClass('highlight').fadeOut();

  • Answered by AI
  • Q12. What is callback function?
  • Ans. 

    A callback function is a function that is passed as an argument to another function and is executed later.

    • Callback functions are commonly used in event-driven programming.

    • They allow asynchronous execution of code.

    • Callback functions can be used to handle responses from APIs or user interactions.

    • They can be anonymous functions or named functions.

    • Example: setTimeout(function() { console.log('Hello!'); }, 1000);

  • Answered by AI
  • Q13. What is .bind() function in jquery?
  • Ans. 

    The .bind() function in jQuery is used to attach an event handler function to one or more elements.

    • It allows you to specify the event type and the function to be executed when the event occurs.

    • The .bind() function can be used to bind multiple events to the same element.

    • It can also be used to pass additional data to the event handler function.

    • The .bind() function is deprecated in jQuery version 3.0 and above. It is reco

  • Answered by AI
  • Q14. Find the angle between hour handle and minute handle in a clock
  • Ans. 

    The angle between the hour and minute hands of a clock can be calculated using a formula.

    • The hour hand moves 30 degrees per hour and 0.5 degrees per minute.

    • The minute hand moves 6 degrees per minute.

    • Calculate the angle between the two hands using the formula: |30H - 11M/2|, where H is the hour and M is the minute.

  • Answered by AI
  • Q15. Is it possible to create slideshow without using javascript
  • Ans. 

    Yes, it is possible to create a slideshow without using JavaScript.

    • Use CSS animations and transitions to create the slideshow.

    • Use HTML and CSS to structure and style the slideshow.

    • Utilize keyframe animations to create the slide transitions.

    • Use radio buttons or checkboxes to control the slideshow navigation.

    • Apply the :target pseudo-class to create a simple slideshow without JavaScript.

  • Answered by AI
  • Q16. Questions about my current project and academic project
  • Q17. Given two points A and B with distance between them lets say D.there are N men who want to go from point A to point B.All men walk with same speed.They also have one scooter with them which has speed grea...
  • Ans. 

    The men can take turns riding the scooter, allowing them to reach point B faster.

    • The men can form a queue and take turns riding the scooter.

    • The person riding the scooter can drop it off at a certain point and the next person can pick it up.

    • The scooter can be passed along the line of men until everyone reaches point B.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Javascript
College Name: na

Skills evaluated in this interview

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Questions on aptitude, English, logical reasoning, C/C++ and 5 coding ques. (only pseudo code).

  • Q1. 

    Minimum Jumps Problem Statement

    Bob and his wife are in the famous 'Arcade' mall in the city of Berland. This mall has a unique way of moving between shops using trampolines. Each shop is laid out in a st...

  • Ans. 

    Find the minimum number of trampoline jumps Bob needs to make to reach the final shop, or return -1 if it's impossible.

    • Use Breadth First Search (BFS) algorithm to find the minimum number of jumps required.

    • Keep track of the visited shops to avoid revisiting them.

    • If a shop has an Arr value of 0, it is impossible to reach the final shop.

    • Return -1 if the final shop cannot be reached.

  • Answered by AI
  • Q2. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd", X = "bd"
    Outpu...
  • Ans. 

    Find the smallest substring in S that contains all characters in X.

    • Use a sliding window approach to find the smallest window in S containing all characters of X.

    • Maintain a hashmap to keep track of characters in X and their frequencies in the current window.

    • Slide the window to the right, updating the hashmap and shrinking the window until all characters in X are present.

    • Return the smallest window found.

    • Example: S = 'abd

  • Answered by AI
  • Q3. 

    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 start to destination.

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

    • Keep track of visited cells to avoid revisiting them.

    • Return paths in alphabetical order as a list of strings.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Questions based on OOPS were asked in this round.

  • Q1. What is a virtual function?
  • Ans. 

    A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.

    • Virtual functions allow for dynamic polymorphism in C++

    • They are used in inheritance to achieve runtime polymorphism

    • Virtual functions are declared in a base class and can be overridden in derived classes

    • They are called based on the type of object bei...

  • Answered by AI
  • Q2. What are the types of polymorphism in Object-Oriented Programming?
  • Ans. 

    Types of polymorphism in OOP include compile-time (method overloading) and runtime (method overriding) polymorphism.

    • Compile-time polymorphism is achieved through method overloading, where multiple methods have the same name but different parameters.

    • Runtime polymorphism is achieved through method overriding, where a subclass provides a specific implementation of a method that is already defined in its superclass.

    • Polymor...

  • Answered by AI
  • Q3. What is the difference between deep copy and shallow copy?
  • Ans. 

    Deep copy creates a new object and recursively copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

    • Deep copy creates a new object and copies all nested objects, while shallow copy creates a new object and copies only the references to nested objects.

    • In deep copy, changes made to the original object do not affect the copied object, while in shallow copy, ch...

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMakeMyTrip interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 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 Preparation Tips

Skill Tips: To crack Yatra interview Java, Data Structures and Algorithms concepts should be clear.
Skills: Java, Data structures, Algorithm
College Name: na

Interview Preparation Tips

Round: Test
Experience: 1. Rotate a matrix by 90 degrees clockwise.( He asked me have you heard of question.I said Yes.Then he asked me to code)2. Find vertical sum of nodes present in same vertical line in binary tree. ( He again asked me have you heard of question. I have heard it but didn’t remember the approach. It took some time and then I started telling my approach.He aasked me to write code and question regarding get sums from left to right , for which I made use of linked hashmap)
Overall It was very cool for me
Total Questions: 2

Round: Test
Experience: 1.Reverse K blocks of nodes in linked list.There are two interviewers this time, probably, guy was senior he was asking me question.He was very particular in coding. Checked every edge case.and asked me evrything.Initially I told the approach and then started coding.2.Find min in stack in O(1)Pretty straightforward written code.Again he checked all edge cases with my code.3. Then asked about counting sort and its code.4. And a simple question on array sorting.

Round: HR Interview
Experience: I thought this was last round as they have said like.She asked me about my strengths and challenges I faced.How I overcame through it1.Basic question on oops concepts.(runtime polymorphism).
2.Design tables for getting all employees under manager. I screwed it little bit.But some how I got answer which I was not satisfied as well.I was expecting result either yes/no.But they called me for another round of interview may be because of my expected salary which was high compared to my previous.

Round: Technical Interview
Experience: 1.Given “aaabbbccc” it should return “a3b3c3″ in place. Initially I explained brute force approach then he said array has 2n space.I was able to remember approach for quicksort and started explaining after which I grew confident on it.He was satisfied.Questions on time complexity of algo and space complexity discussions.2.Again a question on OOPs.This time I was completely wrong in answering it.I thought interview with yatra was closing for me.He was not satisified much with this.Luckily, there was another round with manager.

Round: Other Interview
Experience: 1.He asked me to find words which are having particular pattern.Then I said it was KMP algo. Can I explain it ?? I started explaining approach, may be he was busy with something, he asked me to write pseudo code.He left the room for 15 mins then he came back I had almost completed the code, which he was satisified.Some basic questions on spring ( my previous work was related to it). Then my expected salary and my position If I got selected in yatra were discussed.

College Name: NA

I applied via Monster and was interviewed in Dec 2017. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. They are asked question tell about yourself in general questions.

Interview Preparation Tips

General Tips: I attend in interview last candidate so just 5 minits faced HR interview.
Skills: Analytical Skills
Duration: 1-4 weeks

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 minutes
Round difficulty - Easy

Hello everyone! Expedia came to our campus for full time hiring of final year students. They had shortlisted candidates for the interviews by taking an online test comprised of four sections (Quantitative, C, Logical and English). Every section had a timer attached to it, so you need to think and answer quickly. Although, the questions were easy but cutoff was quite high. This round was followed by a coding round, comprised of two questions.

  • Q1. 

    Problem: Deletion in Circular Linked List

    You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.

    Your task is to implement a function that locates the spec...

  • Ans. 

    Implement a function to delete a specific key from a Circular Linked List of integers.

    • Traverse the Circular Linked List to find the key to be deleted.

    • Adjust the pointers to remove the node containing the key.

    • Handle the case where the Circular Linked List becomes empty after deletion.

    • Return -1 if the Circular Linked List is empty after deletion.

  • Answered by AI
  • Q2. 

    Page Faults Identification Problem Statement

    In computing, a page fault occurs when a process accesses a memory page that is not currently mapped by the memory management unit. To handle new pages being b...

  • Ans. 

    The problem involves determining the number of page faults using the Least Recently Used (LRU) replacement algorithm.

    • Page faults occur when a process accesses a memory page not currently mapped by the memory management unit.

    • Page replacement algorithm like LRU is used to decide which existing page should be replaced.

    • The goal is to calculate the number of page faults based on the given input sequences and memory capacity...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The man who was taking my first round was my alumni. He started-off by asking my introduction and then gave me 2 programming questions to code. He then navigated on to my Codechef profile and asked a question that I did in the June 14 Long Contest. I explained him and he was satisfied. 
Tips : You don’t have to answer the stuffs quickly, rather you need to develop some test cases and have some discussion regarding the structure of the problem, and then answer.

  • Q1. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

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

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, it indicates the presence of a cycle in the linked list.

    • Use Floyd's Cycle Detection Algorithm for efficient detection of cycles in a linked list.

  • Answered by AI
  • Q2. 

    Closest Sum Problem Statement

    Given an array of integers ARR of size N and an integer target, find three integers in ARR such that their sum is closest to the target. If there are two closest sums, return...

  • Ans. 

    Find three integers in an array whose sum is closest to a given target, return the smallest sum if there are two closest sums.

    • Iterate through all possible triplets in the array to find the sum closest to the target.

    • Keep track of the closest sum found so far and update it if a closer sum is found.

    • Return the closest sum at the end of the iteration.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 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 Preparation Tips

Round: Technical Interview
Experience: The interviewers were professional in their approach and ensured that I was comfortable through the whole process.

General Tips: Interview process was fairly fast but a bit heavy. There were 4 technical interviews and 1 HR. It turns out to be not too difficult as some questions are duplicated in all the interviews.
Skills: Algorithm, data structure
College Name: na

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Easy

This was the online round held at university. All students who met the eligibility criteria were called for the online test on hackerrank.

  • Q1. 

    Anagram Difference Problem Statement

    Given two strings, 'STR1' and 'STR2', of equal lengths, determine the minimum number of manipulations required to make the two strings anagrams of each other.

    Input:

    ...
  • Ans. 

    The problem involves finding the minimum number of manipulations required to make two strings anagrams of each other.

    • Create frequency maps for both strings

    • Find the absolute difference in frequencies of each character

    • Sum up the absolute differences to get the total manipulations needed

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

This round was technical round and the interview started with formal introduction and general questions.
After that We had a discussion on LRU Cache.
Followed by coding and set of data structure questions.

  • Q1. 

    Gas Tank Problem Statement

    You have a car with a gas tank of infinite capacity. There are 'N' gas stations located along a circular route, numbered from 0 to N-1. You begin your journey with an empty tank...

  • Ans. 

    Find the starting gas station index to complete a circular route with gas and cost arrays.

    • Iterate through gas stations, keeping track of total gas and total cost from each station

    • If total gas is greater than or equal to total cost, update the starting station index

    • Return the starting station index if a valid one is found, else return -1

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This Round was DS and Algo round and it started with formal introduction, followed by 2 problems. We first dicussed the approach the time complexity and proper code covering all cases.

  • Q1. 

    Boundary Traversal of Binary Tree

    Given a binary tree of integers, your task is to print the boundary nodes of this binary tree in an anti-clockwise direction starting from the root node.

    Input:

    The fir...
  • Ans. 

    Print the boundary nodes of a binary tree in an anti-clockwise direction starting from the root node.

    • Traverse the left boundary nodes from the root to the leftmost leaf node.

    • Traverse the leaf nodes from left to right.

    • Traverse the right boundary nodes from the rightmost leaf node to the root.

  • Answered by AI
  • Q2. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your objective is to find two non-overlapping subarrays (contiguous) of length K each, such that their sum...

  • Ans. 

    Find two non-overlapping subarrays of length K with maximum sum in an integer array.

    • Iterate through the array to find all possible subarrays of length K.

    • Calculate the sum of each pair of non-overlapping subarrays of length K.

    • Keep track of the maximum sum obtained from the pairs of subarrays.

  • Answered by AI
Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was the Final Interview and it started with formal introduction and general HR questions. Then We discussed about the projects and the things written in my resume. The interviewer was very frank and this round was very interactive. He asked me about my college, my future plans, teachers, various subjects, why Expedia and questions like that.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in DelhiEligibility criteriaAbove 7.5 CGPA, Candidates from computer related branch only.Expedia Group interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Designs, Operating Systems, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Be solid with the basics of Ds & Algorithms. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer

Application resume tips for other job seekers

Tip 1: Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2: Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3: It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

Satguru Travels and Tour Services Interview FAQs

How many rounds are there in Satguru Travels and Tour Services Assistant Manager Internal Audit interview?
Satguru Travels and Tour Services interview process usually has 2 rounds. The most common rounds in the Satguru Travels and Tour Services interview process are One-on-one Round.
What are the top questions asked in Satguru Travels and Tour Services Assistant Manager Internal Audit interview?

Some of the top questions asked at the Satguru Travels and Tour Services Assistant Manager Internal Audit interview -

  1. Genral question related to audit and ...read more
  2. Audit and tax related questi...read more
  3. Behavioral quest...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

CAMPUS PLACEMENT

Maharaja Surajmal Institute of Technology, Delhi

CAMPUS PLACEMENT

Amrita Vishwa Vidyapeetham, Amritapuri Campus

CAMPUS PLACEMENT

Pimpri Chinchwad College of Engineering, Pimpri

INTERVIEWS

S&P Global

No Interviews

INTERVIEWS

Travel Boutique Online

No Interviews

CAMPUS PLACEMENT

All India Institute of Management Studies

INTERVIEWS

Elektrobit India

No Interviews

INTERVIEWS

S&P Global

No Interviews

Tell us how to improve this page.

Satguru Travels and Tour Services Assistant Manager Internal Audit Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

MakeMyTrip Interview Questions
3.7
 • 122 Interviews
BCD Travel Interview Questions
4.3
 • 111 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
Thomas Cook Interview Questions
3.7
 • 44 Interviews
Yatra Interview Questions
3.4
 • 31 Interviews
Pickyourtrail Interview Questions
3.6
 • 20 Interviews
Cleartrip Interview Questions
3.4
 • 18 Interviews
StayVista Interview Questions
2.9
 • 13 Interviews
View all
20% less than the average Assistant Manager Internal Audit Salary in India
View more details

Satguru Travels and Tour Services Assistant Manager Internal Audit Reviews and Ratings

based on 1 review

3.0/5

Rating in categories

3.0

Skill development

4.0

Work-life balance

3.0

Salary

3.0

Job security

3.0

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 1 Review and Rating
Travel Consultant
98 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Executive Accountant
49 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Travel Consultant
45 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Marketing Manager
30 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Satguru Travels and Tour Services with

Cox & Kings

3.7
Compare

Thomas Cook

3.7
Compare

MakeMyTrip

3.7
Compare

Yatra

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