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 Software Developer Intern Interview Questions, Process, and Tips

Updated 20 Sep 2021

Top Cult.fit Software Developer Intern Interview Questions and Answers

  • Q1. Maximum Subarray Sum Problem Statement Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array. Input: The first line of i ...read more
  • 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 ...read more
  • Q3. Problem: Search In Rotated Sorted Array Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represente ...read more
View all 13 questions

Cult.fit Software Developer Intern Interview Experiences

3 interviews found

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.

  • Q1. 

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

    • Return the list of merged intervals sorted by start time.

  • Answered by AI
  • Q2. 

    Josephus Problem Statement

    Consider 'N' individuals standing in a circle, numbered consecutively from 1 to N, in a clockwise direction. Initially, the person at position 1 starts counting and will skip K-...

  • Ans. 

    The Josephus problem involves eliminating every Kth person in a circle until only one person remains. Determine the position of the last person standing.

    • Use a circular linked list to simulate the circle of people.

    • Iterate through the list, skipping K-1 nodes and removing the Kth node until only one node remains.

    • Return the position of the last remaining node.

    • Example: For N=5, K=2, the last person standing is at position

  • Answered by AI
Round 2 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.

  • Q1. 

    Largest Rectangle in Histogram Problem Statement

    You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.

    ...
  • Ans. 

    Compute the area of the largest rectangle that can be formed within the bounds of a given histogram.

    • Iterate through the histogram bars and maintain a stack to keep track of increasing heights.

    • Calculate the area of the rectangle by considering the current height and the width of the rectangle.

    • Update the maximum area found so far as you iterate through the histogram.

    • Handle edge cases like when the stack is empty or when ...

  • Answered by AI
  • Q2. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in top-down order

    • Traverse the leaf nodes in left-right order

    • Traverse the right boundary nodes in bottom-up order

    • Handle duplicates by including them only once

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The face to face round was held on Google Meet where initially interviewer asked a DS/Algo problem. Later the manager joined and asked about our resume projects in detail.
The time was 10:00 AM.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array of numbers, the task is to find the maximum sum of any contiguous subarray of the array.

    Input:

    The first line of input contains the size of the arr...
  • Ans. 

    Find the maximum sum of any contiguous subarray in an array of numbers in O(N) time.

    • Use Kadane's algorithm to find the maximum subarray sum in O(N) time.

    • Initialize two variables: max_sum and current_sum to keep track of the maximum sum found so far and the current sum of the subarray being considered.

    • Iterate through the array and update current_sum by adding the current element or starting a new subarray if the current...

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently using binary search.

    • Use binary search to efficiently find the index of each query integer in the rotated sorted array.

    • Handle the rotation of the array by finding the pivot point first.

    • Check which half of the array the query integer falls into based on the pivot point.

    • Return the index of the query integer if found, else return -1.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACurefit interview preparation:Topics to prepare for the interview - Dynamic Programming, Greedy Techniques, Data Structures, OOPs, DBMS, Graph TheoryTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Prepare OS,DBMS,OOPs too
Tip 2 : Mention at-least one project or past work experience in your resume
Tip 3 : Try maintaining 8+ CGPA as sometimes shortlist is done based on CGPA
Tip 4 : Try past interview questions from Leetcode,Interviewbit.

Application resume tips for other job seekers

Tip 1 : Try to Keep Resume 1 Pager
Tip 2 : Have atleast one project or past work experience mentioned
Tip 3 : Don't put false things on Resume as questions are asked in detail from Resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was early in the morning from 8 am. It was a test from home itself. It was a conducted on HackerEarth and was of 60 minutes duration. 30 students were shortlisted. I was also shortlisted.

  • Q1. 

    Word Break Problem Statement

    You are given a list of N strings called A. Your task is to determine whether you can form a given target string by combining one or more strings from A.

    The strings from A c...

  • Ans. 

    Given a list of strings, determine if a target string can be formed by combining one or more strings from the list.

    • Iterate through all possible combinations of strings from the list to form the target string.

    • Use recursion to try different combinations of strings.

    • Check if the current combination forms the target string.

    • Return true if a valid combination is found, otherwise return false.

  • Answered by AI
  • Q2. 

    Break The Board Problem Statement

    Your task is to break a board of given dimensions 'L' by 'W' into 'L' * 'W' smaller squares, ensuring the total cost of breaking is minimized.

    Input:

    The first line con...
  • Ans. 

    The task is to minimize the cost of breaking a board into smaller squares by making horizontal and vertical cuts.

    • Iterate through all possible horizontal and vertical cuts to find the minimum cost

    • Use dynamic programming to optimize the solution by storing intermediate results

    • Calculate the total cost by summing up the costs of all cuts

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Hard

This round was scheduled around 12 pm. It was a virtual round with one interviewer who was a Cure.Fit employee. My resume was scanned and a brief introduction was asked. After that a question was put up which I had to find solution to and code it. In the end, I asked questions regarding the type of projects they work on etc. I was selected for the next round

  • Q1. 

    Balanced Sequence After Replacement

    Given a string of length 'N' containing only the characters: '[', '{', '(', ')', '}', ']'. At certain places, the character 'X' appears in place of any bracket. Your go...

  • Ans. 

    Determine if a valid balanced sequence can be achieved by replacing 'X's with suitable brackets.

    • Iterate through the string and keep track of the count of opening and closing brackets.

    • If at any point the count of closing brackets exceeds the count of opening brackets, return False.

    • If all 'X's can be replaced to form a valid balanced sequence, return True.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

As soon as the HR round got over. I was asked to sit for my next round. It was again a problem solving round along with Data Structure questions in the end. The interviewer was an employee of Cure.Fit and after a brief introduction, I was given a question. After solving it, I was asked questions on Hashmaps, their implementation, time complexities. Finally, I was selected :)

  • Q1. 

    Pair with Given Sum in a Balanced BST Problem Statement

    You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target’. Your task is to determine if there exists any pair of nodes such ...

  • Ans. 

    Given a Balanced BST and a target integer, determine if there exists a pair of nodes with sum equal to the target.

    • Traverse the BST in-order to get a sorted array of values.

    • Use two pointers approach to find the pair with sum equal to target.

    • Consider edge cases like negative numbers and duplicates.

    • Time complexity can be optimized to O(n) using a HashSet to store visited nodes.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteria8 CGPA and students from CSE, IT onlyCurefit interview preparation:Topics to prepare for the interview - Recursion, Dynamic Programming, Trees, Data Structure, Algorithms, Graphs, Binary Search, OOPS, DBMSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Do competitive programming and maintain a decent rating across platforms. This will make you comfortable with the coding rounds and thinking under pressure and in a time-bounded manner.
Tip 2 : Practice some company wise questions, especially of Google, Facebook, Amazon, Microsoft from Leetcode 1-2 months before the placement/internship season to get yourself accustomed to good interview type questions. 
Tip 3 : Practice Dynamic Programming using a top-down approach as this not only improves DP but also improves recursion thinking. Recursion in turn help you to solve questions on Trees, graphs, and backtracking.
Tip 4 : Have at least 2 good projects on your resume which is solving some real-life problems. I won't recommend making just clones, rather add more functionalities. Web Development projects are good to start with. 
Tip 5 : Study the core subjects for internships in the following priority manner: OOPS>>OS>=DBMS. Some colleges may have System Design as well. That can be studied in the same manner like OS.
Tip 6 : Get yourself a good mentor to guide yourself.

Application resume tips for other job seekers

Tip 1 : Keep your resume simple and formal. 
Tip 2 : Having a past internship opportunity is a plus.
Tip 3 : Have good projects and mention them only if you know the depth of it.
Tip 4 : List your achievements chronologically and focus on participating in various competitions and getting recognition.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Had to solve 2 easy coding problems. Could be solved in 25 minutes if you are well prepared with DS-Algo.

  • Q1. 

    Job Scheduling Problem Statement

    Given a list of ‘N’ jobs, each associated with a deadline and a profit obtainable if completed by the deadline, schedule the jobs to maximize the total profit. Each job ta...

  • Ans. 

    The job scheduling problem involves maximizing profit by scheduling jobs with deadlines and profits optimally.

    • Sort the jobs in decreasing order of profit.

    • Iterate through the sorted jobs and schedule them based on their deadlines.

    • Keep track of the maximum profit achievable by scheduling jobs within their deadlines.

    • Example: For input Jobs: 'A'(profit=20, deadline=1), 'B'(profit=30, deadline=2), 'C'(profit=40, deadline=2)...

  • Answered by AI
  • Q2. 

    Water Flow Problem Statement

    Given a matrix A with dimensions 'N' x 'M', where each cell represents the height of water in that location, determine the coordinates from which water can flow to both the Pa...

  • Ans. 

    Given a matrix representing water heights, find coordinates where water can flow to both Pacific and Atlantic oceans.

    • Create a function that performs a depth-first search to find coordinates where water can flow to both oceans.

    • Keep track of visited cells and check if a cell can flow to both oceans by comparing its height with neighboring cells.

    • Return the coordinates in lexicographical order as the output.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 40 minutes
Round difficulty - Medium

Questions on Computer science subjects like OS, DBMS, OOP

  • Q1. What are the different types of memory in operating systems?
  • Ans. 

    Different types of memory in operating systems include RAM, ROM, virtual memory, cache memory, and registers.

    • RAM (Random Access Memory) - volatile memory used for storing data that is actively being used by the CPU

    • ROM (Read-Only Memory) - non-volatile memory that stores firmware and boot-up instructions

    • Virtual Memory - a memory management technique that uses disk space as an extension of RAM

    • Cache Memory - high-speed me...

  • Answered by AI
Round 3 - Video Call 

Round duration - 40 minutes
Round difficulty - Easy

General Discussion on Resume, some in depth questions on a project of interviewer's choice.

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Delhi Technological University. I applied for the job as SDE - Intern in BangaloreEligibility criteria8.5 CGPACurefit interview preparation:Topics to prepare for the interview - Operating System, DBMS, Data Structures and Algorithms, OOPs, Computer NetworksTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Never leave any topic from any chapter or subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : At least have 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : At least have 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

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 Questionnaire 

8 Questions

  • Q1. Implement queue with the help of two stacks
  • Ans. 

    Queue can be implemented using two stacks by maintaining the order of elements in the stacks.

    • Create two stacks, let's call them stack1 and stack2

    • When an element is enqueued, push it to stack1

    • When an element is dequeued, pop all elements from stack1 and push them to stack2

    • Pop the top element from stack2 and return it as the dequeued element

    • If stack2 is empty, repeat step 3

    • To get the front element of the queue, peek the

  • Answered by AI
  • Q2. Iven a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number
  • Q3. What is left join. Give example. And Full outer join?
  • Ans. 

    Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.

    • Left join is used to combine two tables based on a common column.

    • In left join, all records from the left table are returned along with matching records from the right table.

    • If there is no match in the right table, NULL values are returned.

    • Example: SELECT * FROM table1 LEFT JOIN table...

  • Answered by AI
  • Q4. What is magic functions and autoloading in PHP?
  • Ans. 

    Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.

    • Magic functions are used to handle certain events in PHP, such as object creation or property access.

    • Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.

    • Magic functions can be used in conjunction with autoloading to dynamically load classes or handle

  • Answered by AI
  • Q5. Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6, 7, 20, 80, 100} ar3[] = {3, 4, 15, 20, 30, 70, 80, 120} Ou...
  • Ans. 

    Given three sorted arrays, find common elements.

    • Create three pointers to traverse each array

    • Compare the elements at the pointers and move the pointer of the smallest element

    • If all pointers point to the same element, add it to the result and move all pointers

    • Repeat until any pointer reaches the end of its array

  • Answered by AI
  • Q6. A puzzle. You will be given with a 3 Litre container & a 7 Litre Container. Measure exactly 5 Litres of water
  • Q7. Asked about one of my projects I mentioned in my resume?
  • Q8. Find if a number is a power of 2 or not?
  • Ans. 

    Check if a number is a power of 2 or not.

    • A power of 2 has only one bit set in its binary representation.

    • Use bitwise AND operator to check if the number is a power of 2.

    • If n is a power of 2, then n & (n-1) will be 0.

  • Answered by AI

Interview Preparation Tips

Skills: Data structures, PHP, Algortihm
College Name: na
Motivation: Overall it was a very good experience. They test you from every aspect. In the End I would like to say that Practo is one of the best companies to work for.

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. What is event bubbling?
  • Ans. 

    Event bubbling is the propagation of an event from the innermost child element to the outermost parent element.

    • Events triggered on a child element will also trigger on its parent elements

    • The event travels up the DOM tree until it reaches the document object

    • Can be stopped using event.stopPropagation()

    • Can be useful for event delegation

  • Answered by AI
  • Q2. Difference between .on(‘click’,function() and .click(function())
  • Ans. 

    The .on('click',function() is a more flexible method than .click(function())

    • The .on() method can handle multiple events and selectors

    • The .click() method can only handle one event and one selector

    • The .on() method can also handle dynamically added elements

    • The .click() method cannot handle dynamically added elements

  • Answered by AI
  • Q3. Write a function to check if two strings are anagram or not
  • Ans. 

    Function to check if two strings are anagram or not

    • Create two character arrays from the strings

    • Sort the arrays

    • Compare the sorted arrays

  • Answered by AI
  • Q4. Given an array of integers which can be in one of four order – i.Increasing 2.Decreasing 3.decreasing then increasing 4.increasing then decreasing .Write a function to find the type of array
  • Ans. 

    Function to determine the order of integers in an array.

    • Check first and last element to determine if increasing or decreasing

    • Check for inflection point to determine if order changes

    • Return order type as string

  • Answered by AI
  • Q5. How can you improve the performance of a site.(Only frontend)
  • Ans. 

    Optimize images, minify code, reduce HTTP requests, use caching, and lazy loading.

    • Optimize images using compression and appropriate file formats

    • Minify code to reduce file size and improve load times

    • Reduce HTTP requests by combining files and using sprites

    • Use caching to store frequently accessed data locally

    • Implement lazy loading to defer loading of non-critical resources

  • Answered by AI
  • Q6. Design database schema for a movie site.Where user can watch the movie,genre of movie,give ratings and recommended movies to user.Also Write an algorithm to show recommended movies to user
  • Ans. 

    Design a database schema for a movie site with user ratings and recommendations.

    • Create tables for movies, users, ratings, and recommendations

    • Use foreign keys to link tables

    • Include columns for movie genre and user watch history

    • Algorithm for recommendations can use user watch history and ratings to suggest similar movies

  • Answered by AI
  • Q7. By tossing a coin we can get either head or tail, i have a function toss() which return head or tail with equal probability
  • Q8. You have to write a function for dice which will return number from 1-6 with equal probability. constraints : you can not use random function, you can use only toss function
  • Ans. 

    Function to simulate dice roll with equal probability without using random function

    • Use a toss function that returns either 0 or 1 with equal probability

    • Call the toss function 3 times and convert the result to a binary number

    • If the binary number is greater than 0 and less than or equal to 6, return it

    • If the binary number is greater than 6, repeat the process

  • Answered by AI
  • Q9. Write a query to fetch duplicate email from table?
  • Ans. 

    Query to fetch duplicate email from table

    • Use GROUP BY and HAVING clause to filter out duplicates

    • SELECT email, COUNT(*) FROM table_name GROUP BY email HAVING COUNT(*) > 1;

    • This will return all the duplicate emails in the table

  • Answered by AI

Interview Preparation Tips

Skills: data structure, Algorithm
College Name: na
Motivation: Practo is the market leader in digital healthcare management with millions of consumers using our products to find doctors, book appointments and manage their healthcare efficiently. Practo Ray is the platform of choice for the vast majority of doctors and clinics deploying cloud based clinic management solution.I recently got an offer from Practo, here is my interview experience:

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Practo user image BEKKAM VENKATA ADITYA

posted on 27 Sep 2015

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. General questions. Where are you from, tell about yourself etc..,
  • Q2. Asked me about the projects which i have mentioned in my resume
  • Q3. Some algorithmic questions including data structures. Time complexity, space complexity etc.,
  • Q4. How would you design a snake game present in basic nokia mobiles. Just the data structure part and some functions which are used as the game goes on

Interview Preparation Tips

Round: Test
Experience: A bit difficult but sensible way to get started with the selection procedure. Questions purely attack the algorithmic and stastitic aspects.
Tips: Get yourself ready with conceptual clartity regarding algorithms and stastics . Don't be ambitious to attempt all the questions, completely solving one problem would be more than enough for getting through this level.
Duration: 120 minutes
Total Questions: 3

Round: Technical Interview
Experience: Believe me. You never feel inferior, it's really interactive and very friendly. Interviewer gave me a few chances and hints whenever i've gone wrong. Overall interview experience was awesome.
Tips: If you're up to this round, they believe you have the potential. So don't panic if you are unable to answer their questions. Just tell them which aspects which you are comfortable with and they will proceed correspondingly, Just be honest whatsoever.

Skill Tips: Prefer having some revision about the above skills before undergoing the selection process.
Skills: Math Puzzles, Algorithmic Approach To Problem Solving, Data Structures
Duration: 2months
College Name: IIT Madras
Funny Moments: Receiving the offer letter from HR official who visited our campus :)
Contribute & help others!
anonymous
You can choose to be anonymous

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

BugsMirror

No Interviews

INTERVIEWS

Cult.fit

No Interviews

INTERVIEWS

Spark Minda

No Interviews

INTERVIEWS

Freshworks

No Interviews

INTERVIEWS

Freshworks

No Interviews

INTERVIEWS

BugsMirror

No Interviews

INTERVIEWS

Freshworks

No Interviews

INTERVIEWS

Freshworks

No Interviews

Tell us how to improve this page.

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