Filter interviews by
I applied via Walk-in and was interviewed before May 2020. There were 4 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.
Quants, Logical aptitude. 3 coding questions, included Maximum Sum Subarray
Any recent trending topic.
OOPs concepts and pillars. Design a Vehicle class based on requirements.
OOPs concepts: Abstraction, Encapsulation, Inheritance, Polymorphism
Vehicle class requirements: attributes like make, model, year, methods like start, stop, accelerate
Bounteous is an innovative digital agency that values collaboration, creativity, and impactful solutions for clients.
Culture of Collaboration: Bounteous fosters a team-oriented environment where diverse ideas are welcomed, enhancing creativity and innovation.
Focus on Impactful Solutions: The company prioritizes delivering meaningful results for clients, as seen in their successful projects like the redesign of major e-...
I applied via Approached by Company and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Walk-in and was interviewed before Nov 2020. There were 3 interview rounds.
I applied via Walk-in and was interviewed before Jul 2021. There were 3 interview rounds.
Data structures and algorithms
Python etl,pandas, pyspark questions
I applied via first naukari and was interviewed before Oct 2020. There were 4 interview rounds.
To find the shortest path in a graph stored in SQL, use algorithms like Dijkstra's or A* with SQL queries for traversal.
Use Dijkstra's algorithm for weighted graphs to find the shortest path efficiently.
For unweighted graphs, consider using Breadth-First Search (BFS).
Store graph edges in a table with columns for source, destination, and weight.
Example SQL query: SELECT * FROM edges WHERE source = 'A' AND destination = ...
I appeared for an interview in Sep 2020.
I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.
Hashtable is synchronized while hashmap is not.
Hashtable is thread-safe while hashmap is not.
Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.
Hashtable is slower than hashmap due to synchronization.
Hashtable is a legacy class while hashmap is a newer implementation.
Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.
Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.
Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.
Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.
Concurrent Hashmap is slower than Hashma...
I appeared for an interview in Sep 2019.
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
based on 1 review
Rating in categories
Quality Controller
153
salaries
| ₹1 L/yr - ₹3 L/yr |
Technical Editor
89
salaries
| ₹1 L/yr - ₹3 L/yr |
Project Manager
84
salaries
| ₹1.8 L/yr - ₹5.5 L/yr |
Project Management Executive
80
salaries
| ₹1.3 L/yr - ₹4.1 L/yr |
Programmer
64
salaries
| ₹3.5 L/yr - ₹7 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant