AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Rank My Business
Compare
Filter interviews by
Rank My Business Interview Questions and Answers
Rank My Business Interview Experiences
2 interviews found
Anonymous
Selected
I applied via Recruitment Consulltant and was interviewed before Sep 2022. There were 3 interview rounds.
(2 Questions)
- Q1. Difference between 301 and 302
- Ans.
301 is a permanent redirect, while 302 is a temporary redirect.
301 indicates that the resource has permanently moved to a new location, while 302 indicates a temporary move.
301 passes on the link juice to the new URL, while 302 does not.
301 is better for SEO as it consolidates link equity, while 302 is not recommended for SEO purposes.
Examples: 301 redirect is used when a website changes its domain name permanently, wh...
- Q2. What is keyword density
- Ans.
Keyword density is the percentage of times a keyword or phrase appears on a webpage compared to the total number of words on the page.
Keyword density is calculated by dividing the number of times a keyword appears on a page by the total number of words on the page and multiplying by 100.
It is important to maintain a natural keyword density to avoid keyword stuffing, which can negatively impact SEO.
For example, if a web...
(2 Questions)
- Q1. What seo is important
- Ans.
SEO is important for increasing visibility, driving traffic, and improving website rankings.
SEO helps increase visibility of a website on search engines
It drives organic traffic to the website
Improves website rankings on search engine results pages (SERPs)
Enhances user experience and usability of the website
Increases brand credibility and trustworthiness
Helps in staying ahead of competitors in the online market
Examples...
- Q2. Is seo work now a days
Interview Preparation Tips
Skills evaluated in this interview
Senior SEO Executive Interview Questions asked at other Companies
I applied via Recruitment Consulltant and was interviewed in Jan 2022. There was 1 interview round.
(2 Questions)
- Q1. What is your Previous Experience
- Q2. What is your salary expectations
Interview Preparation Tips
Senior SEO Executive Interview Questions asked at other Companies
Interview questions from similar companies
Selected
I applied via Referral and was interviewed before Oct 2023. There were 2 interview rounds.
(2 Questions)
- Q1. Center div using 3 approaches
- Ans.
Three approaches to center a div element
Using CSS flexbox: set display property of parent element to flex and justify-content to center
Using CSS grid: set display property of parent element to grid and place the div in the center grid area
Using margin: set margin property of the div to auto
- Q2. Display use of setTimeout
- Ans.
setTimeout is a function in JavaScript used to execute a function after a specified amount of time.
setTimeout(function, milliseconds) is used to delay the execution of a function by a specified number of milliseconds.
Example: setTimeout(() => { console.log('Hello, world!'); }, 2000) will log 'Hello, world!' after 2 seconds.
Asked me to create a carousel component
Skills evaluated in this interview
Selected
I applied via Internshala and was interviewed before Feb 2022. There was 1 interview round.
(2 Questions)
- Q1. Tell me about your self? Why do u want to do this? Do u know about competitors of quikr? Do u know what is competition analysis?
- Q2. Why do u want to join quikr?
Interview Preparation Tips
It is easy but work was in the timeline and have to complete it in time
I applied via Indeed and was interviewed in Mar 2023. There were 3 interview rounds.
(2 Questions)
- Q1. Self intro - tell me about yourself
- Ans.
I am a software developer with a passion for creating efficient and user-friendly applications.
Proficient in multiple programming languages such as Java, C++, and Python
Experience in developing web applications using HTML, CSS, and JavaScript
Strong problem-solving and analytical skills
Familiarity with agile development methodologies
Excellent communication and teamwork abilities
- Q2. Experience & why do you want to switch
- Ans.
I have 5 years of experience as a Software Developer and I want to switch to explore new technologies and challenges.
I have 5 years of experience as a Software Developer.
I have gained expertise in various programming languages and frameworks.
I have successfully delivered multiple projects and contributed to their success.
I want to switch to explore new technologies and challenges.
I believe switching will help me enhanc
Simple basic code for Form data
Interview Preparation Tips
Manasi Pasekar
Selected
I applied via Walk-in and was interviewed in Nov 2023. There was 1 interview round.
(2 Questions)
- Q1. What is design for you?
- Ans.
Design is the process of creating solutions that are visually appealing, functional, and user-friendly.
Design involves problem-solving and creativity
It focuses on creating visually appealing and aesthetically pleasing solutions
Design considers user experience and functionality
Examples include graphic design, product design, and web design
- Q2. What do you expect to learn from this role?
Interview Preparation Tips
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
- Q1. How can you check if two strings are anagrams of each other?
- Ans.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Interview Preparation Tips
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedSkills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 90 Minutes
Round difficulty - Medium
Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.
- Q1.
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...
- Ans.
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
Use DFS to traverse the graph and detect back edges indicating a cycle.
Maintain a visited array to keep track of visited nodes during traversal.
If a node is visited again during traversal and it is not the parent node, then a cycle exists.
Return true if a cycle is detected, false otherwise.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview
- Q1.
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...
- Ans.
Find the next smallest palindrome greater than a given number represented as a string.
Convert the string to an integer, find the next greater palindrome, and convert it back to a string.
Handle cases where the number is a palindrome or has all digits as '9'.
Consider both odd and even length numbers when finding the next palindrome.
(1 Question)
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
- Q1.
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
Interview Preparation Tips
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart.
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.
Tip 1 : Always try to make it a single page
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.
Skills evaluated in this interview
SAMKIT JAIN
I was interviewed in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. They asked about How have you developed Business in your Ex Company
Interview Preparation Tips
Rank My Business Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
- Design Engineer Interview Questions
- Software Developer Interview Questions
- Business Analyst Interview Questions
- Sales Executive Interview Questions
- Senior Engineer Interview Questions
- Consultant Interview Questions
- Associate Software Engineer Interview Questions
- Test Engineer Interview Questions
- Show more
Rank My Business Interview Process
based on 3 interviews
Interview experience
Interview Questions from Similar Companies
Rank My Business Reviews and Ratings
based on 32 reviews
Rating in categories
|
Senior SEO Executive
39
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
SEO Executive
12
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Content Writer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Junior Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Assistant Search Engine Optimization Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
JustDial
Indiamart Intermesh
Info Edge
Quikr
- Home >
- Interviews >
- Rank My Business Interview Questions
