In this guide, I’ll show you how to create all of the common relationship mappings available using the JPA specification. In my examples, Hibernate is…
Today, we’ll research the LeetCode problem Maximum Product Subarray. Given an integer array nums, find the contiguous subarray within an array (containing at least one number)…
Today we take a look at Maximum Subarray Though problem is a common problem asked during interviews and has a straight forward answer, many struggle…
Today we’re going to look at Longest Increasing Subsequence and we’re going to focus on providing the O(n2) solution. While there is a faster O(nlog(n))…
Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such…
Today, we’ll analyze the popular interview question coin change. You are given coins of different denominations and a total amount of money amount. Write a function…
Today, we’ll talk about the unique paths problem. A robot is located at the top-left corner of a m x n grid. The robot can only move…
Today, we are going to study Leetcode’s house robber. Given a list of non-negative integers representing the amount of money of each house, determine the…
Today, we’ll talk about the classic climbing stairs problem. You are climbing a staircase. It takes n steps to reach the top. Each time you can either…
After doing some harder LeetCode code problems, I decided to do a classic interview problem, FizzBuzz. Up until writing this blog post, I realized that…