Home
Feed

Extend

Hashnode Pro
Hashnode for Agents

Resources

The foreword
Hashnode gql skill

Buildful - AI coding agent that delivers frontier-level results at a fraction of the cost Bug0 - The AI-native e2e QA regression testing Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap

Search Hashnode

Search posts, tags, users, and pages

Feed/

Discussion

Fastest(?) way to find most frequent element of IEnumerable<int>

Friend got an interview task to code a method that finds and returns the most frequent element in a large list of integers. It took 40 minutes, why so long?

Mar 24, 2023·5 min read·krystianzakrys.hashnode.devRead the article

#csharp
#programming-tips

#algorithms

#data-structures

#developer

Written by

Krystian Zakryś

@krystianzakrys

View profile

👨‍💻 Software Engineer passionate about solving problems and building user-friendly apps. Certified Azure DevOps Engineer & Azure Solutions Architect Expert ☁️ 💻 Proficient in .NET, Angular, and Flutter. 🚀 Focused on fintech innovation and developing my own apps. A strong believer in continuous learning and sharing knowledge through blogs and mentoring. Outside of tech? 🎮 Gamer, 📖 Avid reader, and a fan of Warhammer 40k 🛡️. Exploring the intersection of creativity and code every day!

Responses1

Markdown supported · ⌘↵ to post

Mark Cooke

Mar 24, 2023

I would not take a job where they ask such questions. Because in a business, it's almost always better to go with the cleanest and most maintainable solution, not the most performant. If I had been asked this question, my first response would be "Why does this need to be performant?" Junior developers blindly write code without knowing why something needs to be done a certain way.

Krystian Zakryś

Mar 24, 2023

Theres always pros and cons to take into consideration. Especially with large systems linked to the financial sector ;) That's why I checked how data variety changes finding times. This was a semi-cool experiment I think :)