Given an input array of integers, your goal is to find the numbers repeated or duplicates present in the array in an effective way without using Java Collections. Note, you need to achieve this in O(n) time i.e., you should… Read More!
Given an input array of integers, your goal is to find both smallest and largest number present in the array in an effective way. Note, you need to achieve this in O(n) time i.e., you should be able to find… Read More!
Given an input array of integers, your goal is to find the second biggest element present in the array in an effective way. Note, you need to achieve this in O(n) time i.e., you should be able to find result… Read More!
In our previous articles Simple Linked List and Double-Ended List we have seen how fast and easy it is to insert and delete at the beginning of the linked list. You only have to change one or two references as shown in… Read More!
