i
GlobalData
Filter interviews by
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Functions return a single value, while stored procedures can perform multiple operations and return multiple values.
Functions return a single value, while stored procedures can return multiple values.
Functions are called in SQL statements, while stored procedures are called using EXECUTE statement.
Functions cannot have output parameters, while stored procedures can have output parameters.
Functions cannot modify server ...
Custom exceptions can be implemented in MVC by creating a new class that inherits from Exception class.
Create a new class that inherits from Exception class
Override the constructor to pass a custom message to the base Exception class
Throw the custom exception in the MVC controller or service layer
Top trending discussions
First round was on Hacker Earth
I applied via Job Fair and was interviewed in Jan 2024. There were 3 interview rounds.
It was good to know the topics.
Might be good for my skills
I applied via LinkedIn and was interviewed in Jul 2024. There were 2 interview rounds.
Find the minimum element in a rotated sorted array.
Perform binary search to find the pivot point where the array is rotated.
Compare the element at pivot point to the first element to determine which half to search for the minimum.
Continue binary search in the appropriate half to find the minimum element.
API for Instagram application to interact with user data and DB schema to store user information and posts.
API endpoints for user authentication, posting photos, liking photos, following users, etc.
DB schema with tables for users, posts, comments, likes, followers, etc.
Example API endpoint: /users/{userId}/posts to retrieve all posts by a specific user.
Example DB schema: Users table with columns for username, email, pr
I applied via Approached by Company and was interviewed in Mar 2024. There were 2 interview rounds.
I appeared for an interview before Mar 2024, where I was asked the following questions.
A dirty read occurs when a transaction reads data that has been modified but not yet committed by another transaction.
Dirty reads can lead to inconsistencies, as the data may change before the first transaction is committed.
For example, if Transaction A updates a record but hasn't committed yet, and Transaction B reads that record, Transaction B sees uncommitted data.
If Transaction A rolls back, Transaction B will have...
Design patterns are reusable solutions to common software design problems, promoting best practices and improving code maintainability.
Creational patterns (e.g., Singleton, Factory Method) manage object creation.
Structural patterns (e.g., Adapter, Composite) deal with object composition.
Behavioral patterns (e.g., Observer, Strategy) focus on communication between objects.
Design patterns help in code reusability and sca
I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.
3 simple coding questions
Merge sort is a divide and conquer algorithm that recursively divides the input array into smaller subarrays, sorts them, and then merges them back together.
Divide the input list into two halves
Recursively apply merge sort to each half
Merge the sorted halves back together
posted on 3 Nov 2022
I applied via Campus Placement and was interviewed before Nov 2021. There were 3 interview rounds.
There are 30 basic aptitude question in 30 minutes
3 coding question 2 were easy and 1 was of medium level
posted on 11 Mar 2022
I appeared for an interview before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
This was a test round where 10 aptitude based questions were to be solved in 60 minutes
Round duration - 60 minutes
Round difficulty - Medium
They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.
You are given a string STR
which contains alphabets, numbers, and special characters. Your task is to reverse the string.
STR = "abcde"
"e...
Reverse a given string containing alphabets, numbers, and special characters.
Iterate through the string from the end to the beginning and append each character to a new string.
Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.
Handle special characters and numbers along with alphabets while reversing the string.
Ensure to consider the constraints provided in th...
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
The fir...
Implement a function to find K largest elements in an unsorted array in non-decreasing order.
Create a min heap of size K and insert the first K elements of the array
For each remaining element, if it is larger than the root of the heap, replace the root with the element and heapify
Finally, the heap will contain the K largest elements in non-decreasing order
Given a string str
and a character 'X', develop a function to eliminate all instances of 'X' from str
and return the resulting string.
The first lin...
Develop a function to remove all instances of a given character from a string.
Iterate through the string and build a new string excluding the specified character.
Use a StringBuilder or similar data structure for efficient string manipulation.
Handle edge cases like empty string or character not found in the input string.
Ensure the function completes within the given time constraint.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and column to determine the numbers to print
Use a combination of spaces and numbers to align the pattern correctly
Increment the numbers in each row based on the row number
Round duration - 60 minutes
Round difficulty - Easy
Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
An integer ‘T’ denoting the number o...
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
Traverse the tree in postorder fashion and swap the left and right children of each node.
Use recursion to solve the problem efficiently.
Modify the binary tree in place without creating a new tree.
Given an array ARR
consisting of N
integers, your task is to use the Heap sort algorithm to arrange the array in non-decreasing order.
The first line of the input cont...
Implement the Heap sort algorithm to arrange an array in non-decreasing order.
Implement the Heap sort algorithm to sort the given array in non-decreasing order
Use a max heap to sort the array in non-decreasing order
Time complexity of Heap sort is O(n log n)
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
Indexes are created on specific columns in a database table to speed up queries that search for data in those columns.
Indexes work similar to the index of a book, allowing the database to quickly locate the desired data without having to scan the entire table.
Examples of indexes in...
Hash Table is better for fast lookups and insertions, while B Tree is better for range queries and ordered traversal.
Use Hash Table for fast lookups and insertions with O(1) average time complexity.
Use B Tree for range queries and ordered traversal with O(log n) time complexity.
Consider the size of the dataset and the specific operations needed to determine the best data structure.
Round duration - 30 minutes
Round difficulty - Easy
This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Associate Analyst
693
salaries
| ₹2.8 L/yr - ₹5.2 L/yr |
Analyst
594
salaries
| ₹3.5 L/yr - ₹7.6 L/yr |
Senior Analyst
286
salaries
| ₹5.5 L/yr - ₹11 L/yr |
Senior Researcher
218
salaries
| ₹2 L/yr - ₹3.7 L/yr |
Associate Project Manager
133
salaries
| ₹7.5 L/yr - ₹16.6 L/yr |
Crisil
Indegene
Kantar
Acuity Knowledge Partners