Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Glam Studios Team. If you also belong to the team, you can get access from here

Glam Studios Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Glam Studios Full Stack Developer Interview Questions and Answers

Updated 18 Aug 2024

Glam Studios Full Stack Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Front-end and backend-related coding like js php and mysql

Round 2 - Assignment 

Db Related assignment

Interview questions from similar companies

I was interviewed before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    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.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Implement an immutable class.
  • Ans. 

    An immutable class is a class whose instances cannot be modified after creation.

    • Use final keyword for class declaration to prevent inheritance

    • Make all fields private and final to prevent modification

    • Do not provide setter methods, only getter methods should be used

  • Answered by AI
  • Q2. Implement a springboot service that intercepts http requests.
  • Ans. 

    Implement a Springboot service to intercept HTTP requests.

    • Create a Springboot application with necessary dependencies.

    • Implement a custom interceptor by extending HandlerInterceptorAdapter.

    • Override preHandle and postHandle methods to intercept requests and responses.

    • Register the interceptor in the WebMvcConfigurerAdapter configuration class.

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Portal and was interviewed in May 2024. There was 1 interview round.

Round 1 - Coding Test 

Dsa question based on dp

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

HAckerrank based test

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(2 Questions)

  • Q1. Implementation of LRU cache
  • Ans. 

    LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.

    • Use a doubly linked list to keep track of the order of items based on their usage.

    • Use a hash map to quickly access items in the cache.

    • When a new item is accessed, move it to the front of the linked list. If the cache is full, remove the item at the end of the list.

  • Answered by AI
  • Q2. Implementation of HashMap
  • Ans. 

    HashMap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.

    • HashMap is implemented using an array of linked lists or a balanced tree to handle collisions.

    • It uses a hash function to map keys to indices in the array.

    • Example: HashMap map = new HashMap<>(); map.put("key", 123); int value = map.get("key");

  • Answered by AI

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

  • Q1. 

    Lowest Common Ancestor of a Binary Tree III

    The structure of a binary tree has been modified so that each node includes a reference to its parent node.

    Problem Statement

    You are provided with two nodes,...

  • Ans. 

    This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.

    • Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

    • Compare the two lists and find the last common node.

    • Return the last common node as the lowest common ancestor.

  • Answered by AI
  • Q2. 

    Maximum Subarray Problem Statement

    Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.

    A subarray 'A' is considered greater than a...

  • Ans. 

    The problem is to find a subarray with the maximum sum in a given array.

    • Iterate through the array and keep track of the maximum sum and the current sum.

    • If the current sum becomes negative, reset it to 0.

    • Update the maximum sum if the current sum is greater.

    • Also keep track of the start and end indices of the subarray with the maximum sum.

    • Return the subarray using the start and end indices.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

  • Q1. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that have a greater element to their right.

    • For each element, pop elements from the stack until a greater element is found or the stack is empty.

    • If a greater element is found, it is the next greater element for the current element.

    • If the stack becomes empty, the...

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right side of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

    • Sum up the amount of water trapped at each bar to get the total amo

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

  • Q1. 

    Hurdle Game Problem Statement

    Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).

    Given the total number ...

  • Ans. 

    Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.

    • Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level

    • Return the current level as the number of levels cleared

  • Answered by AI
  • Q2. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q3. 

    Count Ways To Travel Triangular Pyramid

    Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...

  • Ans. 

    Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.

    • Bob can move to any adjacent vertex in a single step

    • Bob must return to vertex 'O' after exactly 'N' steps

    • Calculate the number of different ways Bob can complete the journey

    • Return the result modulo 1000000007

    • Consider the constraints provided

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

  • Q1. 

    Generate Binary Strings with No Consecutive 1s

    Given an integer K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.

    Input:

    The input begins with an integer ...
  • Ans. 

    Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.

    • Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.

    • Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.

    • Sort the generated strings in lexicographically increasing order before outputting them.

  • Answered by AI
  • Q2. 

    Shuffle Two Strings Problem Statement

    You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:

    • T...
  • Ans. 

    Check if a string is formed by interleaving two other strings.

    • Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.

    • Use dynamic programming to efficiently solve the problem.

    • Handle edge cases like empty strings or unequal lengths of A, B, and C.

    • Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

  • Q1. 

    Ninja and Intersection of Lines

    You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...

  • Ans. 

    Find the intersection point of two lines on a 2D plane given their coordinates.

    • Calculate the slopes of both lines using the given coordinates.

    • Use the slope-intercept form of a line to find the equations of the two lines.

    • Solve the equations simultaneously to find the intersection point.

    • Return the coordinates of the intersection point with precision up to 6 decimal places.

  • Answered by AI
  • Q2. 

    Cycle Detection in Directed Graph

    Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.

    Input:

    The first line of input contains...
  • Ans. 

    Detect cycles in a directed graph and return true if a cycle exists, false otherwise.

    • Use Depth First Search (DFS) to detect cycles in the directed graph.

    • Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.

    • If a vertex is visited and is present in the recursion stack, then a cycle exists.

    • Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

  • Q1. How does a URL work and what is a load balancer?
  • Ans. 

    A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.

    • A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.

    • URLs typically consist of a protocol (such as HTTP ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Jalpaiguri Government Engineering College. Eligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - DSA, Networking, Operating Systems, DBMS, Spring JavaTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects

Application resume tips for other job seekers

Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Face to Face 

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

  • Q1. 

    Unique Binary Search Trees Problem Statement

    Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...

  • Ans. 

    The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.

    • Use dynamic programming to solve the problem efficiently.

    • The number of structurally unique BSTs can be calculated using Catalan numbers.

    • For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

    • Example: For N=3, the number of structurally unique BSTs is 5.

  • Answered by AI
  • Q2. 

    Subsequences of String Problem Statement

    You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...

  • Ans. 

    Generate all possible subsequences of a given string.

    • Use recursion to generate all possible subsequences by including or excluding each character in the string.

    • Maintain a current index to keep track of the characters being considered.

    • Append the current character to each subsequence generated so far.

    • Recursively call the function with the next index to include or exclude the next character.

    • Base case: When the current ind...

  • Answered by AI
Round 3 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - Dynamic Programming, Basic OOPS, Commonly Asked Algorithms (Kadane’s, Dutch National Flag and more), Data Structures (Heaps, Stack, Queues, HashMaps and more), Low Level Design (Machine Coding)Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly

Application resume tips for other job seekers

Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)

Final outcome of the interviewSelected

Skills evaluated in this interview

Glam Studios Interview FAQs

How many rounds are there in Glam Studios Full Stack Developer interview?
Glam Studios interview process usually has 2 rounds. The most common rounds in the Glam Studios interview process are Coding Test and Assignment.

Tell us how to improve this page.

Glam Studios Full Stack Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 331 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zepto Interview Questions
3.5
 • 208 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
AmbitionBox Interview Questions
4.9
 • 151 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Digit Insurance Interview Questions
4.0
 • 142 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
View all
Glam Studios Full Stack Developer Salary
based on 4 salaries
₹3 L/yr - ₹12 L/yr
9% more than the average Full Stack Developer Salary in India
View more details
Business Development Manager
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Manager
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Hair Dresser
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Makeup Artist
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Graphic Designer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Glam Studios with

Juice Salon

4.3
Compare

Enrich Salon and Academy

4.2
Compare

Lakme Salon

4.0
Compare

VLCC

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview