Filter interviews by
I applied via Recruitment Consultant and was interviewed in Jan 2021. There was 1 interview round.
Program to find the second-highest number in a List, without sorting.
Iterate through the list and keep track of the highest and second-highest numbers.
Compare each number with the highest and second-highest numbers and update accordingly.
Return the second-highest number.
CAP theorem states that a distributed system cannot guarantee consistency, availability, and partition tolerance at the same time.
Consistency: all nodes see the same data at the same time
Availability: every request receives a response, without guarantee that it contains the most recent version of the information
Partition tolerance: system continues to function even when network partitions occur
Examples: Cassandra prior...
A Binary Search Tree is a data structure where each node has at most two children and the left child is smaller than the parent while the right child is greater.
Nodes are arranged in a hierarchical order.
Searching, insertion, and deletion can be done in O(log n) time complexity.
In-order traversal of a BST gives the nodes in sorted order.
Example: 5 is the root node, 3 is its left child, and 7 is its right child. 2 is th...
Top trending discussions
posted on 15 Jul 2022
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
If you are a fresher , then this is for you else almost no coding test for experienced candidates.
Fizz buzz question and array related
posted on 7 Jan 2025
I applied via Naukri.com and was interviewed in Dec 2024. There was 1 interview round.
posted on 15 May 2025
I appeared for an interview before May 2024, where I was asked the following questions.
Optimize slow MySQL queries by analyzing execution plans, indexing, and rewriting queries for efficiency.
Use EXPLAIN to analyze query execution plans: EXPLAIN SELECT * FROM users WHERE age > 30;
Create appropriate indexes: CREATE INDEX idx_age ON users(age);
Avoid SELECT *; specify only needed columns: SELECT name, email FROM users;
Use JOINs instead of subqueries when possible: SELECT u.name FROM users u JOIN orders o...
A closure in JavaScript is a function that retains access to its lexical scope, even when executed outside that scope.
Closures allow a function to access variables from an outer function's scope even after the outer function has finished executing.
Example: function outer() { let count = 0; return function inner() { count++; return count; }; } const increment = outer(); increment(); // returns 1
Closures are often used f...
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
General topics like mathe, English, social etc
It represents the eligibility of person and thinking process ,view of thoughts
Skills ,fast typing , experienced ,new ideas
Deeply study case and make a point to make attractive
I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.
I appeared for an interview in Jul 2024.
Leet code medium level question
Guide to completing a RESTful API coding task with essential pointers and examples.
Understand REST principles: Use HTTP methods (GET, POST, PUT, DELETE) appropriately.
Define clear endpoints: Example - /api/users for user-related operations.
Implement status codes: Use 200 for success, 404 for not found, 500 for server errors.
Use JSON for data interchange: Ensure requests and responses are in JSON format.
Consider authent...
A hashmap is a data structure that stores key-value pairs for efficient data retrieval using a hash function.
Uses a hash function to compute an index for storing values.
Handles collisions using methods like chaining or open addressing.
Example: Inserting a key-value pair (key: 'apple', value: 1) involves hashing 'apple' to find an index.
Retrieving a value involves hashing the key again to find the corresponding index.
Managing multiple events on a single variable requires careful synchronization to ensure accurate results.
Use locks or mutexes to prevent race conditions when accessing the variable.
Implement event debouncing to limit the frequency of updates, ensuring only the final event is processed.
Utilize a queue to handle events sequentially, processing them one at a time to maintain accuracy.
Consider using atomic operations for ...
Software Engineer
249
salaries
| ₹11.6 L/yr - ₹20.2 L/yr |
Senior Software Engineer
132
salaries
| ₹16 L/yr - ₹26.9 L/yr |
QA Engineer
70
salaries
| ₹5.9 L/yr - ₹12.4 L/yr |
Software Developer
55
salaries
| ₹10 L/yr - ₹17.5 L/yr |
Softwaretest Engineer
43
salaries
| ₹3.4 L/yr - ₹7.2 L/yr |
Maxgen Technologies
JoulestoWatts Business Solutions
Value Point Systems
F1 Info Solutions and Services