CNoodle

[LeetCode] 98. Validate Binary Search Tree

Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s ke

2020-01-31

#leetcode #java #javascript #tree #inorder #bst

938. Range Sum of BST

Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high]. Example 1:Input: root = [10,5,15,

2020-01-30

#leetcode #java #tree #recursion #bst

[LeetCode] 169. Majority Element

Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the

2020-01-28

#leetcode #array #hashmap #java #javascript #math

[LeetCode] 49. Group Anagrams

Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typ

2020-01-24

#leetcode #array #hashmap #java #javascript #counting sort

[LeetCode] 451. Sort Characters By Frequency

Given a string s, sort it in decreasing order based on the frequency of characters, and return the sorted string. Example 1:Input: s = “tree”Output: “eert”Explanation: ‘e’ appears twice while ‘r’

2020-01-23

#leetcode #hashmap #java #sort #bucket sort #string #heap

[LeetCode] 138. Copy List with Random Pointer

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. Construct a deep copy of the list. The deep copy shoul

2020-01-18

#leetcode #hashmap #java #javascript #linked list

[LeetCode] 9. Palindrome Number

Given an integer x, return true if x is a palindrome, and false otherwise. Example 1:Input: x = 121Output: trueExplanation: 121 reads as 121 from left to right and from right to left. Example 2:I

2020-01-16

#leetcode #two pointer #java #javascript #math #palindrome

[LeetCode] 589. N-ary Tree Preorder Traversal

Given the root of an n-ary tree, return the preorder traversal of its nodes’ values. Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by

2020-01-15

#leetcode #java #tree #dfs #preorder #n-ary tree

[LeetCode] 506. Relative Ranks

You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique. The athletes are placed based on their scor

2020-01-14

#leetcode #array #java #bucket sort #heap

[LeetCode] 513. Find Bottom Left Tree Value

Given the root of a binary tree, return the leftmost value in the last row of the tree. Example 1:Input: root = [2,1,3]Output: 1 Example 2:Input: root = [1,2,3,4,null,5,6,null,null,7]Output:

2020-01-14

#leetcode #java #javascript #tree #bfs #dfs #preorder