i
JustDial
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Feb 2024. There were 2 interview rounds.
I applied via Recruitment Consulltant and was interviewed in Dec 2023. There were 4 interview rounds.
Just Dial is a local search engine that provides information about various businesses and services.
Just Dial allows users to search for businesses and services based on location and category.
Users can find contact details, addresses, and reviews of businesses on Just Dial.
Businesses can list their services on Just Dial to reach a wider audience.
Just Dial offers advertising options for businesses to promote their servic...
Certification process where you have to score above 80℅.
I applied via Walk-in and was interviewed in Nov 2023. There was 1 interview round.
I applied via Walk-in and was interviewed before Oct 2022. There were 3 interview rounds.
Some general question and numerical
JustDial interview questions for designations
I applied via Walk-in and was interviewed before Aug 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed before Dec 2020. There were 4 interview rounds.
The company is a leading provider of sales solutions and services.
The company offers a wide range of sales solutions, including CRM software, lead generation, and sales training.
They have a strong track record of helping businesses increase their sales and revenue.
The company has a team of experienced sales professionals who work closely with clients to understand their needs and provide tailored solutions.
They have a ...
I applied via Recruitment Consultant and was interviewed before Nov 2020. There was 1 interview round.
posted on 7 Jun 2021
I applied via Referral and was interviewed in May 2021. There was 1 interview round.
I appeared for an interview in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
based on 7 interviews
Interview experience
based on 24 reviews
Rating in categories
Tele Marketing Executive
1.3k
salaries
| ₹1.2 L/yr - ₹4.5 L/yr |
Sales Executive
798
salaries
| ₹1.5 L/yr - ₹4.4 L/yr |
Business Development Executive
663
salaries
| ₹1.6 L/yr - ₹5 L/yr |
Team Lead
541
salaries
| ₹2 L/yr - ₹7.2 L/yr |
Certified Internet Consultant
419
salaries
| ₹1.5 L/yr - ₹4.5 L/yr |
Amazon
Flipkart
Amazon Development Centre India