Kokan Mercantile Co-operative Bank Interview Questions and Answers

Q1. Tell something about your self
Ans. 
I am a dedicated and detail-oriented Assistant System Analyst with strong problem-solving skills.
• I have a Bachelor's degree in Computer Science and have completed several certifications in system analysis.

• I have experience in analyzing and troubleshooting complex system issues.

• I am proficient in programming languages like Java and Python.

• I have excellent communication skills and can effectively collaborate with cross-f...read more
Answered by AI
View 1 more answer
Q2. Basic of sql,plsql, banking basic like neft rtgs,ifsc code
Add your answer
Q3. Different betn delwte and truncate and drop Store procedure in plsql(optional) Describe with syntex dml,dcl,tcl Triggers in plsql(optional)
Ans. 
The question asks about the differences between delete, truncate, and drop in SQL, as well as the syntax of DML, DCL, and TCL statements.
• DELETE is a DML statement used to remove specific rows from a table.

• TRUNCATE is a DDL statement used to remove all rows from a table.

• DROP is a DDL statement used to remove an entire table from the database.

• DML (Data Manipulation Language) statements are used to manipulate data in the ...read more
Answered by AI
View 1 more answer

Q1. It was one-on-one round with the CTO. They judged me on my technical knowledge as well as understanding of tech-era.
Add your answer
Q2. I was asked question related to the languages and tech-stacks I mentioned in my resume and also question related to OOPs concepts.
Add your answer

Basic Aptitude + Coding + Essay Writing

Q1. Asked Basic Coding questions
Add your answer
Q2. Reverse the input string - Removing numerics
Ans. 
Reverse input string and remove numerics
• Use string manipulation functions to remove numerics

• Reverse the resulting string using a loop or built-in function

• Return the reversed string
Answered by AI
Add your answer
Q3. Print the 100th place digit of given input
Ans. 
To print the 100th place digit of given input
• Extract the input as a string

• Check if the input is at least 100 digits long

• Print the 100th digit from the left
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

Q1. Sort 0 1
You have been given an integer array/list(ARR) of size N that contains only integers, 0 and 1. Write a function to sort this array/list. Think of a solution which scans the array/list only once an...read more
Ans. 
Keep two index variables and traverse from the end.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

Q1. Valid Perfect Square
You have been given an integer ‘N’. You are supposed to find if the given integer ‘N’ is a perfect square or not. A perfect square is an integer that is the square of an integer.
Inpu...read more
Ans. 
Two nested for loops and check if sum equal to given number
Answered Anonymously
Add your answer
Q2. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

Q1. Bottom View Of Binary Tree
Given a binary tree, print its bottom view from left to right. Assume, the left and the right child make a 45-degree angle with the parent.
A binary tree is a tree in which eac...read more
Ans. 
Do a level order traversal and update a hashmap based on horizontal distances from the root.
Answered Anonymously
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

Q1. Puzzle Question
It was an android specific question on how to implement multiple recycler views on a magnified screen.
Ans. 
Tip 1 : Have a basic understanding of recycler view
Tip 2 : Recycler with multiple view types
 
Answered Anonymously
Add your answer
Q2. Puzzle Question
Implement various activities with a cart activity in an e-commerce app.
Ans. 
Tip 1 : Basic flow and lifecycle of activities and fragments.
Tip 2 : Knowledge about launch modes and view models.
 
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

2 rounds of 15 min each
1st was probability and statistics
2nd was data science

A problem statement was given to build a predictive model to help a CFO of an IT company to predict the time taken by an issue to resolve and classify the issue to high and low priority. Give some insights on the dataset to reduce the time to resolve the issue

Q1. What is onehotencoding?
Add your answer
Q2. What do you mean by cross validation?
Add your answer
Q3. Explain Random Forest Classifier.
Add your answer
Q4. What are API and restful API?
Add your answer

Estimate the market size for a babysitter company across India? How will you proceed to expand the company across India?

2 questions. 1 was basic level. 2 was of medium level.

Q1. An ambiguous problem statement was given. Asking relevant questions revealed the problem to be largest island in a binary matrix. Was asked to code on an ide. And reduce space complexity to O(1).
Add your answer
Q2. Maximum sum path from root to leaf in an N-ary tree. Was asked to design an appropriate data structure. Then code the solution in O(n) time and O(1) space.
Add your answer

Q1. Through discuss of projects. Methods used.
Add your answer
Q2. First missing positive number in an array of integer in O(n) time O(1) space.
Ans. 
Find first missing positive number in an array in O(n) time and O(1) space.
• Traverse the array and mark the presence of each positive integer by changing the sign of the corresponding index.

• Traverse the array again and return the index of the first positive integer.

• If all integers are present, return the length of the array + 1.

• Example: [3, 4, -1, 1] => mark 3rd and 4th index as negative => return 2.

• Example: [1, 2, 0] =...read more
Answered by AI
Add your answer
Q3. Given an integer, print the relevant column name in an excel sheet. Ex: 1- A , 2-B.......... 26-Z , 27-AA, 28-AB........ Was asked code on an ide and test cases were given.
Ans. 
Given an integer, print the relevant column name in an excel sheet.
• Create a string array of alphabets from A to Z

• Use modulo operator to get remainder and divide by 26 to get quotient

• Append the corresponding alphabet to the result string

• Reverse the result string
Answered by AI
Add your answer

Q1. What are your salary expectations?
Add your answer