Upload Button Icon Add office photos
Engaged Employer

i

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

Cult.fit Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Cult.fit Financial Associate Interview Questions and Answers

Updated 19 Feb 2025

Cult.fit Financial Associate Interview Experiences

1 interview found

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
-

I was interviewed in Aug 2024.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Basic questions
  • Q2. Basic accounting questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Please avoid this company, don't make yourself fool by joining this companies finance team, they will make sure you die but their business should not hamper, pathetic person heading the team, he doesn't have personal life and he will make sure you do the same

Interview questions from similar companies

I applied via Naukri.com and was interviewed in Aug 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. All questions where based on the previous company and work role and experience basically thy check the fluency and patience level and also the way of approaching the customer's request

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and nthg much about getting selection just focus in training you wil get it done in no time

Interview Questionnaire 

6 Questions

  • Q1. Introduce Yourself.
  • Ans. I, Shubham Kumar Kushwaha, live in Lucknow, Uttar Pradesh. My father name is Sanjay Kumar Kushwaha and I complete Graduation form University of Lucknow in 2019.
  • Answered Anonymously
  • Q2. Aapne Isse phle kha job ki hai?
  • Ans. Teaching as a English Teacher of Class 10th in SLG Public School.
  • Answered Anonymously
  • Q3. Aapne teaching ki job kyo chhodi?
  • Q4. Due To Corona. School were closed.
  • Q5. Aapko medicine ki knowledge hai?
  • Ans. I replied that I have knowledge of medicine used in Daily life.
  • Answered Anonymously
  • Q6. What is Cross Cheque?
  • Ans. 

    A cross cheque is a type of cheque that has two parallel lines drawn across its face, indicating that it can only be deposited into the bank account of the payee.

    • A cross cheque is a safer form of payment as it cannot be cashed by anyone other than the intended recipient.

    • The two parallel lines on a cross cheque can be either general or special crosses.

    • A general cross cheque can only be deposited into a bank account, whi...

  • Answered by AI
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 Resume tips
Round 2 - Group Discussion 

Good team lead. And time management

Round 3 - Aptitude Test 

Wherehouse operation manage ..invard . Outward ..and closely mercury cansole

Interview Preparation Tips

Topics to prepare for PharmEasy Senior Associate interview:
  • Wherehouse operation manage
Interview preparation tips for other job seekers - Software knowledge . mercury cansole ...and medivision software
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Introduce yourself
  • Q2. Why Healthify me
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 DSA questions with in one hour.

Round 2 - Technical 

(2 Questions)

  • Q1. Merge two binary trees
  • Ans. 

    Merge two binary trees by summing up the values of corresponding nodes

    • Traverse both trees simultaneously and sum up the values of corresponding nodes

    • If a node exists in only one tree, add it to the merged tree as is

    • Recursively merge the left and right subtrees

  • Answered by AI
  • Q2. Explain project
  • Ans. 

    Developed a web application for tracking personal fitness goals and progress

    • Used HTML, CSS, and JavaScript for front-end development

    • Implemented a RESTful API using Node.js and Express for back-end functionality

    • Utilized MongoDB for database storage and retrieval

    • Incorporated user authentication and authorization using JWT tokens

  • Answered by AI
Round 3 - HR 

(2 Questions)

  • Q1. Tell me about yourself.
  • Q2. Why should we hire you.
  • Ans. 

    I am a dedicated and quick learner with strong problem-solving skills and a passion for software development.

    • Strong problem-solving skills demonstrated through previous projects and coding challenges.

    • Quick learner who can adapt to new technologies and tools efficiently.

    • Passionate about software development and constantly seeking to improve my skills.

    • Dedicated to delivering high-quality code and meeting project deadline...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Aug 2023.

Round 1 - Coding Test 

3 question of basic and 3 mcq

Round 2 - Coding Test 

Strings,Sort 0 1 2,invert binary tree

Round 3 - One-on-one 

(2 Questions)

  • Q1. Project Basics and Technical skills
  • Q2. Your Daily routine
  • Ans. 

    My daily routine involves coding, debugging, attending meetings, and learning new technologies.

    • Start the day by checking emails and prioritizing tasks

    • Code and debug new features or fix existing issues

    • Attend team meetings to discuss progress and roadblocks

    • Spend time learning new technologies or improving coding skills

    • Collaborate with team members on projects

  • Answered by AI

Software Engineer Interview Questions & Answers

Medlife user image nerella saikrishna

posted on 9 Jan 2016

Interview Questionnaire 

12 Questions

  • Q1. Insert a node in a Linked List, if a pointer to a node(it's not a head pointer) of Linked List is given.
  • Q2. What is the Time Complexity of Binary Search and it's derivation
  • Ans. 

    Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.

    • Binary Search is a search algorithm that works on sorted arrays.

    • It starts by comparing the target value to the middle element of the array.

    • If the target value is smaller, the search continues on the lower half of the array.

    • If the target value is larger, the search continues on the upper half of the array.

    • T...

  • Answered by AI
  • Q3. Write code for QuickSort
  • Ans. 

    QuickSort is a sorting algorithm that uses divide and conquer approach.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot

    • Recursively apply the above steps to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q4. Write code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
  • Ans. 

    Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming

    • Recursion: Define a function that calls itself with the previous two numbers in the series as arguments

    • Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration

    • Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series

  • Answered by AI
  • Q5. How to implement an operation with Stacks which will be similar to Queue
  • Ans. 

    Implementing a Queue using Stacks

    • Use two stacks to implement a queue

    • Push elements onto the first stack

    • When dequeuing, pop all elements from the first stack and push onto the second stack

    • Pop the top element from the second stack to dequeue

    • If the second stack is empty, pop all elements from the first stack and push onto the second stack

  • Answered by AI
  • Q6. Write code for MergeSort
  • Ans. 

    MergeSort is a divide and conquer algorithm that sorts an array of strings.

    • Divide the array into two halves

    • Recursively sort the two halves

    • Merge the sorted halves

  • Answered by AI
  • Q7. 2 types of detective ball puzzles
  • Q8. 25 Horses, 5 Tracks, 3 Fastest Puzzle
  • Q9. How the letters of a text are determined(Basically about OCR)
  • Q10. Write code for Insertion Sort and Selection Sort and find their time complexities and also the cases where their usage is efficient
  • Q11. Explain about Counting Sort
  • Ans. 

    Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.

    • Count the occurrences of each element in the array

    • Calculate the cumulative sum of the counts

    • Place each element in the sorted array based on its count and cumulative sum

    • Time complexity is O(n+k) where n is the number of elements and k is the range of input

    • Example: Sort an array of strings based on their

  • Answered by AI
  • Q12. When we type a part of a word in chrome, how is it able to show all the types of words, which are consisted of that part
  • Ans. 

    Chrome uses an algorithm to predict and suggest words based on user input.

    • Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.

    • The algorithm also takes into account the frequency and recency of the user's input.

    • Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.

    • The suggestions are di...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: First Question, at the start I was not able to answer and he gave me an hint(He asked me the insertion in an array). So, I got the idea for the insertion in Linked List and was able to answer it.
Remaining questions, I was able to answer confidently.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I was able to answer all the questions confidently, since I know the answers for them, But the last question was out of my scope and I explained based on my intuition and knowledge.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

Round: Technical Interview
Experience: I have given the answers for 1&2 questions with clear explanation. And the third question is again out of my scope and I explained this also based intuition.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.

General Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skill Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skills: Logical Puzzles, Algorithms And DataStructures
College Name: IIT Madras
Motivation: 1. Primary Reason: Passionate about Programming and Problem solving.
2. The profile is software Engineer.
3. You can see your idea, having an impact on the society which is possible with this type of company.
4. And a good package.
Funny Moments: Nothing Really...

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Return the valid combinations as an array of strings.

  • 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. 

    Calculate the total amount of rainwater that can be trapped between given elevations in an array.

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

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.

    • Sum up the trapped water at each bar to get the total trapped water for the entire array.

  • Answered by AI
  • Q3. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.

    • Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.

    • Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.

    • Update the grid with the new state of oranges after each second.

    • Handle edge cases such as empty grid or no fresh oranges present.

    • Example...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.

  • Q1. 

    Queue Using Stacks Implementation

    Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.

    Explanation:

    Your task is to complete predefined functions t...

  • Ans. 

    Implement a queue using stacks following FIFO principle.

    • Use two stacks to simulate a queue.

    • For enQueue operation, push elements onto stack1.

    • For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.

    • For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.

    • For isEmpty operation, check if both stack1 and st...

  • Answered by AI
  • Q2. 

    Merge Intervals Problem Statement

    You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.

    Your task is to merge all overlapping intervals a...

  • Ans. 

    Merge overlapping intervals and return sorted list of merged intervals by start time.

    • Sort the intervals based on start time.

    • Iterate through intervals and merge overlapping ones.

    • Return the merged intervals in sorted order.

  • Answered by AI
  • Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.

  • Q1. 

    Binary Tree Diameter Problem Statement

    You are given a Binary Tree, and you need to determine the length of the diameter of the tree.

    The diameter of a binary tree is the length of the longest path betwe...

  • Ans. 

    The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.

    • Traverse the tree to find the longest path between two nodes.

    • Keep track of the maximum diameter found during traversal.

    • The diameter may not necessarily pass through the root node.

    • Consider both left and right subtrees while calculating the diameter.

    • Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1

  • Answered by AI
  • Q2. 

    Power of 2 Problem Statement

    Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.

    Input:

    The fir...
  • Ans. 

    The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.

    • Iterate through all possible permutations of the digits of the given integer.

    • Check if any of the permutations form a power of 2.

    • Return 1 if a valid permutation is found, else return 0.

  • Answered by AI
  • Q3. What are some advantages of using Object-Oriented Programming (OOP)?
  • Ans. 

    Advantages of OOP include code reusability, modularity, and easier maintenance.

    • Code reusability: Objects can be reused in different parts of the program, reducing redundancy.

    • Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.

    • Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.

    • Encapsulation: Data hiding and ab...

  • Answered by AI
  • Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
  • Ans. 

    Access specifiers define the level of access to class members in Object-Oriented Programming.

    • Access specifiers include public, private, protected, and default

    • Public members are accessible from outside the class

    • Private members are only accessible within the class

    • Protected members are accessible within the class and its subclasses

    • Default access is when no access specifier is specified

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.

  • Q1. Why should we hire you?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There was Pool Campus Placement of  4 Colleges together(NIT Jalandhar,NIT Hamirpur ,Candigarh University and CGC Landran ) at Chandigarh University.Written test was taken on Hacker Rank. There were 5 Coding Questions of Linklist , Dynamic Programming,Priority Queues etc . 
You didn't have to do All the questions (3 can get you to the next round).

One thing that need to be beware of is that on Hacker Rank Your Draft is Saved every second(or so). So don't copy from the internet and just paste there(they will get to know).
Tips: Make sure you practice lot of Algorithms.
Duration: 120 minutes
Total Questions: 5

Round: Problem Statement
Experience: Only 8 Students were selected for this round
20 mins were given for it
and afterwards each student had personal discussion(10 mins) with them to explain their schema .
3-4 Questions were also asked related to your schema and how to perform a particular query
Tips: You should Be Through with DBMS
Make sure there is no redundant table and Primary keys are marked

Round: Technical Interview
Experience: 2 were selected for the Interview
Firstly they make you very Comfortable and ask how were the previous Rounds.
Then they asked about the two questions of First Round and my approach 
Then couple of questions on The design that was made Earlier.
Then there were questions on How Internet Works ,gcc,Linux,git,sql.

Then the Interviewer asked if I have any question
I asked about (as the work on doctor's app) how they know the credibility of a doctor which is enlisted in their app.
Interviewer was really Impressed by the question and told me all about it with all details.


Both were selected
Tips: Be cool in the Interview
Think Loudly and Interact with them well.
If they want you to ask any question ,it should not be related to technical stuff ,it should be related to the company

College Name: NIT JALANDHAR
Contribute & help others!
anonymous
You can choose to be anonymous

Cult.fit Interview FAQs

How many rounds are there in Cult.fit Financial Associate interview?
Cult.fit interview process usually has 1 rounds. The most common rounds in the Cult.fit interview process are One-on-one Round.
What are the top questions asked in Cult.fit Financial Associate interview?

Some of the top questions asked at the Cult.fit Financial Associate interview -

  1. Basic accounting questi...read more
  2. Basic questi...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Spark Minda

No Interviews

SALARIES

Torrent Gas

INTERVIEWS

Freshworks

No Interviews

INTERVIEWS

Spark Minda

No Interviews

INTERVIEWS

BugsMirror

No Interviews

SALARIES

CADFEM India Private Limited

INTERVIEWS

Spark Minda

No Interviews

INTERVIEWS

Torrent Gas

No Interviews

Tell us how to improve this page.

Cult.fit Financial Associate Interview Process

based on 1 interview

Interview experience

2
  
Poor
View more

Interview Questions from Similar Companies

Tata 1mg Interview Questions
3.6
 • 146 Interviews
PharmEasy Interview Questions
3.7
 • 80 Interviews
MedPlus Interview Questions
3.6
 • 79 Interviews
Practo Interview Questions
3.2
 • 74 Interviews
HealthifyMe Interview Questions
3.0
 • 47 Interviews
Healthians Interview Questions
3.5
 • 45 Interviews
Netmeds.com Interview Questions
3.6
 • 42 Interviews
Fitelo Interview Questions
3.5
 • 33 Interviews
View all
Center Manager
261 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Center Manager
179 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
61 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Manager
56 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Trainer
44 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Cult.fit with

Growfit

4.7
Compare

HealthifyMe

3.0
Compare

Tata 1mg

3.6
Compare

Practo

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