i
ProProfs
Filter interviews by
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...
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 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
2 Medium level DSA question
Use the exponentiation by squaring algorithm to optimally find n^m.
Use the exponentiation by squaring algorithm to reduce the number of multiplications needed.
Divide the exponent by 2 and recursively calculate the result.
Handle the cases when the exponent is even or odd separately.
Example: n^5 = n * n^2 * n^2
The edit distance problem involves finding the minimum number of operations required to transform one string into another.
The edit distance problem can be solved using dynamic programming.
Common operations include insertion, deletion, and substitution of characters.
Example: Given strings 'kitten' and 'sitting', the edit distance is 3 (substitute 'k' with 's', insert 'g', substitute 'n' with 'g').
I applied via Referral and was interviewed in Jun 2024. There was 1 interview round.
Array and Java related questions
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
1st round is coding assessment round based on graph and hashmaps
I applied via LinkedIn and was interviewed in Sep 2022. There were 3 interview rounds.
2 coding , 2 SQL with some quants
Remove redundant parentheses in a expression
Identify the innermost parentheses
Evaluate the expression inside the innermost parentheses
Replace the innermost parentheses with the evaluated expression
Repeat until no more redundant parentheses exist
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