1The sliding window technique is useful for:ASorting linked listsBGraph colouringCHash collisionsDProblems on contiguous subarrays or substringsView AnswerDiscussWorkspaceReportSaveEasy
2Which data structure stores elements of the same type in contiguous memory?ALinked listBGraphCArrayDTreeView AnswerDiscussWorkspaceReportSaveEasy
3Rotating an array of n elements by k positions can be done in O(n) time and O(1) space by:ASorting itBBinary searchCReversing parts of the array three timesDUsing a hash tableView AnswerDiscussWorkspaceReportSaveEasy
4A sparse matrix is one in which:AAll elements are equalBIt has no rowsCIt is squareDMost elements are zeroView AnswerDiscussWorkspaceReportSaveEasy
5Which technique finds the maximum-sum subarray in O(n)?ADijkstra's algorithmBKadane's algorithmCBubble sortDBinary searchView AnswerDiscussWorkspaceReportSaveEasy