i
Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2021. There was 1 interview round.
Serialization is the process of converting complex data structures into a format that can be stored or transmitted.
Python provides several modules for serialization such as pickle, json, and msgpack.
Pickle is used for serializing and de-serializing Python objects.
JSON is used for serializing and de-serializing data in a human-readable format.
Msgpack is used for serializing and de-serializing data in a compact binary fo...
Joins in SQL are used to combine data from two or more tables based on a related column.
Types of joins include inner join, left join, right join, and full outer join.
Inner join returns only the matching rows from both tables.
Left join returns all the rows from the left table and matching rows from the right table.
Right join returns all the rows from the right table and matching rows from the left table.
Full outer join ...
API authentication using tokens
Tokens are unique strings generated by the server and sent to the client upon successful login
The client then sends the token with each subsequent request to the server
The server verifies the token and grants access to the requested resource if the token is valid
Tokens can have an expiration time to ensure security
Common token-based authentication methods include JWT and OAuth
I applied via Recruitment Consultant and was interviewed in Apr 2021. There was 1 interview round.
Niyuj Enterprise Software Solutions interview questions for popular designations
Top trending discussions
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
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 Campus Placement and was interviewed before Feb 2023. There were 3 interview rounds.
I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jul 2024. There were 3 interview rounds.
based on 2 interviews
Interview experience
based on 32 reviews
Rating in categories
Software Engineer
61
salaries
| ₹5.8 L/yr - ₹17 L/yr |
Senior Software Engineer
32
salaries
| ₹9.4 L/yr - ₹30 L/yr |
Associate Software Engineer
16
salaries
| ₹4.8 L/yr - ₹8 L/yr |
Software Quality Engineer
16
salaries
| ₹5 L/yr - ₹11 L/yr |
Software Developer
11
salaries
| ₹5.1 L/yr - ₹20 L/yr |
Maxgen Technologies
Magic Edtech
VDart
Value Point Systems