Coding Interview Questions

Example 1: Input: [2,3,-1,3] Output: 6 Explanation: [2,3] are continuous and has the largest product 6. The steps of the working of the…

Example: Input: “prodevelopertutorial is a good website”, Output: ” website good a is prodevelopertutorial”. The…

In reverse polish notation, operands will be first followed by operators. For example, 2 – 3 in reverse polish notation will be 2 3 – 4 + 5…

Example: 3 -> 4 -> 5-> 1 -> 2 Output: 1 -> 2 -> 3 -> 4 -> 5 Merge sort is a divide and conquer algorithm. Here we…

Sort a linked list using insertion sort. Example 1: Input: 4->2->1->3 Output: 1->2->3->4 Example 2: Input:…

Given a singly linked list L: L0→L1→…→Ln-1→Ln, reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→… You may not modify the values in the list’s nodes,…

Your answer should be of greedy approach. You should pack as many words you can in each line. If you cannot fit the whole word, then fill the…

Follow up: Can you solve it without using extra space? Solution Explanation: Take an extra pointer “fast” and assign its starting point to…

Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input: [2,2,1]…

Before solving this problem, it is recommended that you go through “valid sudoku” problem. Check if the given board is valid Sudoku or not…