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: Goldman Sachs Interview Question

  • Posted on December 29, 2018April 4, 2020
  • Dynamic Programming

LeetCode 70. Climbing Stairs

Description https://leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you can either…

Continue Reading
  • Posted on August 26, 2018September 25, 2020
  • LeetCode

LeetCode 387. First Unique Character in a String

Description Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return…

Continue Reading

Follow GoodTecher

Categories

  • HackerRank (1)
  • Interview (5)
  • LeetCode (187)
    • Array (41)
    • Backtracking (10)
    • Binary Search (11)
    • Binary Tree (20)
    • Bit Manipulation (4)
    • Depth First Search (6)
    • Design (4)
    • Dynamic Programming (13)
    • Graph (3)
    • Linked List (13)
    • 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