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

Tag: Adobe Interview Question

  • Posted on August 8, 2021August 8, 2021
  • LeetCode

LeetCode 231. Power of Two

Description https://leetcode.com/problems/power-of-two/ Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two,…

Continue Reading
  • Posted on August 3, 2021August 3, 2021
  • LeetCode

LeetCode 1016. Binary String With Substrings Representing 1 To N

Description https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n/ Given a binary string s (a string consisting only of ‘0’ and ‘1’s) and a positive integer n, return true if…

Continue Reading
  • Posted on August 2, 2021August 2, 2021
  • Array

LeetCode 229. Majority Element II

Description https://leetcode.com/problems/majority-element-ii/ Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. Follow-up: Could you solve…

Continue Reading
  • Posted on August 1, 2021August 1, 2021
  • Binary Tree

LeetCode 814. Binary Tree Pruning

Description https://leetcode.com/problems/matrix-block-sum/ Given the root of a binary tree, return the same tree where every subtree (of the given tree) not containing a 1 has…

Continue Reading
  • Posted on July 31, 2021July 31, 2021
  • Array

LeetCode 1314. Matrix Block Sum

Description https://leetcode.com/problems/matrix-block-sum/ Given a m x n matrix mat and an integer k, return a matrix answer where each answer[i][j] is the sum of all elements mat[r][c] for: i – k <=…

Continue Reading
  • Posted on July 29, 2021July 29, 2021
  • Array

LeetCode 628. Maximum Product of Three Numbers

Description https://leetcode.com/problems/maximum-product-of-three-numbers/ Given an integer array nums, find three numbers whose product is maximum and return the maximum product. Example 1: Input:…

Continue Reading
  • Posted on July 27, 2021July 27, 2021
  • LeetCode

LeetCode 142. Linked List Cycle II

Description https://leetcode.com/problems/linked-list-cycle-ii/ Given a linked list, return the node where the cycle begins. If there is no cycle, return null. There…

Continue Reading
  • Posted on July 21, 2021July 21, 2021
  • Binary Tree

LeetCode 1650. Lowest Common Ancestor of a Binary Tree III

Description https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/ Given two nodes of a binary tree p and q, return their lowest common ancestor (LCA). Each node will have a reference to its…

Continue Reading
  • Posted on July 19, 2021August 17, 2021
  • Interview

Essential Interview Questions

Introduction This is a GoodTecher compiled list. Each question is a typical question for the category it represents. To solve…

Continue Reading
  • Posted on July 19, 2021July 19, 2021
  • LeetCode

LeetCode 859. Buddy Strings

Description https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/ Given two strings s and goal, return true if you can swap two letters in s so the result is equal to goal, otherwise, return false. Swapping…

Continue Reading

Posts navigation

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

Follow GoodTecher

Categories

  • HackerRank (1)
  • Interview (7)
  • LeetCode (588)
    • Array (185)
    • Backtracking (18)
    • Binary Search (19)
    • Binary Tree (63)
    • Bit Manipulation (15)
    • Database (40)
    • Depth First Search (6)
    • Design (10)
    • Dynamic Programming (17)
    • Graph (18)
    • Greedy (5)
    • Heap (1)
    • Linked List (26)
    • Math (36)
    • Recursion (3)
    • Sorting (11)
    • Stack (11)
    • String (95)
    • Two Pointers (12)
    • Union Find (2)
  • Machine Learning (7)
  • Technical Solutions (2)
  • Useful (3)
© Copyright 2025 – GoodTecher
Cell Theme by DesignOrbital ⋅ Powered by WordPress