AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Freelancer.com Makeup Artist and Hair Stylist Interview Questions and Answers
Freelancer.com Makeup Artist and Hair Stylist Interview Experiences
1 interview found
I applied via Naukri.com and was interviewed in Apr 2023. There were 3 interview rounds.
(3 Questions)
- Q1. Demo of makeup/hair
- Q2. Client based question
- Q3. Theory based question
Makeup can help you present a polished appearance, and give you an extra boost of confidence, if you apply it correctly and appropriate to the situation.
Interview Preparation Tips
- Makeup
- Hair Styling
Top trending discussions
Interview questions from similar companies
Interview Preparation Tips
Experience: First round was a written test which had 20 MCQ's in the field of Databases, Theory of computation, Operating systems, Data Structures and Algorithms and one programming question. 7 students (4 B.Tech, 3 M.Tech) got through to the interviews. Most of the interviews were held in the Google Bangalore campus. There were a total of 5 rounds of interviews. All based on Data Structures and Algorithms. Each round had 2 questions for which we were usually supposed to explain the algorithm first and then write the code on a Google doc. It was a really great experience. I got a chance to visit both Google Bangalore and Hyderabad campuses and taste their awesome food.
Total Questions: 20
General Tips: Practice your coding skills. Writing a neat code is very important. Interviewers not just look for a good algorithm but also your coding style (indentation, variable names, simplicity etc.)
College Name: NIT SURATHKAL
Software Developer Interview Questions & Answers
Google
Sree Meghana Thotakuri
posted on 10 Mar 2015
Interview Preparation Tips
Experience: Google's APAC test is an online coding round. The test is for 3 hours and it has 4 coding questions.
Duration: 180 minutes
Round: Technical Interview
Experience: I had 3 technical interviews. The questions asked in them consisted of algorithmic coding and design questions. The approach was more stressed upon. The interviewers were very helpful and they were generous in throw hints whenever I was blocked.
Skills: Algorithmic coding , C++
College Name: IIT BOMBAY
Interview Questionnaire
13 Questions
- Q1. Given a source array of integers with possible duplicates and a target integer, write algorithm to find out 2 numbers in source array whose sum is equal to target integer
- Ans.
Algorithm to find 2 numbers in an array whose sum is equal to a target integer
Use a hash table to store the difference between target and each element in the array
Iterate through the array and check if the current element exists in the hash table
Return the pair of elements that sum up to the target integer
- Q2. Say you have three tables WORK, USERS, MANAGERS WORK - work_id - user_id - how_much USERS - user_id - team MANAGERS - manager_id - team If I am a manager, write a select statement to retrieve the work o...
- Ans.
Write a select statement to retrieve work of all users who belong to my team.
Join USERS and WORK tables on user_id
Join MANAGERS and USERS tables on team
Filter by manager_id
- Q3. In a Chrome extension, which file contains the most important information of the extension like version, pattern matches, etc
- Ans.
The manifest.json file contains the most important information of a Chrome extension.
The manifest.json file includes the version number, permissions, content scripts, background scripts, and other important details.
It is located in the root directory of the extension.
It is required for all Chrome extensions.
Example: "manifest_version": 2, "version": "1.0", "permissions": ["tabs", "storage"]
- Q4. There are three rooms, and there are Princess, Flowers and Snake in those rooms. The doors of all the rooms have incorrect nameplates. i.e., the nameplate for the princess’ room is not Princess. Similarly,...
- Q5. Which is faster: finding an item in a hashtable or in a sorted list? And Why?
- Ans.
Hashtable is faster for finding an item than a sorted list.
Hashtable has constant time complexity O(1) for finding an item.
Sorted list has logarithmic time complexity O(log n) for finding an item.
Hashtable uses hashing to directly access the item's location.
Sorted list requires binary search to find the item's location.
Hashtable is ideal for large datasets with frequent lookups.
Sorted list is ideal for datasets that re
- Q6. What are some of the most popular Data interchange formats when using APIs
- Ans.
JSON and XML are the most popular data interchange formats when using APIs.
JSON (JavaScript Object Notation) is a lightweight format that is easy to read and write. It is widely used in web APIs.
XML (Extensible Markup Language) is a more complex format that is also widely used in web APIs.
Other formats include CSV (Comma Separated Values), YAML (YAML Ain't Markup Language), and Protocol Buffers.
- Q7. Name some popular APIs for each of these Social Commerce service(llike a photo service etc)
- Ans.
Popular APIs for Social Commerce services
Facebook Graph API for social media integration
Instagram API for photo sharing and tagging
Twitter API for real-time updates and customer engagement
Pinterest API for product discovery and sharing
Google Maps API for location-based services
PayPal API for secure payment processing
- Q8. How would you change the format of all the phone numbers in 1000 static html pages?
- Ans.
Use a script to iterate through each HTML page, locate phone numbers, and update their format.
Write a script using a programming language like Python or JavaScript to iterate through each HTML page
Use regular expressions to locate phone numbers in the pages
Update the format of the phone numbers as needed (e.g. adding country code, changing separators)
Save the updated HTML pages with the new phone number format
- Q9. If you had an opportunity to design the Google Suggest system, please let us know how you would approach it and how you would execute the plan in terms of settings up systems like(data stores or databases,...
- Ans.
Designing Google Suggest system
I would start by analyzing user search patterns and frequently searched keywords
Then, I would create a database of these keywords and their associated search results
I would use indexing services to quickly retrieve relevant results for each keyword
I would also implement machine learning algorithms to improve the accuracy of suggestions over time
- Q10. How do you find out if a number is a power of 2? And how do you know if it is an odd number? Write code in the language of your choice
- Ans.
Check if a number is a power of 2 and odd.
To check if a number is a power of 2, use bitwise AND operator with the number and its predecessor. If the result is 0, it is a power of 2.
To check if a number is odd, use modulus operator with 2. If the result is 1, it is odd.
Example code in Python:
def is_power_of_two(num):
return num & (num - 1) == 0
def is_odd(num):
return num % 2 == 1
- Q11. How will improve the revenue of the cafeteria of the office.
- Ans.
By introducing new menu items, optimizing pricing strategy, and improving the overall dining experience.
Conduct a survey to understand the preferences of employees
Introduce healthy and affordable meal options
Offer discounts for bulk orders or loyalty programs
Partner with local vendors to source fresh ingredients
Improve the ambiance and seating arrangements
Implement online ordering and delivery services
- Q12. [Actual question which i screwed up. Bad Time for me]Number of users in 2001 for adwords, chrome, gmail, android and picassa are in the ratio of 6:9:14:13:8, and in 2004 we add 3 lakh more users. New rati...
- Q13. In google adwords there are about 30 million ads from 42 lanuages . What will I do review the ads and reject ads that do not comply with specific rules
- Ans.
Reviewing 30 million ads from 42 languages in Google AdWords and rejecting non-compliant ads requires a systematic approach.
Create a set of specific rules and guidelines for ad compliance
Use automated tools to filter out ads that violate the rules
Assign a team of reviewers to manually check the remaining ads
Ensure that the reviewers are fluent in the languages of the ads they are reviewing
Regularly update the rules and...
Interview Preparation Tips
Experience: I was asked to take the test at 8.30 pm. They fixed this test, a week back. Nobody will call you to remind you to take test. Nor the interviewer will call you. It is your responsibility to check ur mail without fail. On that day I was expecting a call from google from evening till 8.25 pm. None called me. I thought that they would have forgot that. I planned to do go out and have food. But suddenly my ipad gave a alert message and it was from gmail app [thanks for ipad, or else i would not have checked my mail in lap top]. It was from google recruiter. The mail stated that he has shared a doc with me and i must answer the questions in it. a google drive link was given. he mentioned that the test was for 2 hours. I was asked to type answers just below each of these questions.
Duration: 120 minutes
Round: Technical Interview
Experience: Since I had prepared for tech interviews like amazon, I was able to do it good.After a week I got a call from HR and informed that I cleared the first round. Then after two days I was told that i will have a telephonic interview with one of the google developers from adwords team . They scheduled a telephonic interview the next week
Round: Technical Interview
Experience: 1) How will improve the revenue of the cafeteria of the office. Lots of discussions went and i think, i really did that well.
2)[Actual question which i screwed up. Bad Time for me]
Number of users in 2001 for adwords, chrome, gmail, android and picassa are in the ratio of 6:9:14:13:8, and in 2004 we add 3 lakh more users. New ratio is 8:12:13:11:6. Number of picassa users in 2004= 1,44,000. Calculate number of adwords users in 2005.A basic math question that, even a school student can solve. But in that tension i was not able to do it. I took some time and finally gave him a answer. I myself knew that it would be wrong. But interviewer said great lets move on to next question[just to boost up me - good person].My actual job role revolves around developing tools for the the ad review team which will review the ad and reject illlegal ones. So third question was related to that .He told me that as I am from a tech background, I need to explain him technically wat will I do. He also said that he did not need the actual solution. They will just see the way I approach the problem. That an existing problem and they are open to suggestions.3)In google adwords there are about 30 million ads from 42 lanuages . What will I do review the ads and reject ads that do not comply with specific rules .Regarding the criteria under which google bans a ad as illegal – I discussed about different criteria .Out of the criteria’s i told , he asked me to consider only three criteria .
a) Link not working
b) Drug related ads
c) trademarks[trademark used by the companies]I gave lot of approaches like for link not workinga) designing a autobot which will automatically click ads link and check whether it is redirecting to correct page or not . Autobots are used by hackers to get money for the ads they posted . I suggested that by designing similar autobot we can validate the link.b) to check drug related ads -
To detect the language we can first check the geographic location from which the ad is getting posted and can narrow down to some less choices from which we can detect the language
i suggested him that we can create a trie which some specific keywords (like coccaine ) and do pattern matching with that and reject the add it contains any of the works in trie .The interviewer gave me another constraint wat if there comes a ad “coccaine rehabilitation center” we should reject those kind of ads na . thats for a good cause . So i suggested him that i can maintain another set of trie which can contain those set of keywords.Fist check trie1 if drug related keywords exist .
Next check trie 2 if other types of keyword exist.
– if keyword only present in trie1 [reject ad]
– if both tire return true [can reject . but its better that those ad's alone can be subjected to manual evaluation for rejection].I used trie as it can do the pattern matches faster .For trademarks also I discussed using similar datastructures and the interviewer was ok with my answer.
General Tips: I applied for a job in Google jobs page. I know that its very difficult that a resume gets noticed by google.Suddenly one fine day i got a call from Google HR saying that they are interested in my profile and asked me if, i was ready to go with the interview process[Come on! who will say no for Google]. I was surprised.I was asked to take a initial screen test [Online test].
Skills: data structure, Algorithm
College Name: na
Skills evaluated in this interview
Interview Questionnaire
7 Questions
- Q1. Image data structure: An image(square image) can be stored as a tree: A node is white if the image is white, is black if the image is black, and is mixed if it contains both. White and black nodes are leav...
- Q2. There is a dictionary containing words in sorted order. These words consist of some alien alphabets. Using the dictionary, find out the ordering between the alphabets. For eg, if English was the alien lang...
- Q3. A / b c / / d e f g Print the nodes in the following order: a, b, c, g, f, e, d, h, i, j, k, l ,m, n, o and so on. Which all data structures are used? Can we use just 1?
- Ans.
Multiple data structures are used to print nodes in a specific order. One data structure cannot be used alone.
The given order suggests a depth-first search traversal of a tree-like structure.
A stack can be used to keep track of the nodes to be visited.
A queue can be used to store the children of a node in the order they are visited.
An array can be used to store the nodes in the required order.
A linked list can be used ...
- Q4. Given 2 strings like bangalore and blr, return whether one appears as a subsequence of the other. The above case returns true whereas bangalore and brl returns false
- Q5. Given n pens and n tops, each pen (and each top) having a size different than the other and each pen fitting exactly one top, find the largest pen using minimum number of comparisons. A comparison involves...
- Ans.
Find largest pen using minimum comparisons with tops.
Divide pens into two groups and compare largest pen from each group with largest top.
Repeat the process with the group containing the largest pen until only one pen is left.
The remaining pen is the largest pen.
Total number of comparisons required is 2n-3.
- Q6. Given n dice, each of 'a' sides and a sum b, return the number of ways in which the sum b can be obtained. How can you reduce the time complexity and space complexity?
- Ans.
Given n dice with 'a' sides and sum b, return no. of ways to obtain b. Optimize time and space complexity.
Use dynamic programming to reduce time complexity
Create a 2D array to store the number of ways to obtain each sum for each number of dice
Use rolling arrays to optimize space complexity
Example: n=2, a=6, b=7 -> 6 ways to obtain sum 7
Example: n=3, a=4, b=8 -> 21 ways to obtain sum 8
- Q7. Given 2 machines, each having 64 GB RAM, containing all integers (8 byte), sort the entire 128 GB data. You may assume a small amount of additional RAM. Extend this to sort data stored in 1000 machines
- Ans.
Sort 128 GB data on 2 machines with 64 GB RAM each. Extend to 1000 machines.
Use external sorting algorithm like merge sort or quick sort
Divide data into smaller chunks and sort them individually
Merge sorted chunks using additional RAM
For 1000 machines, use distributed sorting algorithms like MapReduce or Hadoop
Ensure data consistency and fault tolerance in distributed sorting
Interview Preparation Tips
Experience: There was a preliminary test, wherein questions on discrete structures, data structures, algorithms, math (permutation, combinations, probability) and operating systems were asked. There was also a programming question to code (on paper). It took them around 3 weeks to shortlist students selected for interviews.
Round: Technical Interview
Experience: It took them about a month's time to announce results!
College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Feb 2021. There was 1 interview round.
Interview Questionnaire
1 Question
- Q1. Company details
Interview Preparation Tips
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
Numerical and logical aptitude test
There are 5 rounds on datastructure and algorithm
Interview Preparation Tips
Good and smoth interview experiance
I applied via Job Fair and was interviewed before Dec 2021. There were 3 interview rounds.
Strictly know about advanced coding languages like python.
Be focus on aptitude and reasoning too....
Interview Preparation Tips
I was interviewed before Sep 2020.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
It was a hangout video call. The interviewer asked me these questions. Tell me about yourself and 1 coding question.
- Q1.
Special Numbers Problem Statement
Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined as a number whose digits, when rot...
- Ans.
Count the total number of special numbers within a given range by rotating digits 180 degrees.
Create a function to check if a number is a special number by rotating its digits.
Iterate through the range from 1 to MAXVAL and count the special numbers.
Handle the digit rotation mapping for 0, 1, 6, 8, 9.
Return the count of special numbers for each test case.
Round duration - 60 Minutes
Round difficulty - Easy
This was an On-site (Behavioural Round) interview. He asked me these questions.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
This was another On-site ( DS & Algo) algorithm.
- Q1.
Covid Vaccination Distribution Problem
As the Government ramps up vaccination drives to combat the second wave of Covid-19, you are tasked with helping plan an effective vaccination schedule. Your goal is...
- Ans.
Given constraints, find max vaccines administered on a specific day during a vaccination drive.
Iterate through each test case and calculate the maximum number of vaccines distributed on the specified day.
Distribute vaccines evenly across days while maximizing the number on the specified day.
Ensure that the sum of vaccines administered does not exceed the maximum allowed.
Consider edge cases like when the number of days ...
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Easy
Another On-site ( DS & Algo) interview.
- Q1.
Painter's Partition Problem Statement
Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required...
- Ans.
Determine the minimum time required to paint all boards with given constraints.
Use binary search to find the minimum and maximum possible time to paint all boards.
Iterate through the boards and assign them to painters based on the time constraints.
Calculate the total time taken to paint all boards with the assigned painters.
- Q2.
Chocolate Distribution Problem
You are given an array/list
CHOCOLATESof size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'... - Ans.
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
Sort the array of chocolates.
Use sliding window technique to find the minimum difference between the largest and smallest number of chocolates.
Return the minimum difference as the output.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Easy
Another On-site ( DS & Algo) interview.
- Q1.
Problem Statement: Minimize the Maximum
You are given an array of integers and an integer
K. For each array element, you can adjust it by increasing or decreasing it by a value ofK. Your goal is to minim... - Ans.
Given an array of integers and an integer K, minimize the difference between the maximum and minimum elements after adjusting each element by +/- K.
Sort the array in non-decreasing order.
For each element, calculate the difference between the current element and the next element.
Adjust the element by adding or subtracting K to minimize the difference.
Return the minimum possible difference between the maximum and minimum
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
On-site ( DS & Algo) interview.
Google mainly focuses on logic and how you are coming with a solution. It notes down each and every small mistake. Interviewers are really very helpful. They expect clear code with an optimal approach.
- Q1.
Farthest Distance From Lands Problem Statement
Given a binary square matrix 'ARR' with 'N' rows and 'N' columns, where '0' represents water and '1' represents land.
Determine the water cell whose distanc...
- Ans.
Find the water cell farthest from land in a binary matrix using Manhattan distance.
Iterate through the matrix to find all land cells and water cells
Calculate the Manhattan distance of each water cell to the nearest land cell
Return the maximum distance found
Interview Preparation Tips
Tip 1 : Participate in coding contests.
Tip 2 : Practice as many questions as you can.
Tip 3 : Do some good projects.
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Skills evaluated in this interview
I was interviewed before Jan 2021.
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.
- Q1.
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...
- Ans.
Find the K-th largest element in a BST.
Perform reverse in-order traversal of the BST to find the K-th largest element.
Keep track of the count of visited nodes to determine the K-th largest element.
Return -1 if there is no K-th largest element in the BST.
- Q2.
Is Height Balanced Binary Tree Problem Statement
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
- The left subtree is balanced.
- The right subtree is bala...
- Ans.
Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.
Check if the left subtree is balanced
Check if the right subtree is balanced
Calculate the height difference between the left and right subtrees
Return 'True' if all conditions are met, otherwise return 'False'
- Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
- Ans.
Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.
Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.
Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.
Orphan p...
(3 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .
- Q1.
Longest Substring Without Repeating Characters Problem Statement
Given a string
Sof lengthL, determine the length of the longest substring that contains no repeating characters.Example:
Input:
"abac...
- Ans.
Find the length of the longest substring without repeating characters in a given string.
Use a sliding window approach to keep track of the longest substring without repeating characters.
Use a hashmap to store the index of each character in the string.
Update the start index of the window when a repeating character is found.
Calculate the maximum length of the window as you iterate through the string.
Return the maximum le
- Q2.
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer
Qqueries. Each query is represented by an integerQ[i], and you must ... - Ans.
Search for integers in a rotated sorted array efficiently.
Use binary search to efficiently search for integers in the rotated sorted array.
Handle the rotation of the array while performing binary search.
Return the index of the integer if found, else return -1.
- Q3.
Count Subarrays with Sum Divisible by K
Given an array
ARRand an integerK, your task is to count all subarrays whose sum is divisible by the given integerK.Input:
The first line of input contains an... - Ans.
Count subarrays with sum divisible by K in an array.
Iterate through the array and keep track of the prefix sum modulo K.
Use a hashmap to store the frequency of each prefix sum modulo K.
For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.
Handle the case when prefix sum itself is divisible by K.
Return the total count of subarrays with sum divisible by K.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.
- Q1.
Ceil Value from BST Problem Statement
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
- Ans.
Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.
Traverse the BST to find the closest value greater than or equal to the key.
Compare the key with the current node value and update the ceil value accordingly.
Recursively move to the left or right subtree based on the comparison.
Return the ceil value once the traversal is complete.
- Q2.
Design a Constant Time Data Structure
Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:
1. INSERT(key, value): Add or update t... - Ans.
Design a constant time data structure to maintain mappings between keys and values with various operations.
Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.
Keep track of the number of key-value pairs for GET_SIZE operation.
Check if the hash table is empty for IS_EMPTY operation.
Return true or false for SEARCH operation based on key existence.
Return the value associated...
Interview Preparation Tips
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.
Skills evaluated in this interview
Freelancer.com Interview FAQs
Tell us how to improve this page.
Freelancer.com Interviews By Designations
- Freelancer.com Software Developer Interview Questions
- Freelancer.com Freelancer Interview Questions
- Freelancer.com Data Entry Operator Interview Questions
- Freelancer.com Content Writer Interview Questions
- Freelancer.com Graphic Designer Interview Questions
- Freelancer.com Freelance Content Writer Interview Questions
- Freelancer.com Data Entry jobs Interview Questions
- Freelancer.com Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Makeup Artist Interview Questions
- Makeup Trainer Interview Questions
- Hair Dresser Interview Questions
- Beautician and Makeup Artist Interview Questions
- Fashion Stylist Interview Questions
- Acquisition Manager Interview Questions
- Production Incharge Interview Questions
- Accounts Payable Specialist Interview Questions
- Show more
Freelancer.com Makeup Artist and Hair Stylist Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
|
Freelancer
3.2k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Graphic Designer
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Content Writer
788
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Softwaretest Engineer
625
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Video Editor
584
salaries
| ₹0 L/yr - ₹0 L/yr |
Upwork
Fiverr Inc.
Gurit India
99designs
- Home >
- Interviews >
- Freelancer.com Interview Questions >
- Freelancer.com Makeup Artist and Hair Stylist Interview Questions
