Faster and better experience!
Filter interviews by
My strengths include adaptability, problem-solving, and teamwork. My weaknesses include public speaking and time management.
Strengths: adaptability - I am able to adjust to new situations quickly and efficiently, problem-solving - I am able to think critically and find solutions to complex problems, teamwork - I work well with others and am able to collaborate effectively.
Weaknesses: public speaking - I get nervous whe...
Top trending discussions
I applied via Campus Placement and was interviewed before May 2020.Β There were 4 interview rounds.
I am a detail-oriented Business Analyst with a strong background in data analysis and project management, passionate about driving business success.
Over 5 years of experience in business analysis across various industries, including finance and healthcare.
Skilled in gathering and documenting requirements through stakeholder interviews and workshops, leading to successful project outcomes.
Proficient in data visualizatio...
I applied via Naukri.com and was interviewed before Jul 2020.Β There were 3 interview rounds.
Performa is a performance monitoring tool for HPE 3PAR storage arrays.
Performa provides real-time monitoring of storage performance metrics.
It helps identify performance bottlenecks and optimize storage performance.
Performa can generate reports and alerts based on user-defined thresholds.
It can also be used for capacity planning and trend analysis.
Examples of performance metrics monitored by Performa include IOPS, late...
I applied via Company Website and was interviewed before Jun 2020.Β There were 4 interview rounds.
MongoDB database algorithms are used for efficient data storage, retrieval, and processing.
MongoDB uses various algorithms for indexing, sharding, and aggregation.
Indexing algorithms include B-tree, hash, and text search indexes.
Sharding algorithms include range-based, hash-based, and zone-based sharding.
Aggregation algorithms include map-reduce and aggregation pipeline.
MongoDB also uses algorithms for query optimizati...
I applied via Company Website and was interviewed before Oct 2020.Β There was 1 interview round.
I applied via LinkedIn and was interviewed before Jun 2021.Β There were 2 interview rounds.
I applied via Company Website and was interviewed before Jan 2020.Β There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Feb 2020.Β There were 3 interview rounds.
Quicksort has an average and best-case time complexity of O(n log n) and worst-case of O(n^2).
Quicksort is a divide-and-conquer algorithm that recursively partitions an array into two sub-arrays based on a pivot element.
The average and best-case time complexity is O(n log n) because each partition divides the array into roughly equal halves.
The worst-case time complexity is O(n^2) when the pivot element is the smallest...
I applied via Naukri.com and was interviewed before Dec 2020.Β There were 3 interview rounds.
I applied via Referral and was interviewed before Oct 2020.Β There were 3 interview rounds.
based on 1 interview experience
TCS
Accenture
Wipro
Cognizant