AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Chai Point Team Member Interview Questions and Answers
Chai Point Team Member Interview Experiences
1 interview found
Anonymous
Selected
I applied via Referral and was interviewed in Jul 2023. There were 3 interview rounds.
(5 Questions)
- Q1. About personal details
- Q2. My name and parents name
- Q3. About my schooltime
- Q4. And about my education
- Q5. And my qualifications
It's about the inventory test
Interview Preparation Tips
- Get well prepared
Interview questions from similar companies
I applied via AmbitionBox and was interviewed in Jan 2022. There were 4 interview rounds.
Who can devlopement for this mesho app
Always attreacted dress for sale product
Profit gain
No atituted jut for normal
Interview Preparation Tips
I applied via Recruitment Consulltant and was interviewed in Oct 2022. There were 2 interview rounds.
(2 Questions)
- Q1. What is your name?
- Q2. How old are you
Interview Preparation Tips
They just check your attitude.
I applied via Referral and was interviewed in Jul 2023. There was 1 interview round.
(2 Questions)
- Q1. Sales journal entries
- Ans. In case of credit sales customer Dr to sales account
- Q2. Purchase journal entries
- Ans. In case of credit purchase purchase account Dr to vendor account
Interview Preparation Tips
(2 Questions)
- Q1. Tell me about yourself
- Q2. Qualifications and work experience
(2 Questions)
- Q1. Work experience
- Q2. Elabouration of work
- Ans.
Elaborating on work experience and responsibilities in previous roles.
Provide detailed descriptions of tasks and projects worked on
Explain how responsibilities were managed and executed
Highlight any achievements or successes in previous roles
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
Hard difficulty level DSA test, main emphasis on trees and graphs
(3 Questions)
- Q1. Project related questions
- Q2. Questions on Javascript
- Q3. Questions on Core subjects
Interview Preparation Tips
- DSA
- OS
- OOPS
- Javascript
Coding question based on Linked List Arrays
(1 Question)
- Q1. DSA and DBMS were asked
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 120 minutes
Round difficulty - Medium
This was a 2 hour round consisting of 5 mcqs and 2 codes. The mcqs were pretty much simple based on DS, DBMS, OS, OOP, and C.
- Q1.
Rabbit Jumping Problem
Consider 'n' carrots numbered from 1 to 'n' and 'k' rabbits. Each rabbit jumps to carrots only at multiples of its respective jumping factor Aj (i.e., Aj, 2Aj, 3Aj, ...), for all ra...
- Ans.
Calculate uneaten carrots by rabbits with specific jumping factors.
Iterate through each carrot and check if any rabbit jumps on it.
Use the jumping factors to determine which carrots are eaten.
Subtract the eaten carrots from the total to get the uneaten count.
- Q2.
Flip Bits Problem Explanation
Given an array of integers
ARRof size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b... - Ans.
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j by changing 0s to 1s and vice versa.
Update the maximum count of 1s if the current count after flipping is greater.
Return the maximum count of 1s obtained by flipping a sub-array
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Started with a brief discussion on my projects and internships. A thorough discussion on whichever languages, frameworks I had used in my projects. Followed by discussion on coding questions. Apart from the codes there were some questions on OS, process stack, heap memory in Java, Garbage collection, OOP principles and comparison based sorting
- Q1.
Sum of Maximum and Minimum Elements Problem Statement
Given an array
ARRof sizeN, your objective is to determine the sum of the largest and smallest elements within the array.Follow Up:
Can you achie...
- Ans.
Find sum of maximum and minimum elements in an array with least number of comparisons.
Iterate through the array and compare each element with current maximum and minimum to update them.
Initialize max as smallest possible value and min as largest possible value.
Return the sum of max and min after iterating through the array.
- Q2.
Invert a Binary Tree Problem Statement
Given a Binary Tree and one of its leaf nodes, invert the binary tree by following these guidelines:
• The given leaf node becomes the root after the inversion. • F...
- Ans.
Invert a binary tree based on a given leaf node as the root.
Start by finding the leaf node in the binary tree.
Move the left child of the leaf node to the right side of the leaf node.
Make the parent of the leaf node the left child of the leaf node.
Repeat the process for each test case.
Return the inverted binary tree in level order format.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
Questions based on programming, DBMS and puzzles were asked in this round.
- Q1.
Rearrange Array to Form Largest Number
Given an array
ARRconsisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed....
- Ans.
Rearrange the array elements to form the largest possible number by concatenating them.
Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.
Use a custom comparator function while sorting the array elements.
Convert the sorted array elements to a single string to get the largest possible number.
- Q2. What is indexing in the context of databases?
- Ans.
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on columns in a database table to speed up the retrieval of rows that match a certain condition.
They work similar to the index in a book, allowing the database to quickly find the relevant data without having to scan the entire table.
Examples of indexes include ...
- Q3. What are the advantages of B+ Trees in database management systems?
- Ans.
B+ Trees are advantageous in database management systems due to their ability to efficiently store and retrieve data.
B+ Trees have a high fanout, allowing for more keys to be stored in each node, reducing the height of the tree and improving search performance.
B+ Trees are balanced trees, ensuring that operations like search, insertion, and deletion have a predictable time complexity of O(log n).
B+ Trees are optimized ...
Round duration - 45 minutes
Round difficulty - Medium
Puzzles and HR based questions were asked in this round.
He asked questions like : what are my career goals, what do you look forward to in a boss , how do you see yourself in 5 years ,etc etc .
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
Thommandru Vishnu
Interview Questionnaire
9 Questions
- Q1. All the leaf nodes of tree are doubly linked,print only the leaf nodes of a tree
- Ans.
Print only the leaf nodes of a doubly linked tree.
Traverse the tree and check if a node has no children and both left and right pointers are null.
If yes, then it is a leaf node and print it.
If no, then continue traversing the tree.
Use recursion to traverse the tree in a depth-first manner.
- Q2. LRU page Replacement Algorithm for large data
- Ans.
LRU page replacement algorithm is used to replace the least recently used page in memory with a new page.
LRU stands for Least Recently Used
It is a cache eviction algorithm
It is used to manage memory in operating systems
It works by keeping track of the pages that are used recently and the ones that are not
When a new page is to be loaded into memory, the algorithm checks which page has not been used for the longest time
- Q3. Given a linked list with 2 parameters m,n. Now start reversing the m nodes and leave n nodes and continue it till u reach the end
- Ans.
Reverse m nodes and leave n nodes in a linked list till the end.
Traverse the linked list till m nodes and reverse them
Traverse n nodes and continue reversing m nodes
Repeat the above step till the end of the linked list
Handle edge cases like m or n being greater than the length of the linked list
- Q4. Inorder Traversal of a tree
- Ans.
Inorder traversal is a way of visiting all nodes in a binary tree by visiting the left subtree, then the root, and then the right subtree.
Start at the root node
Traverse the left subtree recursively
Visit the root node
Traverse the right subtree recursively
Repeat until all nodes have been visited
- Q5. Inorder Travesal of a tree without recursion(write the code)
- Ans.
Inorder traversal of a tree without recursion
Create an empty stack and initialize current node as root
Push the current node to stack and set current = current.left until current is NULL
If current is NULL and stack is not empty, pop the top item from stack, print it and set current = popped_item.right
Repeat step 2 and 3 until stack is empty
- Q6. Given an array of numbers in which duplicates are there and one triplicate is there. find that number
- Ans.
Find the triplicate number in an array of duplicates.
Iterate through the array and keep track of the frequency of each number.
Return the number that appears three times.
If no number appears three times, return null.
- Q7. Explain all the serach algorithm you know with space and Time complexities
- Ans.
Explanation of search algorithms with their space and time complexities.
Linear Search - O(n) time complexity, O(1) space complexity
Binary Search - O(log n) time complexity, O(1) space complexity
Jump Search - O(√n) time complexity, O(1) space complexity
Interpolation Search - O(log log n) time complexity, O(1) space complexity
Exponential Search - O(log n) time complexity, O(1) space complexity
Fibonacci Search - O(log n)
- Q8. Given a situation and asks you which search algorithm suits the best in that situation
- Q9. Given an array of length n and in which numbers from 1-n will be there and each number can repeat any number of times find out which repeated more number of times
- Ans.
Find the most repeated number in an array of length n with numbers 1-n.
Create a dictionary to store the count of each number in the array
Iterate through the array and update the count in the dictionary
Find the key with the highest count in the dictionary
Interview Preparation Tips
Experience: Basically, it's not resume shortlist, it's a 9 pointer shortlist
Round: Test
Experience: The Entire Test is held in HackerRank Platform. it has
2 coding questions (one easy and one medium)
2 output questions(medium)
2 Aptitude(easy)
1 general Computer science(medium)
it took me 30 min for each coding questions.I was not known that general question is related to bash commands.
Tips: Practice the Warmup questions in Hacker Rank.
Do some Basic aptitude questions.
Thorough with the basic c and c++ concepts
Duration: 120 minutes
Total Questions: 7
Round: Technical Interview
Experience: It's completely around the data structures. The questions are a bit tricky but once u think without any tension u can get through easily. The interviewer is helpful and gives u few hints if u catch them at the right point of time u got it.There are 2 more questions which I haven't mentioned.
Tips: got through Data Structures and Algorithms Made Easy by Narasimha Karumanchi. It's a best book for the interviews.
Round: Technical Interview
Experience: The interviewer asked to put everything on the blackboard and write down the code of each and everything.
Tips: Go to the website -----/ and study all the interview questions and modules
Round: HR Interview
Experience: It's Technical+ HR interview all the technical questions went around resume. it went around 45 minutes they are very particular about what you wrote in the resume.HR questions are general like
whats your future plans
where will u see yourself in the office after 5 years?
Tips: please make sure that whatever you write in resume should be known to you very well.Don't write false things about yourself.And make sure you know completely about the projects you are going to write in resume(atleast the part you worked)
General Tips: Be sure of what you are saying. Don't be tensed and answer to your best.
Skills: Programming, Data Structures
College Name: VIT VELLORE
Skills evaluated in this interview
Interview Questionnaire
12 Questions
- Q1. What is the difference between get and post?
- Ans.
GET is used to retrieve data from a server, while POST is used to send data to a server.
GET requests are idempotent, meaning they can be repeated without changing the result
POST requests are not idempotent and can have side effects on the server
GET requests can be cached by the browser, while POST requests cannot
GET requests have limitations on the amount of data that can be sent, while POST requests have no limitation...
- Q2. What is session in php?
- Ans.
Session in PHP is a way to store and retrieve data for a user across multiple requests.
Sessions are used to maintain user-specific data on the server side.
A session is created for each user and is identified by a unique session ID.
Session data can be stored in server files or in a database.
Session variables can be accessed and modified throughout the user's session.
Sessions can be used to implement features like user a
- Q3. Where does session id is stored in php? How server identifies request has come from which client and many other related questions?
- Ans.
Session ID is stored in PHP as a cookie or a query parameter.
Session ID can be stored as a cookie in the client's browser.
Session ID can also be stored as a query parameter in the URL.
The server identifies the client by retrieving the session ID from the cookie or query parameter.
The session ID is then used to retrieve the corresponding session data stored on the server.
The server can also use other methods like IP add
- Q4. Cookie in php? Size of the cookie, expiry etc?
- Ans.
A cookie in PHP is a small piece of data stored on the client's computer. It has a size limit and an expiry date.
A cookie is used to store information on the client's computer for future use.
In PHP, cookies are set using the setcookie() function.
The size of a cookie is limited to 4KB.
Cookies can have an expiry date, after which they are no longer valid.
The expiry date can be set using the 'expires' parameter in the set...
- Q5. Memcache?
- Q6. Myisam and Innnodb?
- Q7. Triggers in mysql?
- Ans.
Triggers in MySQL are database objects that are automatically executed in response to specified events.
Triggers are used to enforce business rules, maintain data integrity, and automate tasks.
They can be defined to execute before or after an INSERT, UPDATE, or DELETE operation.
Triggers can be written in SQL or in a programming language like PL/SQL.
Examples of trigger events include inserting a new record, updating a re...
- Q8. Overriding and Overloading?
- Q9. Static class and static variable?
- Q10. Singleton pattern and factory pattern?
- Q11. Can constructor be declared as private?
- Ans.
Yes, a constructor can be declared as private.
Declaring a constructor as private restricts its accessibility to only the class itself.
This can be useful in scenarios where you want to control the creation of objects of that class.
Private constructors are commonly used in singleton design pattern implementations.
Example: private constructor in a singleton class:
class Singleton { private Singleton() {} }
- Q12. Indexing in mysql?
- Ans.
Indexing in MySQL improves the performance of database queries by creating a data structure that allows for faster data retrieval.
Indexes are created on one or more columns of a table.
They help in speeding up the search, sorting, and joining of data.
Indexes can be created using the CREATE INDEX statement.
Common types of indexes include B-tree, hash, and full-text indexes.
Indexes should be used judiciously as they consu...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Chai Point Interview FAQs
Tell us how to improve this page.
Chai Point Interviews By Designations
- Chai Point Manager Interview Questions
- Chai Point Software Engineer Interview Questions
- Chai Point Finance Manager Interview Questions
- Chai Point Shift Manager Interview Questions
- Chai Point Guest Relation Executive Interview Questions
- Chai Point Business Development Manager Interview Questions
- Chai Point General Manager Sales Interview Questions
- Chai Point Intern Interview Questions
- Show more
Interview Questions for Popular Designations
- Member Technical Staff Interview Questions
- Senior Team Member Interview Questions
- Member Technical Interview Questions
- Senior Member Technical Interview Questions
- Operations Team Member Interview Questions
- Senior Member of Technical Staff Interview Questions
- HR and Administration Team Member Interview Questions
- Associate Team Member Interview Questions
- Show more
Chai Point Team Member Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Chai Point Team Member Reviews and Ratings
based on 2 reviews
Rating in categories
|
Store Manager
44
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Assistant Manager
39
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Partner
22
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Software Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Lead Partner
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Chaayos
Chai Thela
Chai Garam
Chai Break
- Home >
- Interviews >
- Chai Point Interview Questions >
- Chai Point Team Member Interview Questions
