GoodTecher

Be a Good Techer and Tech for Good. www.goodtecher.com

Skip to content
Menu
  • Home
  • LeetCode
    • Array
    • Binary Search
    • Binary Tree
    • Depth First Search
    • Design
    • Dynamic Programming
    • Linked List
    • Math
    • Stack
    • String
    • Two Pointers
    • Union Find
  • Useful
  • Posted on August 13, 2020August 13, 2020
  • Array

LeetCode 169. Majority Element

Description https://leetcode.com/problems/majority-element/ Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊…

Continue Reading
  • Posted on August 13, 2020September 29, 2020
  • Binary Tree

LeetCode 297. Serialize and Deserialize Binary Tree

Description https://leetcode.com/problems/serialize-and-deserialize-binary-tree/ Serialization is the process of converting a data structure or object into a sequence of bits so that…

Continue Reading
  • Posted on August 6, 2020August 6, 2020
  • LeetCode

LeetCode 171. Excel Sheet Column Number

Description https://leetcode.com/problems/excel-sheet-column-number/ Given a column title as appear in an Excel sheet, return its corresponding column number. For example: A…

Continue Reading
  • Posted on August 5, 2020August 5, 2020
  • LeetCode

LeetCode 50. Pow(x, n)

Description https://leetcode.com/problems/longest-increasing-subsequence/ Implement pow(x, n), which calculates x raised to the power n (xn). Example 1: Input: 2.00000, 10 Output: 1024.00000 Example 2: Input: 2.10000, 3…

Continue Reading
  • Posted on August 4, 2020August 4, 2020
  • Dynamic Programming

LeetCode 300. Longest Increasing Subsequence

Description https://leetcode.com/problems/longest-increasing-subsequence/ Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4…

Continue Reading
  • Posted on August 4, 2020August 4, 2020
  • LeetCode

LeetCode 172. Factorial Trailing Zeroes

Description https://leetcode.com/problems/factorial-trailing-zeroes/ Given an integer n, return the number of trailing zeroes in n!. Example 1: Input: 3 Output: 0 Explanation: 3! =…

Continue Reading
  • Posted on July 29, 2020September 4, 2020
  • Dynamic Programming

LeetCode 322. Coin Change

Description https://leetcode.com/problems/coin-change/ You are given coins of different denominations and a total amount of money amount. Write a function to compute…

Continue Reading
  • Posted on July 22, 2020July 22, 2020
  • Binary Tree

LeetCode 116. Populating Next Right Pointers in Each Node

Description https://leetcode.com/problems/search-a-2d-matrix-ii/ You are given a perfect binary tree where all leaves are on the same level, and every parent has two children.…

Continue Reading
  • Posted on July 21, 2020July 21, 2020
  • Binary Search

LeetCode 240. Search a 2D Matrix II

Description https://leetcode.com/problems/search-a-2d-matrix-ii/ Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers…

Continue Reading
  • Posted on July 20, 2020July 20, 2020
  • LeetCode

LeetCode 56. Merge Intervals

Description https://leetcode.com/problems/merge-intervals/ Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals…

Continue Reading

Posts navigation

Previous Page Page 1 … Page 6 Page 7 Page 8 … Page 21 Next Page

Follow GoodTecher

Categories

  • HackerRank (1)
  • Interview (5)
  • LeetCode (190)
    • Array (41)
    • Backtracking (10)
    • Binary Search (11)
    • Binary Tree (21)
    • Bit Manipulation (4)
    • Database (1)
    • Depth First Search (6)
    • Design (4)
    • Dynamic Programming (13)
    • Graph (3)
    • Linked List (14)
    • Math (16)
    • Recursion (1)
    • Sorting (5)
    • Stack (8)
    • String (23)
    • Two Pointers (10)
    • Union Find (2)
  • Machine Learning (7)
  • Technical Solutions (2)
  • Useful (2)
© Copyright 2021 – GoodTecher
Cell Theme by DesignOrbital ⋅ Powered by WordPress