Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Series: Base Conversion Problems & Follow-Up

Posted on August 10, 2018September 20, 2019 by braindenny

Base Conversion problems

  • CheatSheet: Leetcode For Code Interview

See all series problems: #series

  • LintCode: K Decimal Addition
  • Leetcode: ZigZag Conversion
  • Leetcode: Gray Code
  • Leetcode: Excel Sheet Column Title
  • Leetcode: Excel Sheet Column Number
  • Leetcode: Encode and Decode TinyURL
  • Leetcode: Convert to Base -2
  • Leetcode: Complement of Base 10 Integer
  • Leetcode: Base 7

See more blog_posts.

linkedin
github
slack
Post Views: 8
Posted in UncategorizedTagged series

Post navigation

Series: Expression Problems & Follow-Up
LintCode: Take the element and query the sum

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #misc #palindrome #recursive #slidingwindow #stack #string #subarray #subsequence #trie #twopointer #twosum binarysearch editdistance hashmap knapsack monotone oodesign presum redo review rotatelist series sql topologicalsort treetraversal unionfind

Recent Posts

  • Leetcode: Biggest Single Number
  • Leetcode: Max Consecutive Ones II
  • Leetcode: Minimum Cost to Connect Sticks
  • Leetcode: Minimum Swaps to Group All 1’s Together
  • Leetcode: Longest Turbulent Subarray

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.