Try  HackMD Logo HackMD

Problem

https://leetcode.com/problems/minimum-index-of-a-valid-split/description/


Optimal Space & Time Complexity 
- Time complexity: O(n) where n is arr.length
- Space complexity: O(1)

Solutions

東

Hao

YC

SOL

Supplement / Discussion

東

Hao

[Javascript] Boyer-Moore Voting Algorithm

  1. If a number is the majority element on the left and right arrays, that means it is the majority element in the overall array.

    • Therefore, we only need to find the majority element on the overall array, then count the occurance of this element on the left and right arrays for each split.
    • Intuitive: Hash table, space complexity O(n)
    • Optimal: Boyer-Moore Majority Voting Algorithm, space complexity O(1)

  2. Return the first index of a split where both the left and right arrays have the majority element equal to the overall majority element.

[Note 1] We could also employ a runningFlags to record the amount of the majority in subArray(0, n) (reference)

YC

SOL

Last changed by 
 
哩扣寶寶船
0
119

Read more

#2 [Leetcode.21](https://leetcode.com/problems/merge-two-sorted-lists/) Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Feb 2, 2025
Merging Linked Lists

You're given two Linked Lists of potentially unequal length. These Linked Lists potentially merge at a shared intersection node. Write a function that returns the intersection node or returns None / null if there is no intersection.Each LinkedList node has an integer value as well as a next node pointing to the next node in the list or to None null if it's the tail of the list.Note: Your function should return an existing node. It should not modify either Linked List, and it should not create any new Linked Lists.

Feb 2, 2025
Remove Kth Node From End

Write a function that takes in the head of a Singly Linked List and an integer k and removes the kth node from the end of the list.The removal should be done in place, meaning that the original data structure should be mutated (no new structure should be created).Furthermore, the input head of the linked list should remain the head of the linked list after the removal is done, even if the head is the node that's supposed to be removed. In other words, if the head is the node that's supposed to be removed, your function should simply mutate its value and next pointer.Note that your function doesn't need to return anything.You can assume that the input Linked List will always have at least two nodes and, more specifically, at least k nodes.Each LinkedList node has an integer value as well as a next node pointing to the next node in the list or to None / null if it's the tail of the list.

Feb 2, 2025
121. Best Time to Buy and Sell Stock

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/solutions/1735550/python-javascript-easy-solution-with-very-clear-explanation/

Aug 27, 2023
Read more from 哩扣寶寶船
Published on HackMD