Filter interviews by
I applied via Company Website and was interviewed in Dec 2022. There were 2 interview rounds.
I will create design samples showcasing my skills and creativity.
Create a variety of design samples such as logos, brochures, websites, and social media graphics
Showcase different styles and techniques to demonstrate versatility
Include both digital and print designs to highlight proficiency in various mediums
I applied via Naukri.com and was interviewed in May 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Aug 2022. There was 1 interview round.
I applied via Referral and was interviewed before Sep 2023. There was 1 interview round.
My strengths include creativity, attention to detail, and strong communication skills. My weaknesses include a tendency to be a perfectionist and difficulty saying no.
Strengths: creativity, attention to detail, strong communication skills
Weaknesses: perfectionism, difficulty saying no
I applied via LinkedIn and was interviewed before Jul 2023. There were 3 interview rounds.
Questions based on NextJS, ReactJS, JavaScript, HTML, CSS
I applied via Company Website and was interviewed in Apr 2024. There were 2 interview rounds.
2 coding questions, Java
Create a website, 7 days
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 3 reviews
Rating in categories
Freelancer
168
salaries
| ₹0 L/yr - ₹0 L/yr |
Graphic Designer
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Freelance Graphic Designer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Writer
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Entry Operator
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Upwork
PeoplePerHour
Urban Company
Truelancer