Filter interviews by
Identify duplicates in an array using various methods like hashing, sorting, or nested loops.
1. Hashing: Use a hash set to track seen elements. Example: For ['apple', 'banana', 'apple'], add to set and check for duplicates.
2. Sorting: Sort the array and check adjacent elements. Example: For ['banana', 'apple', 'apple'], sort to ['apple', 'apple', 'banana'] and find duplicates.
3. Nested Loops: Compare each element ...
Binary search is an efficient algorithm for finding an item from a sorted list of items.
Requires a sorted array to function correctly.
Divides the search interval in half with each iteration.
If the target value is less than the middle element, search the left half.
If the target value is greater, search the right half.
Example: Searching for 7 in [1, 3, 5, 7, 9] results in finding 7 at index 3.
To avoid overfitting of ML model, use techniques like cross-validation, regularization, early stopping, and increasing training data.
Use cross-validation to evaluate model performance on different subsets of data.
Apply regularization techniques like L1 or L2 regularization to penalize complex models.
Implement early stopping to prevent the model from training for too long and overfitting.
Increase training data to p...
The OSI model is a conceptual framework that defines the functions of a network protocol stack.
The OSI model consists of seven layers: Physical, Data Link, Network, Transport, Session, Presentation, and Application.
Each layer has its own specific functions and protocols.
The model helps in understanding how different network protocols interact and communicate with each other.
For example, when you open a website in ...
Reversing a linked list involves changing the direction of the pointers between nodes.
Iterative approach: Use three pointers (prev, current, next) to reverse links.
Example: For list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Recursive approach: Reverse the rest of the list and adjust pointers.
Example: Base case when current is null, then set head to last node.
By providing self-service options and resources, such as FAQs and online documentation.
Create a comprehensive FAQ section on the company's website
Develop an online knowledge base with step-by-step guides and troubleshooting tips
Offer live chat support with automated responses and chatbots
Provide video tutorials and instructional videos
Implement a community forum where customers can help each other
I have read several technical books on programming languages, algorithms, and software design.
Clean Code by Robert C. Martin
The Pragmatic Programmer by Andrew Hunt and David Thomas
Cracking the Coding Interview by Gayle Laakmann McDowell
Design Patterns: Elements of Reusable Object-Oriented Software by Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides
I appeared for an interview in Mar 2025, where I was asked the following questions.
Identify duplicates in an array using various methods like hashing, sorting, or nested loops.
1. Hashing: Use a hash set to track seen elements. Example: For ['apple', 'banana', 'apple'], add to set and check for duplicates.
2. Sorting: Sort the array and check adjacent elements. Example: For ['banana', 'apple', 'apple'], sort to ['apple', 'apple', 'banana'] and find duplicates.
3. Nested Loops: Compare each element with ...
Binary search is an efficient algorithm for finding an item from a sorted list of items.
Requires a sorted array to function correctly.
Divides the search interval in half with each iteration.
If the target value is less than the middle element, search the left half.
If the target value is greater, search the right half.
Example: Searching for 7 in [1, 3, 5, 7, 9] results in finding 7 at index 3.
MCQ(objective ) question... computer based exam about computer skills
They will give one concept and conduct debate candidates will speak argue advantage and disadvantage about that concept
I applied via Campus Placement and was interviewed in Mar 2024. There was 1 interview round.
Dsa gfg and leetcode
I applied via Approached by Company and was interviewed in Dec 2023. There was 1 interview round.
I applied via Company Website and was interviewed in Jul 2023. There were 4 interview rounds.
I applied via Job Fair and was interviewed before Aug 2023. There was 1 interview round.
I applied via Campus Placement and was interviewed before Nov 2022. There were 4 interview rounds.
2 DSA coding questions
Top trending discussions
The duration of Nokia Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 16 interview experiences
Difficulty level
Duration
based on 67 reviews
Rating in categories
Software Engineer
620
salaries
| ₹7.1 L/yr - ₹19.3 L/yr |
Technical Lead
584
salaries
| ₹12.3 L/yr - ₹28.1 L/yr |
Technical Specialist
511
salaries
| ₹17.5 L/yr - ₹29 L/yr |
R&D Engineer
481
salaries
| ₹9.9 L/yr - ₹21.2 L/yr |
Senior Software Engineer
317
salaries
| ₹15.1 L/yr - ₹32.7 L/yr |
Jio
Vodafone Idea
Bharti Airtel
Ericsson