A quick overview of the most efficient way to find an integer in a sorted rotated array.
I am a backend JEE developer specialized in technologies like Spring and Hibernate with +3 years of experience. I have been an ICPC competitive programmer using C++ for +5 years. You can check my ICPCID on https://icpc.baylor.edu/ICPCID/VHOFJ5IO88M4
Here's what I've written (so far):
Understand the problem of finding the only unpaired element in an array, and a few approaches to solve it.
Learn how to find the maximum square size filled with ones in a matrix that contains only zeros and ones.
Learn about different ways to implement an integer-based power function and compare their efficiency.
Learn a few algorithms for finding the next smaller element for each element in an array.
Understand the problem of verifying if a number is a power of two, and a few ways to approach it.
A quick and practical overview of reducing a number to one using the minimum number of operations.
A quick and practical introduction to dealing with negative weights while using Dijkstra’s algorithm.
A quick and practical overview of the sock pairing algorithm.
A quick and practical guide to finding the shortest path in a graph visiting all nodes.