GeeksforGeeks Question · Aug 2019

DailyHunt On Campus Interview-FTE-August 2019

SWE OA Easy
Sign in to bookmark Original →

Question Details

Online test:There were 6 MCQs and 2 coding questions. MCQs were on graphs, segment trees, interpolation, sorting algorithms.Coding questions were1) Given a string N contai...

Full Details

🔒

Unlock all Dailyhunt questions

Full insider details, leaked discussions, and candidate experiences.

Get full access — $100 a year, unlimited access

About This Question

This is a reported interview question from a dailyhunt interview for a swe role during the oa round reported in 2019.

It covers the following topics: Trees, Strings, Sql, Backtracking, Recursion, Sorting, Graphs, Arrays .

Difficulty rating: Easy

Topics

Trees Strings Sql Backtracking Recursion Sorting Graphs Arrays

More Dailyhunt Interview Questions

GeeksforGeeks Dailyhunt Recruitment Process GeeksforGeeks Dailyhunt (Verse Innovation) Interview Experience | Software Engineer GeeksforGeeks DailyHunt Interview Experience | On-Campus FTE - August 2019 GeeksforGeeks Dailyhunt Interview Experience | Set 1 (On Campus)
← All Dailyhunt questions Dailyhunt Software Engineer Questions → All Arrays Questions →