Journal

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to find the maximum profit.

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

Given an array nums containing n distinct numbers in the range `[0, n]`, return the only number in the range that is missing from the array.

Given an array of integers, find if the array contains any duplicates.

My first time at LeetCode, a platform for anyone to practice programming skills by solving coding questions, I was strucked by how much I did not understand the prompt question itself for their popular "easy" challenge two sum.

This is my journey to mastering data structures and algorithms, both for myself, helpinng further develop my coding and analitical skills, as well as for being able to have an opportunity at cracking the coding interview