Merge Sort
Introduction Merge sort is another popular algorithm, with time complexity as O(nlogn). It’s leveraging the principle of divide and conquer, […]
topics
topics
Quick Sort
Introduction Quick sort is one of the most popular algorithms for sorting. It’s not uncommon to see this algorithm or
solutions
Leetcode 1: Two Sum
This is probably our very first coding preparation question. The original question can found here. This question is asking us
solutions
Leetcode 680: Valid Palindrome II
The original question can be found here. The question is asking if a string is palindromic if at most 1
solutions
Leetcode 125: Valid Palindrome
The original question can be found here. The question is asking for a given string, determine if it’s palindromic. Only
solutions
Leetcode 5: Longest Palindromic Substring
The original question can be found here. There’re multiple solutions to this question, and we’ll start with the brute force
interview-skills
Interview Skills and Coding Styles
Here are some interview skills and coding styles that on top of my head. Interview Skills Try to avoid “I
solutions
Leetcode 4: Median of Two Sorted Arrays
The original question can be found here. The question is asking to return the median number of 2 sorted arrays.
solutions
Leetcode 349: Intersection of two arrays
The original question can be found here. The question is aksing for the intersection of two arrays, and element in
solutions
Leetcode 88: Merge Sorted Array
The original question can be found here. It’s asking us to merge array nums2 into array nums1. The most straightforward