i
Filter interviews by
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
It wss hard, 1 question was based on Trie data structure, one one graph +dp, and one on heuristic hashmap with collision
Top trending discussions
posted on 29 Jul 2024
I applied via Approached by Company and was interviewed in Jun 2024. There was 1 interview round.
Pivoting columns in SQL involves transforming rows into columns to display data in a different format.
Use the PIVOT keyword in SQL to pivot columns
Specify the columns to pivot on and the values to display in the new columns
Aggregate functions like SUM, AVG, COUNT can be used with PIVOT
Example: SELECT * FROM table_name PIVOT (SUM(value_column) FOR pivot_column IN ('value1', 'value2', 'value3'))
posted on 9 Jul 2024
Binary search is a search algorithm that finds the position of a target value within a sorted array.
Binary search works by repeatedly dividing the search interval in half.
It compares the target value with the middle element of the array.
If the target value matches the middle element, the position is returned.
If the target value is less than the middle element, the search continues on the lower half of the array.
If the ...
An algorithm based on graph is a set of instructions designed to solve problems related to graphs.
Graph algorithms are used to solve problems related to graphs, such as finding the shortest path between two nodes, detecting cycles, and determining connectivity.
Some common graph algorithms include Dijkstra's algorithm for finding the shortest path, Kruskal's algorithm for finding the minimum spanning tree, and Depth Fir...
Scheduling is the process of planning and organizing tasks or resources over a period of time.
Scheduling involves determining the start and end times for tasks or activities.
It helps in optimizing resources and ensuring efficient use of time.
Examples include project scheduling, employee scheduling, and appointment scheduling.
Round robin is a scheduling algorithm that assigns equal time slices to each process in a circular queue.
Each process is given a small unit of time to execute before being moved to the end of the queue.
It ensures fairness by preventing a single process from monopolizing the CPU.
Example: In a round robin scheduling with time quantum of 10ms, processes A, B, and C will each get 10ms of CPU time before moving to the end o
I applied via Approached by Company and was interviewed in Jun 2024. There were 2 interview rounds.
Built an app using dot net and angular
Api related questions
posted on 26 Feb 2024
posted on 4 Nov 2024
I applied via Referral and was interviewed before Nov 2023. There were 3 interview rounds.
In this round, there is aptitude & 2 coding questions.
I applied via Naukri.com and was interviewed before Oct 2023. There were 2 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Feb 2022. There were 5 interview rounds.
based on 1 review
Rating in categories
Web Application Developer
77
salaries
| ₹7.5 L/yr - ₹20 L/yr |
Research Analyst
58
salaries
| ₹2.5 L/yr - ₹9 L/yr |
UI Developer
46
salaries
| ₹4.6 L/yr - ₹11 L/yr |
Softwaretest Engineer
44
salaries
| ₹4.5 L/yr - ₹11.1 L/yr |
Product Operations Analyst
40
salaries
| ₹3.8 L/yr - ₹8 L/yr |
PubMatic
Affle
Komli Media
Vserv Digital Services