Leetcode 658: Find K Closest Elements
The original question can be found here. The question is asking to return the k closet elements to target x. […]
solutions
solutions
Leetcode 702: Search in a Sorted Array of Unknown Size
The original question can be found here. The question is asking us to return the index of a target element,
solutions
Leetcode 34: Find First and Last Position of Element in Sorted Array
The original question can be found here. The question is asking to return a tuple with first and last position
solutions
Leetcode 704: Binary Search
The original question can be found here. The question is asking us to perform a binary search on an sorted
java
Java Optional: Is It Useful?
Introduction Java Optional is a container class that encapsulates an optional value, which was introduced by Java 8. However, I
topics
Infer Algorithm By Time Complexity
Introduction Sometimes we need to infer algorithms by time complexity. After we bring out the brute force solution, the interviewer
topics
Binary Search
Introduction Binary search is a very popular algorithm for finding a target element in a sorted array. Algorithm Here’s a
solutions
Leetcode 509: Fibonacci Number
The original question can be found here. The question is asking to return the Nth fibonacci number. F(0) = 0,
topics
Quick Select
Introduction Quick select is an algorithm used to quickly locate the Kth largest/smallest element in an array. Technically speaking, it’s