Filter interviews by
The role of a FPD involves managing personnel within a fleet, ensuring compliance with regulations, and overseeing crew training and development.
Managing crew members within the fleet
Ensuring compliance with regulations and standards
Overseeing crew training and development programs
Handling crew scheduling and assignments
Maintaining accurate records of crew qualifications and certifications
I am seeking new opportunities for salary growth and job variety to further develop my skills and advance my career.
Seeking higher salary to align with my experience and contributions
Looking for new challenges and opportunities for growth
Interested in expanding my skill set and gaining diverse experience
Want to advance my career and take on more responsibilities
Believe a new role will provide better career progression
Top trending discussions
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
I applied via Company Website and was interviewed before Apr 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed before Oct 2022. There were 2 interview rounds.
Our business statistics show consistent growth in sales revenue and customer acquisition over the past year.
Sales revenue increased by 15% compared to last year
Acquired 20 new clients in the last quarter
Average order value rose by 10% due to successful upselling strategies
Email writing and verbal test 30 mins duration to complete
I was interviewed before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I applied via Referral and was interviewed before May 2020. There was 1 interview round.
To understand the supply of restaurants in a particular area of a city, we can use various methods.
Collect data from online directories like Yelp, Zomato, etc.
Conduct surveys to gather information about the number of restaurants in the area.
Analyze the population density and demographics of the area to estimate the demand for restaurants.
Check the number of restaurant permits issued by the local government.
Use GIS mapp...
I was interviewed in Jan 2021.
Round duration - 60 Minutes
Round difficulty - Easy
4 Questions which were of Easy, Medium, and Hard level.
The structure of a binary tree has been modified so that each node includes a reference to its parent node.
You are provided with two nodes,...
This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.
Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.
Compare the two lists and find the last common node.
Return the last common node as the lowest common ancestor.
Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.
A subarray 'A' is considered greater than a...
The problem is to find a subarray with the maximum sum in a given array.
Iterate through the array and keep track of the maximum sum and the current sum.
If the current sum becomes negative, reset it to 0.
Update the maximum sum if the current sum is greater.
Also keep track of the start and end indices of the subarray with the maximum sum.
Return the subarray using the start and end indices.
Round duration - 50 Minutes
Round difficulty - Easy
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the next greater element for each element in an array.
Iterate through the array from right to left.
Use a stack to keep track of the elements that have a greater element to their right.
For each element, pop elements from the stack until a greater element is found or the stack is empty.
If a greater element is found, it is the next greater element for the current element.
If the stack becomes empty, the...
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...
The question asks to find the total amount of rainwater that can be trapped in the given elevation map.
Iterate through the array and find the maximum height on the left and right side of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.
Sum up the amount of water trapped at each bar to get the total amo
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality round, asked basic questions like relocation and joining date etc
Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well
Tip 3 : focus on basics
Tip 1 : Try to make a single-page resume.
Tip 2 : Don't write unnecessary details like hobbies, family, etc.
based on 1 interview
Interview experience
based on 15 reviews
Rating in categories
Deputy Manager Technical
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Purchase Executive
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Great Eastern Shipping Company
Mercator
Shipping Corporation of India
Essar Shipping