i
Zoringa
Filter interviews by
I applied via Company Website and was interviewed in Oct 2024. There were 2 interview rounds.
It was an assignment for Canva design they will check your creativity and it is quite simple
My salary expectation is in line with industry standards and based on my experience and skills.
Research industry standards for SEO Executive salaries
Consider my experience and skills when determining salary expectation
Be prepared to negotiate based on the overall compensation package offered
In 5 years, I see myself as a seasoned SEO Executive leading a team of digital marketing experts and driving successful campaigns for top clients.
Leading a team of digital marketing experts
Driving successful campaigns for top clients
Continuously learning and adapting to new SEO trends and strategies
Attending industry conferences and networking events to stay updated
Possibly pursuing further education or certifications
I was interviewed in Dec 2023.
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
A Case study to build professionally with content and presentation, output shared as PDF document for assessment.
Focus on English, speaking skills and other grammar Knowledge
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
Given a string STR
consisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.
The first line contains an inte...
Implement a function to check if parentheses in a string are balanced.
Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parenthes...
Given a string S
that represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ...
The task is to find the smallest number greater than the given number with the same set of digits.
Sort the digits of the number in descending order.
Find the first digit from the right that is smaller than the digit to its right.
Swap this digit with the smallest digit to its right that is greater than it.
Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the
Round duration - 60 minutes
Round difficulty - Medium
My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any le...
Find the maximum sum for any level in a binary tree.
Traverse the binary tree level by level and calculate the sum for each level.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Example: For the input tree, the maximum level sum is 13 (5+6+2).
Given an integer array ARR
and an integer K
, your task is to find the K
most frequent elements in ARR
. Return the elements sorted in ascending order.
Find the K most frequent elements in an integer array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
Given a binary tree where each node has a positive integer value, compute the vertical sum of the nodes. The vertical sum is defined as the sum of all nodes aligned along the...
Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.
Traverse the binary tree in a level order manner to calculate the vertical sum.
Use a hashmap to store the vertical sum at each vertical level.
Recursively traverse the tree and update the vertical sum in the hashmap.
Output the vertical sums in the required format for each test case.
TCP/IP is a set of protocols that governs the way data is transmitted over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to connect devices on the internet.
TCP ensures that data is reliably transmitted between devices.
IP is responsible for addressing and routing data packets across networks.
Examples of TCP/IP protocols include HTTP, FTP, and
Round duration - 30 minutes
Round difficulty - Easy
Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 5 interviews
Interview experience
Content Writer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
SEO Specialist
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Amazon
Snapdeal
Paytm