Inciterz Interview Questions and Answers

Core HTML, CSS and JS

JS deep dive and react

Q1. Mimic Promise.all, Array.flat, OTP Component etc
Add your answer

Q1. Languages known
Ans. 
I am fluent in English, Spanish, and French.
• English

• Spanish

• French
Answered by AI
Add your answer

Problem solving approach check

Q1. Case study and problem solving
Add your answer
Q2. Root cause Analysis
Add your answer

Q1. How to calculate requirement of Banana is a city like Mumbai
Ans. 
The requirement of bananas in a city like Mumbai can be calculated based on population, consumption habits, and availability.
• Calculate the population of Mumbai

• Estimate the average consumption of bananas per person

• Consider factors like tourism and events that may increase demand

• Take into account the availability of bananas from local markets and imports
Answered by AI
Add your answer
Q2. How to know , difference between a good or bad retailer
Ans. 
A good retailer focuses on customer satisfaction, product quality, and efficient operations.
• Good retailers prioritize customer satisfaction by providing excellent customer service and addressing customer needs.

• Good retailers offer high-quality products that meet customer expectations.

• Good retailers have efficient operations, including inventory management, supply chain logistics, and streamlined processes.

• Bad retailers...read more
Answered by AI
Add your answer
Q3. Simple SQL questions
Add your answer

Q1. How python dictionary is implemented internally ?
Ans. 
Python dictionary is implemented using hash tables.
• Python dictionary is a collection of key-value pairs.

• The keys in a dictionary must be unique and immutable.

• The values in a dictionary can be of any data type.

• Python dictionary is implemented using hash tables.

• Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.

• The hash function used in Python dictionary is based on the key's h...read more
Answered by AI
Add your answer
Q2. What is heap sort
Ans. 
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
• It divides the input into a sorted and an unsorted region.

• It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.

• It has a time complexity of O(n log n) and is not stable.

• Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Answered by AI
Add your answer
Q3. Coding question to sort array based on a custom filter
Add your answer

Contracts review and abstraction

Q1. Contracts and essential elements
Add your answer

Q1. Tell me about yourself?
Add your answer
Q2. Why are you the right fit for this role?
Add your answer