Filter interviews by
I applied via Naukri.com and was interviewed before Apr 2022. There were 3 interview rounds.
Design features and types of apparel product styles
Rated to apparels
I applied via Referral and was interviewed before Feb 2022. There were 2 interview rounds.
I was interviewed before Feb 2024.
My salary expectations are based on my experience, skills, and the industry standard.
Research industry standards for copywriters in the area
Consider my experience and skills when determining salary expectations
Be open to negotiation based on the overall compensation package offered
I applied via Approached by Company and was interviewed in Sep 2021. There were 3 interview rounds.
Copywriting Assignment
I applied via Naukri.com and was interviewed before Feb 2023. There was 1 interview round.
To identify whether a binary tree is a Binary Search Tree or not.
Check if the left subtree is a Binary Search Tree
Check if the right subtree is a Binary Search Tree
Check if the root node is greater than all the nodes in the left subtree
Check if the root node is less than all the nodes in the right subtree
Solution for inorder traversal in sorted order without using array
Implement a binary search tree and perform inorder traversal
Use a stack to simulate the recursive function call stack
Maintain a variable to keep track of the previously visited node
Compare the current node with the previously visited node to check if it is in sorted order
Convert a BST to a binary tree with each element replaced by sum of all greater elements.
Traverse the BST in reverse inorder and keep track of the sum of all greater elements.
Replace each node's value with the sum and update the sum.
Recursively perform the above steps on left and right subtrees.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Find the 2nd highest salary from an employee table in SQL.
Use the SELECT statement to retrieve the salaries in descending order.
Use the LIMIT keyword to limit the result set to the second row.
Use a subquery to exclude the highest salary from the result set.
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using languages such as Java, Python, and JavaScript
Proficient in using frameworks such as Spring, Django, and React
Strong problem-solving skills and ability to work in a team environment
Passionate about learning new technologies and keeping up with industry trends
Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.
Iterate through the array and compare each element to the previous one.
If all elements are increasing, it follows the increasing pattern.
If all elements are decreasing, it follows the decreasing pattern.
If there is a point where the elements start decreasing after increasing, it follow...
Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.
Use dynamic programming to keep track of the maximum sum at each index
At each index, choose between including the current element or skipping it
The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i
Return the maximum sum at the last index
Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.
Collect user data such as purchase history, search history, and demographics
Use machine learning algorithms to analyze the data and identify patterns
Create personalized coupon suggestions based on the identified patterns
Regularly update and refine the algorithm to improve accuracy
Allow users to provide feedback on t
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
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 1 interview
Interview experience
based on 4 reviews
Rating in categories
Content Writer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Digital Marketing Associate
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Management Trainee
3
salaries
| ₹0 L/yr - ₹0 L/yr |
UI/UX Designer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Graphic Designer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
CouponDunia
Cashkaro.com
Nearbuy
Freecharge