Corecard Software Software Developer Interview Questions and Answers

OnlineCoding Test for 60 mins

Q1. 2 DSA question for 1 hour
Add your answer

Q1. Technical Question around CS concepts
Add your answer

JavaScript questions

Q1. 1 - Easy Medium Question. Discuss the approach with interviewer and then implement it. The code should work, thats important.
Add your answer

Q1. LLD round to design Chess.
Add your answer

Q1. Hiring manager round. Grilling on resume and past experience questions
Add your answer

Time ,speed ,distance

Java application using oops concept

Q1. Inheritance , oops
Add your answer

Q1. Tell me about urself
Add your answer

1 hour interview. Needed to solve parts of single question. Next part would open only after completing the current part

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

Q1. 
Sort 0 and 1 Problem Statement
Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using 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 Check
An integer N is provided, and the task is to determine if N is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.
...read more
Ans. 
Two nested for loops and check if sum equal to given number
Answered Anonymously
Add your answer
Q2. 
Merge Sort Problem Statement
Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.
Example:
Input:
ARR = [5, 3, 8,...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 Problem Statement
Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...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. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
Ans. 
Tip 1 : Have a basic understanding of recycler view
Tip 2 : Recycler with multiple view types
 
Answered Anonymously
Add your answer
Q2. How would you implement various activities related to cart functionality in an e-commerce application?
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.

Not that tough to crack

Main focus is on the problem solving, instead of the answer