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 July 19, 2021July 19, 2021
  • LeetCode

LeetCode 1100. Find K-Length Substrings With No Repeated Characters

Description https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/ Given a string s, return the number of substrings of length k with no repeated characters. Example 1: Input: s =…

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

LeetCode 994. Rotting Oranges

Description https://leetcode.com/problems/rotting-oranges/ You are given an m x n grid where each cell can have one of three values: 0 representing an empty cell,…

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

LeetCode 413. Arithmetic Slices

Description https://leetcode.com/problems/arithmetic-slices/ An integer array is called arithmetic if it consists of at least three elements and if the difference between any…

Continue Reading
  • Posted on July 18, 2021July 18, 2021
  • Design

LeetCode 981. Time Based Key-Value Store

Description https://leetcode.com/problems/time-based-key-value-store/ Design a time-based key-value data structure that can store multiple values for the same key at different time…

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

LeetCode 1929. Concatenation of Array

Description https://leetcode.com/problems/concatenation-of-array/ Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0…

Continue Reading
  • Posted on July 17, 2021July 17, 2021
  • Design

LeetCode 398. Random Pick Index

Description https://leetcode.com/problems/random-pick-index/ Given an integer array nums with possible duplicates, randomly output the index of a given target number. You can assume that the given…

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

LeetCode 117. Populating Next Right Pointers in Each Node II

Description https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/ Given a binary tree struct Node { int val; Node *left; Node *right; Node *next; } Populate each…

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

LeetCode 1920. Build Array from Permutation

Description https://leetcode.com/problems/build-array-from-permutation/ Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based…

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

LeetCode 295. Find Median from Data Stream

Description https://leetcode.com/problems/find-median-from-data-stream/ The median is the middle value in an ordered integer list. If the size of the list is even, there…

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

LeetCode 143. Reorder List

Description https://leetcode.com/problems/reorder-list/ You are given the head of a singly linked-list. The list can be represented as: L0 → L1…

Continue Reading

Posts navigation

Previous Page Page 1 … Page 7 Page 8 Page 9 … 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