i
ProProfs
Filter interviews by
Use Google Search Console to submit a sitemap containing all the URLs you want to index.
Create a sitemap.xml file containing all the URLs you want to index.
Submit the sitemap to Google Search Console.
Monitor the indexing status in Google Search Console and address any issues that may arise.
Use the 'Fetch as Google' tool in Google Search Console to request indexing of specific pages.
Ensure that the pages have proper int...
I applied via Company Website and was interviewed before Jun 2023. There was 1 interview round.
CVV is a security code found on credit cards to prevent fraud.
CVV stands for Card Verification Value.
It is a 3 or 4 digit code found on the back of credit cards.
CVV is used for online transactions to verify that the person making the purchase physically has the card.
Never share your CVV with anyone to protect against fraud.
Google's latest algorithms focus on user experience, relevance, and quality content.
Core Web Vitals are now a ranking factor, focusing on page speed, interactivity, and visual stability.
BERT algorithm helps Google better understand natural language queries.
E-A-T (Expertise, Authoritativeness, Trustworthiness) is crucial for ranking high in search results.
Mobile-first indexing prioritizes mobile-friendly websites.
AI and...
I applied via Naukri.com and was interviewed before Oct 2021. There were 4 interview rounds.
I was asked to write a 120-word paragraph and make 2 quizzes with 5 questions with 4 options for each in 1 hour.
ProProfs interview questions for popular designations
I applied via Naukri.com and was interviewed in Aug 2021. There were 2 interview rounds.
Top trending discussions
Probability of a horse going out of a chessboard in 'n' steps.
The total number of possible moves for a horse is 8.
The probability of going out of the board depends on the position of the horse.
For example, if the horse is at a corner, the probability of going out of the board is higher.
The probability can be calculated using combinatorics and geometry.
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
I applied via Job Fair and was interviewed before Feb 2021. There were 5 interview rounds.
What is aptitude test?
Online study and off-line which one is better?
Someone not interested in assignments.
based on 5 interviews
Interview experience
based on 97 reviews
Rating in categories
Noida,
Ghaziabad
+12-5 Yrs
Not Disclosed
PHP Developer
38
salaries
| ₹0 L/yr - ₹0 L/yr |
SEO Executive
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Writer
22
salaries
| ₹0 L/yr - ₹0 L/yr |
UI/UX Designer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Web Developer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Freshworks
Zoho
MindTickle
InMobi