Karvy Stock Broking Python Developer Intern Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

Coding question of medium level difficulty, from DP. 
18 MCQs were core CSE related concepts e.g: OS, OOPs, DBMS, Networking
Time was 90 minutes.

Q1. 
Minimum Cost to Destination
You are given an NxM matrix consisting of '0's and '1's. A '1' signifies that the cell is accessible, whereas a '0' indicates that the cell is blocked. Your task is to compute ...read more
Ans. 
Find the minimum cost to reach a destination in a matrix with blocked cells.
• Use Breadth First Search (BFS) algorithm to explore all possible paths from the starting point to the destination.

• Keep track of the cost incurred at each cell and update it as you move through the matrix.

• Return the minimum cost to reach the destination or -1 if it is unreachable.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

It was an one-to-one interview. It checks your problem solving ability and a few OOPs, OS, DBMS etc concepts. Coding questions were related to array, queue and DP.

Q1. 
Triangle Formation Using Array Elements
Given an integer array/list ARR of length 'N', determine if it is possible to form at least one non-degenerate triangle using the values of the array as the sides o...read more
Ans. 
Determine if it is possible to form a non-degenerate triangle using array elements as sides.
• Check if the sum of any two sides is greater than the third side for all combinations of sides.

• If the above condition is met for any combination, return true; otherwise, return false.
Answered by AI
Add your answer
Q2. 
Maximum Sum of Non-Adjacent Elements
You are given an array/list of integers. The task is to return the maximum sum of a subsequence such that no two elements in the subsequence are adjacent in the given ...read more
Ans. 
Find the maximum sum of non-adjacent elements in an array.
• Use dynamic programming to keep track of the maximum sum at each index, considering whether to include the current element or not.

• At each index, the maximum sum can be either the sum excluding the current element or the sum including the current element but excluding the previous element.

• Iterate through the array and update the maximum sum accordingly.

• Example: F...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was also a problem solving round. However after coding questions, they also asked CSE conceptual questions.

Q1. 
Sum Tree Conversion
Convert a given binary tree into its sum tree. In a sum tree, every node's value is replaced with the sum of its immediate children's values. Leaf nodes are set to 0. Finally, return th...read more
Ans. 
Convert a binary tree into a sum tree by replacing each node's value with the sum of its children's values. Return preorder traversal.
• Traverse the tree in a bottom-up manner, starting from the leaf nodes.

• For each node, update its value to the sum of its children's values.

• Set leaf nodes to 0.

• Return the preorder traversal of the modified tree.
Answered by AI
Add your answer
Q2. What are the core concepts of indexing in Database Management Systems (DBMS)?
Ans. 
Core concepts of indexing in DBMS include types of indexes, benefits of indexing, and factors affecting index performance.
• Types of indexes: B-tree, Hash, Bitmap, etc.

• Benefits of indexing: Faster data retrieval, improved query performance, reduced disk I/O.

• Factors affecting index performance: Selectivity, clustering factor, index fragmentation.

• Examples: Creating an index on a column in a table to speed up search queries
Answered by AI
Add your answer

Such a nice experience

Such a nice experience

Q1. Covered LinkedLists and Trees
Add your answer

Q1. Cultural Assessment Round
Add your answer

Test will be in hacker rank there would be a difficulty level between easy to medium

Q1. Question will be from data structure and easy to medium level of the programming laanguage question
Add your answer

Q1. This is just to check your english ability
Add your answer

Code paring round was conducted. they will assist you what there expectations are

Q1. Interview was good but questions asked was very hard. You must have good technical knowledge.
Add your answer

DSA

About Social changes

Q1. Tell me about yourself.
Add your answer
Q2. Very basic questions
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Mcq + Data structures questions

Q1. 
Maximum Sum Subarray Problem Statement
Given an array of integers, find the maximum sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Output:
137
Exp...read more
Ans. 
Find the maximum sum of any contiguous subarray within an array in O(N) time complexity.
• Use Kadane's algorithm to find the maximum sum subarray in O(N) time complexity

• Initialize two variables: max_sum and current_sum to keep track of the maximum sum subarray

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

• Update max_sum if current_sum is greater than max_sum

• Return...read more
Answered by AI
View 1 more answer

Round duration - 70 minutes
Round difficulty - Medium

Standard System Design round

Q1. Design a Doctor Appointment System and provide some test cases.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Interview of DSA + OOPS + Databse(SQL query) + Operating System

Q1. 
Left View of a Binary Tree
Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.
Inpu...read more
Ans. 
The task is to print the left view of a binary tree, which contains the nodes visible when the tree is viewed from the left side.
• Traverse the tree in a level order manner and keep track of the leftmost node at each level.

• Use a queue to perform level order traversal.

• Print the leftmost node at each level to get the left view of the binary tree.
Answered by AI
Add your answer
Q2. What is the difference between CHAR and VARCHAR2 data types in SQL?
Ans. 
CHAR is fixed length while VARCHAR2 is variable length in SQL.
• CHAR stores fixed length strings, padding with spaces if necessary.

• VARCHAR2 stores variable length strings, not padding with spaces.

• CHAR is faster for fixed length data, VARCHAR2 is more flexible for varying length data.
Answered by AI
View 1 more answer
Q3. What are the various types of constructors in C++?
Ans. 
There are three types of constructors in C++: default constructor, parameterized constructor, and copy constructor.
• Default constructor: Constructor with no parameters.

• Parameterized constructor: Constructor with parameters.

• Copy constructor: Constructor that initializes an object using another object of the same class.

• Example: // Default constructor ClassName() {} // Parameterized constructor ClassName(int x, int y) :...read more
Answered by AI
Add your answer
Q4. What is the difference between overloading and overriding?
Ans. 
Overloading is having multiple methods in the same class with the same name but different parameters, while overriding is implementing a method in a subclass that is already defined in the superclass.
• Overloading involves multiple methods with the same name but different parameters.

• Overriding involves implementing a method in a subclass that is already defined in the superclass.

• Overloading is resolved at compile time ba...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Hr round - normal hr questions + situational 

Thoughtworks community discussion

Q1. Why should we hire you?
Add your answer

Hackerrank coding round.

Q1. Questions and coding testing your OOPS knowledge
Add your answer

Q1. Every tech stack, SQL, OOPS, JAVA
Add your answer