i
Finkraft
Filter interviews by
I applied via Approached by Company and was interviewed in Aug 2023. There were 4 interview rounds.
Generic schema design for ERPs involves creating tables for entities like customers, products, orders, etc. with relationships between them.
Identify main entities like customers, products, orders, etc.
Create tables for each entity with relevant attributes.
Establish relationships between entities using foreign keys.
Normalize the database to reduce redundancy and improve efficiency.
Consider scalability and flexibility in
A full stack app with employee details
Top trending discussions
posted on 26 Dec 2024
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
I am a Software Development Engineer with 5 years of experience in developing web applications using Java, Spring, and Angular.
5 years of experience in software development
Proficient in Java, Spring, and Angular
Strong problem-solving skills
Experience in developing web applications
Good team player
posted on 26 Nov 2024
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There were 2 interview rounds.
Aptitude exam content aptitude+tech question
This also a aptitude test+coding
posted on 31 Aug 2023
I applied via Job Fair and was interviewed in Mar 2023. There were 5 interview rounds.
3 coding questions based on Tree and kind of similar to each other. Based on dijkstra algo.
One question that was a bit lengthy, with name 'Tree of Space' you can get it from internet.
I have asked to improved my code from previous round and explain it and then they ask improve your code if if the inputs are in the form of multiple thread.
I applied via campus placement at National Institute of Technology, Surathkal and was interviewed in Sep 2022. There were 4 interview rounds.
20 technical mcqs + 3 coding questions of easy-medium level
posted on 17 Jan 2025
Merge Sort is a divide and conquer algorithm that divides the input array into two halves, recursively sorts them, and then merges the sorted halves.
Divide the input array into two halves
Recursively sort the two halves
Merge the sorted halves back together
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
Choose a pivot element from the array.
Partition the array into two sub-arrays: elements less than the pivot and elements greater than the pivot.
Recursively apply the same process to the sub-arrays.
Combine the sorted sub-arrays to get the final sorted array.
posted on 27 Nov 2024
I applied via Company Website and was interviewed in Apr 2024. There were 3 interview rounds.
Interview experience
based on 1 review
Rating in categories
Data Analyst
4
salaries
| ₹3 L/yr - ₹8 L/yr |
Product Manager
4
salaries
| ₹10 L/yr - ₹18 L/yr |
Product Designer
4
salaries
| ₹5 L/yr - ₹6 L/yr |
Software Developer
3
salaries
| ₹3 L/yr - ₹3 L/yr |
Senior Data Analyst
3
salaries
| ₹12 L/yr - ₹12 L/yr |
Edelweiss
Motilal Oswal Financial Services
HDFC Securities
Kotak Securities