i
kipi.ai
Filter interviews by
Mostly sql based questions
I applied via Company Website and was interviewed in Apr 2023. There were 2 interview rounds.
A zero coupon bond is a bond that pays no interest and is sold at a discount to its face value.
Zero coupon bonds are also known as discount bonds.
Investors buy these bonds at a price lower than their face value and receive the full face value at maturity.
The difference between the purchase price and the face value is the investor's return.
Zero coupon bonds are often used for long-term investments, such as retirement sa...
Corporate actions are events initiated by a company that can affect its stock price and shareholders. They are recorded in books through various accounting entries.
Corporate actions include stock splits, dividends, mergers, acquisitions, and spin-offs.
These actions are recorded in books through journal entries and adjustments to accounts such as retained earnings and stockholders' equity.
For example, if a company decla...
I applied via Approached by Company
Joining tables with different joins in SQL
Use INNER JOIN to return rows when there is at least one match in both tables
Use LEFT JOIN to return all rows from the left table and the matched rows from the right table
Use RIGHT JOIN to return all rows from the right table and the matched rows from the left table
Use FULL JOIN to return rows when there is a match in one of the tables
I applied via Walk-in and was interviewed before Aug 2022. There were 4 interview rounds.
Test of SQL, Tableau and other skills based on your resume on Skillate
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Dec 2022. There were 4 interview rounds.
Again further basic technical discussion for half time and a coding problem
Again same as round 2 and coding test
Discussion abt tech stack and worked assignments and ending with a coding test .This round happens for more experienced ppl by project lead/learning director level guys.The result wl told in their attitude and words here if salary you are expecting is out of their budget..Total wasted my time
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 60 mins
Round difficulty - Medium
Given a railway seat number represented as an integer, determine if it is a valid seat number and identify its berth type. Possible berth types include lower berth, middle...
Given a railway seat number, determine if it is valid and identify its berth type.
Parse input integer 't' for number of test cases
For each test case, check if seat number is valid (1 <= N <= 100)
Identify berth type based on seat number and output the result
Possible berth types are Lower, Middle, Upper, Side Lower, and Side Upper
Round duration - 90 mins
Round difficulty - Hard
First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.
You are provided with a square matrix. Your task is to return true
if the matrix is symmetric; otherwise, return false
.
A symmetric matrix is characterized by its transpose being eq...
Check if a square matrix is symmetric by comparing it with its transpose.
Iterate through the matrix and compare each element with its corresponding element in the transpose
If any pair of elements do not match, return false immediately
If all pairs match, return true at the end
Tip 1 : Clear the basic concepts of data structure and OOPs.
Tip 2 : Use coding ninja platform and Hackerearth for practice on coding skills.
Tip 3 : Use Geeks For Geeks for interview preparation.
Tip 1: Make your resume short and try to make it of one page only.
Tip 2: Add relevant keywords
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Referral and was interviewed in Jan 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Nov 2020. There were 3 interview rounds.
based on 1 interview
Interview experience
Senior Software Engineer
173
salaries
| ₹6 L/yr - ₹17.5 L/yr |
Lead Engineer
111
salaries
| ₹10.6 L/yr - ₹30 L/yr |
Software Engineer
64
salaries
| ₹5 L/yr - ₹10 L/yr |
Senior Leader Engineer
57
salaries
| ₹18.5 L/yr - ₹42 L/yr |
Solution Architect
40
salaries
| ₹28 L/yr - ₹56 L/yr |
Medcode
Maxgen Technologies
Cyfuture
Value Point Systems