i
Rank My Business
Filter interviews by
I applied via Recruitment Consulltant and was interviewed before Sep 2022. There were 3 interview rounds.
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...
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...
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...
I applied via Recruitment Consulltant and was interviewed in Jan 2022. There was 1 interview round.
Top trending discussions
Find pair of elements in an array whose sum is equal to a given number K.
Iterate through the array and for each element, check if K minus the element exists in the array.
Use a hash table to store the elements and their indices for faster lookup.
If multiple pairs exist, return any one of them.
If no pair exists, return null or an appropriate message.
Session is maintained using session affinity or sticky sessions.
Session affinity ensures that a user's session is always directed to the same server.
Load balancer uses a unique identifier to route requests to the same server.
Sticky sessions can be implemented using cookies or URL rewriting.
Session replication can also be used to maintain session data across multiple servers.
Singleton pattern ensures only one instance of a class is created and provides a global point of access to it.
Create a private constructor to prevent direct instantiation of the class
Create a private static instance of the class
Create a public static method to access the instance
Ensure thread safety by using synchronized keyword or static initialization block
Examples: Logger, Configuration Manager, Database Connection
Explaining abstract class, interface and multiple inheritance in PHP.
Abstract class is a class that cannot be instantiated and can have abstract methods.
Interface is a collection of abstract methods and constants that can be implemented by a class.
Multiple inheritance is not possible in PHP, but can be achieved using interfaces.
Interfaces can be implemented by multiple classes, allowing for multiple inheritance-like be
Write a stored procedure from given tables and conditions
Identify the tables and their relationships
Determine the conditions to be used in the stored procedure
Write the SQL code for the stored procedure
Test the stored procedure to ensure it returns the desired results
To increase PHP memory at run time, modify the php.ini file or use ini_set() function.
Edit the memory_limit value in php.ini file
Use ini_set('memory_limit', '256M') function to increase memory limit at run time
Check for memory leaks in the code
Use unset() function to free up memory after use
php.ini is a configuration file for PHP that allows users to customize various settings.
Change PHP settings such as memory limit, file upload size, and error reporting
Enable or disable extensions and modules
Set timezone and language settings
Configure email settings
Control caching and session settings
Use window.location to get domain from a url in jQuery.
Use window.location to get the full url
Use .hostname to get the domain name
Use .replace() to remove 'www.' if present
WAP to find smallest palindrome number larger than given number.
Convert the given number to string and check if it is already a palindrome.
If not, increment the number and check if it is a palindrome.
Repeat until a palindrome number larger than the given number is found.
Use a while loop to implement the above steps.
WAP to check if linked list elements is a palindrome without using any extra space.
Traverse the linked list and reverse the second half of the list
Compare the first half with the reversed second half
Use two pointers to traverse the list, one at normal speed and other at double speed
Find the first non-repeating character in a string.
Create a hash table to store the frequency of each character in the string.
Iterate through the string and check the frequency of each character.
Return the first character with a frequency of 1.
Connection pooling is a technique of reusing database connections to improve performance.
Connection pooling helps to reduce the overhead of creating and destroying database connections.
It maintains a pool of connections that can be reused by multiple clients.
Connection pooling is commonly used in web applications to handle multiple requests simultaneously.
It can be configured with parameters like maximum number of conn...
A singleton class in PHP is a class that can only be instantiated once.
Create a private constructor to prevent direct instantiation
Create a private static variable to hold the instance of the class
Create a public static method to get the instance of the class
Ensure that the public static method always returns the same instance
To connect to MySQL database using PHP, create a Connection class.
Use mysqli_connect() function to establish a connection
Pass the database credentials as parameters to the function
Create a constructor method to initialize the connection
Create a query method to execute SQL queries
Close the connection using mysqli_close() method
There are three types of errors in PHP: syntax errors, runtime errors, and logical errors.
Syntax errors occur when the code is not written correctly, such as missing semicolons or parentheses.
Runtime errors occur during the execution of the code, such as trying to access an undefined variable.
Logical errors occur when the code runs without errors, but produces unexpected results, such as a miscalculation in a formula.
Session in PHP allows to store user data on the server for later use.
Session starts when a user logs in and ends when the user logs out or the session expires.
Session data is stored on the server and identified by a unique session ID.
Session variables can be set and accessed using the $_SESSION superglobal array.
Session can be destroyed using the session_destroy() function.
Session can be used to store user-specific dat...
Find missing element in an array of elements from 0 to n-1
Calculate sum of all elements in array and subtract from sum of n natural numbers
Use XOR operation on all elements and n natural numbers
Sort the array and find the missing element
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
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.
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 interviewSelectedI was interviewed before Sep 2020.
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.
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...
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.
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
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
You are given a number in string format, a...
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.
Round duration - 80 Minutes
Round difficulty - Medium
Interview started at 11:00 am. Interview went well.
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.
The first line ...
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
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.
I was interviewed in Oct 2020.
Round duration - 120 minutes
Round difficulty - Medium
Evening test around 5
Platform :- SHL
Environment was amazing
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.
Check if the second tree is a subtree of the first tree by comparing their structures and node values.
Use a recursive approach to traverse both trees and check for equality.
Handle cases where one tree is null or the values do not match.
Return true if S is a subtree of T, false otherwise.
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted N*N matrix, find the position of a target integer X.
Iterate over each row and column to find the target integer X
Utilize the sorted nature of the matrix to optimize the search process
Return the position of X if found, else return -1 -1
Round duration - 60 minutes
Round difficulty - Medium
1 Hour
Afternoon
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging point
Given a Binary Search Tree (BST) and an integer 'S', your task is to find all pairs of nodes within the BST that total to 'S' and return these pairs. If no such p...
Find pairs of nodes in a BST that sum up to a given value 'S'.
Traverse the BST in-order to get a sorted list of nodes.
Use two pointers approach to find pairs with sum 'S'.
Keep track of visited nodes to avoid using the same node twice in a pair.
Round duration - 60 minutes
Round difficulty - Medium
Online Round held on Chime
You are given a binary tree of integers. Your task is to determine if it is a binary heap tree or not.
The first line of input contains an integer ‘T’ denoti...
Determine if a given binary tree is a binary heap tree or not based on certain properties.
Check if the binary tree is a complete binary tree where every level, except the last level, is completely filled and the last level is as far left as possible.
Ensure that every parent node is greater than all its children nodes, forming a max-heap.
If any node does not have a left or right child, it should be represented as -1 in
Given two strings S
and T
with lengths N
and M
respectively, your task is to find the "Edit Distance" between these strings.
The Edit Distance is defined as the minimum nu...
The task is to find the minimum number of operations required to convert one string into another using delete, replace, and insert operations.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the edit distances between substrings of the two input strings.
Fill up the array based on the minimum of three possible operations: insert, delete, or replace.
The final answer will be the value at...
Tip 1 : 1 Programming Language
Tip 2 : Practice Data Structures with atleast 300 ques.
Tip 3 : CS Fundamental
Tip 1 : 1 Pager
Tip 2 : Add top 3 projects in Resume.
I was interviewed before Sep 2020.
Round duration - 180 minutes
Round difficulty - Medium
The online test consisted of 2 coding questions, 30 aptitude MCQs, 30 behavioral MCQs and 10 code snippets to debug. The coding questions were of medium level, aptitude MCQs were easy and the code snippets to debug was also of easy level. Each section had a time constraint.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list without using additional space beyond constant space complexity.
Create a dummy node to start the merged list
Iterate through both linked lists and compare nodes to merge them in sorted order
Update the next pointers accordingly
Handle cases where one list is empty or both lists are empty
Return the head of the merged linked list
Consider a 2-dimensional grid 'GRID' with 'N' rows and 'M' columns in Ninjaland. Each cell in the grid has an associated cost. The goal is to determine the minimum path ...
The Minimum Path Sum Problem involves finding the minimum sum of costs along a path from the top-left to the bottom-right of a grid.
Use dynamic programming to calculate the minimum path sum by considering the costs of moving down or right at each cell.
Initialize a 2D array to store the minimum path sum values for each cell in the grid.
Iterate through the grid to calculate the minimum path sum for each cell based on the...
Round duration - 60 minutes
Round difficulty - Medium
My interview was at 9:00 am. The interview was conducted on Amazon Chime and my webcam was on. The interviewer also asked me to write the code on a document which can be edited by both me and the interviewer. The difficulty of the questions was of medium level. I was asked 3 coding questions along with 2 questions related to OOPS at the end. The interview ended with the discussion of one of my projects. The interviewer was good and also gave me hints wherever required.
You are given a string S
. Your task is to partition S
such that every substring of the partition is a palindrome. Your objective is to return all possible palindr...
Given a string, partition it into palindromes and return all possible configurations.
Use backtracking to generate all possible palindrome partitions
Check if each substring is a palindrome before adding it to the partition
Return all valid partitions as an array of strings
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S
without any separators. During this pro...
Find the missing number in a string of consecutive nonnegative integers.
Iterate through the string and check for missing numbers by comparing adjacent integers
If a missing number is found, return it as the output
Handle cases where there are multiple missing numbers or the string is invalid by returning -1
ACID properties in DBMS ensure data integrity and consistency.
Atomicity: All operations in a transaction are treated as a single unit of work, either all succeed or all fail.
Consistency: Database remains in a consistent state before and after the transaction.
Isolation: Transactions are isolated from each other until they are completed.
Durability: Once a transaction is committed, the changes made by it are permanent and...
Tip 1 : You must have a grip over Data Structures and algorithms. Your concepts must be crystal clear. Pick one coding platform and try to practice at least 7-10 coding questions everyday. I completed around 200+ questions on Leetcode, 200+ questions on Geek For Geeks and around 30-40 questions on InterviewBit.
Tip 2 : After attempting any coding problem, analyze its time and space complexity. See, if you can further optimize your solution. You can always check the editorials and compare your solution with it.
Tip 3 : Apart from coding questions keep studying concepts of Operating Systems, databases and object oriented programming. You can always refer to Geeks For Geeks articles for it. Also, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.
Tip 1 : You do not need to have a long list of projects on your resume. One good project with proper knowledge of it will do good. Similarly, do not list down several number of skills. Few skills but roper knowledge of them are enough.
Tip 2 : Do not fake anything on your resume. The interviewer gets to know about it by asking questions. If you aren't able to answer, it leaves a negative impact.
I applied via Naukri.com
I applied via Company Website and was interviewed in Aug 2020. There was 1 interview round.
based on 3 interviews
Interview experience
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