#interviews
Read more stories on Hashnode
Articles with this tag
Given the head of a linked list, return the list after sorting it in ascending order. Follow up: Can you sort the linked list in O(n logn) time and...
Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals k. Example 1: Input: nums =...
Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [3,2,1] Example...
Given k sorted arrays of size n each, merge them and print the sorted output. Example: Input: k = 3, n = 4 arr[][] = { {1, 3, 5, 7}, {2, 4, 6, 8},...