Tree to Linkedlist
LinkedList time complexity
Questions on ML models
Questions on ML quality metrics
Questions on SQL, Indexing, Joins
Questions on ReactJS
Resume based questions
Resume based questions
Resume based questions
I applied online. The process took 2 days. I interviewed at CustomFurnish (Hyderābād) in Mar 2023
Interview
It was good. Started simply asked few questions on the resume. asked about projects and then asked few relocation questions. interviewer was very friendly. asked to show the projects and then told I'll be moved to the next round
I applied online. I interviewed at CustomFurnish (Hyderābād) in May 2022
Interview
1. First round:- Offline test pen and paper
It consists of 3 sections:- Aptitude with 12 questions (easy level), and 13 Coding snippets (medium level).
And 3 coding questions:-
1. Find the smallest missing element in the array.(easy)
2. String-based questions(easy-medium)
3. Given array with coin [2000,500,100,50,20,10,1]
and eg:- Amount = 5419
o/p:- 2000 :- 2, 500:- 2, 100:- 4, 10:-1, 1:- 9
2. Second round:- Technical interview
3. Hr/Managerial round
Interview questions [1]
Question 1
face to face/virtual depends on locations.
1. Maximum Subarray sum problem (modified).
Asked to optimize the code
2. Anagram String ( Optimized solution) and asked to solve this problem using 2-3 approaches
3. Find the middle of the linked list in one iteration.
