AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Pilgrim Interview Questions and Answers
Pilgrim Interview Experiences
2 interviews found
Anonymous
Selected
I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.
(2 Questions)
- Q1. Creative test on laptop
- Q2. Packaging design test
(3 Questions)
- Q1. How many years of experience
- Q2. What is your qualifications
- Q3. What is the notice period
Interview Preparation Tips
Are you good in technical test then you are selected
Graphic Designer Interview Questions asked at other Companies
Kedar Koyalkar
Selected
I applied via Referral and was interviewed in Mar 2023. There were 3 interview rounds.
(3 Questions)
- Q1. Past experience of Cosmetic industry
- Q2. Experience with startup
- Q3. Why u want to join startup
(3 Questions)
- Q1. How you can develop unassisted channel
- Ans.
Developing an unassisted channel involves creating strategies to enable customers to make purchases without direct sales assistance.
Identify target customers who prefer self-service options
Provide user-friendly online platforms for easy purchasing
Offer detailed product information and FAQs for customer support
Implement automated processes for order fulfillment
Monitor and analyze customer behavior to optimize the unassi
- Q2. Team handling size and experience
- Q3. Why you are leaving well established company to join emerging one
Interview Preparation Tips
- Color cosmetics
- skin care
- Assisted and un assisted channel
- Team Management Skills
- area knowledge
Skills evaluated in this interview
Area Sales Manager Interview Questions asked at other Companies
Jobs at Pilgrim
Interview questions from similar companies
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.
- 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.
...
- 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.
- 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
- 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.
- 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
- 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
- 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.
- 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:...
- 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();
- 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);
- 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
- 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.
- 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.
- 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.
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
I appeared for an interview before Feb 2021.
(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.
- Q2.
Smallest Window Problem Statement
Given two strings,
SandX, your task is to find the smallest substring inSthat contains all the characters present inX.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
- 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.
(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...
- 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...
- 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...
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Interview Preparation Tips
Skills: Java, Data structures, Algorithm
College Name: na
Interview Preparation Tips
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
Interview Preparation Tips
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 appeared for an interview before Sep 2020.
(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
(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
(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.
- Q2.
Maximum Sum of Two Non-Overlapping Subarrays
Given an integer array
ARRand a positive integerK, your objective is to find two non-overlapping subarrays (contiguous) of lengthKeach, 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.
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
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
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.
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Easy
The test was divided into two parts : Section A had questions from Quantitative, C language, Logical and English. The second part had two coding questions.
- Q1.
Deletion in Circular Linked List Problem Statement
Given a Circular Singly Linked List of integers, and a specific value 'VAL', your task is to delete the first occurrence of this value in the linked list...
- Ans.
Delete the first occurrence of a specific value in a Circular Linked List.
Traverse the circular linked list to find the value to be deleted.
Update the pointers to skip the node containing the value.
Handle edge cases like deleting the only node in the list.
Return the modified circular linked list.
- Q2.
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1.
get(key)- Return the value of the key if it exists in the cache; otherw... - Ans.
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraints.
Use a combination of a doubly linked list and a hashmap to efficiently implement the LRU cache.
Keep track of the least recently used item and update it accordingly when new items are added.
Ensure that the cache does not exceed its capacity by evicting the least recently used item when necessary.
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Interview Questionnaire
8 Questions
- Q1. Find out the subset of an array of continuous positive numbers from a larger array whose sum of of the elements is larger in comparision to other subset. eg: {1,2 5 -7, 2 5} .The two subarrays are {1,2,5} ...
- Ans.
Find the subset of an array with the largest sum of continuous positive numbers.
Iterate through the array and keep track of the current sum and the maximum sum seen so far.
If the current element is positive, add it to the current sum. If it is negative, reset the current sum to 0.
Also keep track of the start and end indices of the maximum sum subset.
Return the subset using the start and end indices.
- Q2. Given two classes C1 and C2 which are almost same.(remember not exactly same). You want to choose best among these classes so that it can be use as key in hashmap. What question will you ask regarding two ...
- Q3. You are given two strings s1 and s2.Now, find the smallest substring in s1 containing all characters of s2
- Ans.
Find smallest substring in s1 containing all characters of s2.
Create a hash table of characters in s2
Use sliding window technique to find smallest substring in s1
Check if all characters in s2 are present in the substring
Update the smallest substring if a smaller one is found
- Q4. Questions on OOPS (almost all the concepts were covered like polymorphism, overriding, overloading, inheritance, concept of virtual fxns etc.)
- Q5. Write algo for reversing a linked list
- Ans.
Algorithm to reverse a linked list
Create a new empty linked list
Traverse the original linked list and insert each node at the beginning of the new list
Return the new list
- Q6. What is lazy loading? Advantages and disadvantages of the same?
- Ans.
Lazy loading is a technique used to defer the loading of non-critical resources until they are needed.
Advantages: faster initial page load, reduced bandwidth usage, improved user experience
Disadvantages: increased complexity, potential for slower subsequent page loads, difficulty with SEO
Examples: images, videos, and other media files can be loaded only when they are visible on the screen
- Q7. How ajax works? Difference between angular js and jquery?
- Ans.
Ajax is a technique for creating fast and dynamic web pages. AngularJS is a framework for building dynamic web applications, while jQuery is a library for simplifying HTML DOM traversal and manipulation.
Ajax stands for Asynchronous JavaScript and XML
It allows web pages to be updated asynchronously by exchanging data with a web server behind the scenes
AngularJS is a JavaScript framework that extends HTML with new attrib...
- Q8. Design a traffic light system?
- Ans.
A traffic light system controls the flow of traffic at intersections.
The system consists of three lights: red, yellow, and green.
Each light has a specific duration for which it stays on.
The system also includes sensors to detect the presence of vehicles and pedestrians.
The duration of each light can be adjusted based on traffic patterns.
The system can be connected to a central control system for remote monitoring and m
Interview Preparation Tips
College Name: na
Skills evaluated in this interview
Pilgrim Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
Pilgrim Interview Process
based on 3 interviews
Interview experience
Interview Questions from Similar Companies
2-4 Yrs
Not Disclosed
2-5 Yrs
₹ 12-15 LPA
2-5 Yrs
₹ 10-12 LPA
|
Senior Brand Executive
4
salaries
|  ₹4.8 L/yr - ₹11 L/yr |
|
Beauty Advisor
4
salaries
| ₹1.8 L/yr - ₹2.4 L/yr |
|
Area Sales Manager
3
salaries
| ₹9.1 L/yr - ₹18.5 L/yr |
|
Area Sales Executive
3
salaries
| ₹4.8 L/yr - ₹7.5 L/yr |
|
Retention Manager
3
salaries
| ₹21 L/yr - ₹22.7 L/yr |
Thomas Cook
Cox & Kings
SOTC Travel Limited
Kuoni Travel
- Home >
- Interviews >
- Pilgrim Interview Questions
