Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

Series: Convert Data Structure Problems & Follow-Up

Posted on August 13, 2018July 26, 2020 by braindenny

Convert Data Structure problems



  • CheatSheet: Leetcode For Code Interview
  • CheatSheet: Common Code Problems & Follow-ups

Questions

Name Example
Implement a queue supporting enqueue, dequeue and findmax operations  
Implement a stack supporting push, pop, getmin, getavg, getmostfrequent  
Implement a queue using two stacks  

See all series problems: #convertds

  • LintCode: Convert Linked List to Array List
  • LintCode: Convert Array List to Linked List
  • LeetCode: Serialize and Deserialize N-ary Tree
  • LeetCode: Serialize and Deserialize BST
  • LeetCode: Serialize and Deserialize Binary Tree
  • LeetCode: Convert Sorted List to Binary Search Tree
  • LeetCode: Convert BST to Greater Tree
  • LeetCode: Convert Binary Search Tree to Sorted Doubly Linked List

See more blog posts.

linkedin
github
slack

Post Views: 5
Posted in SeriesTagged series

Post navigation

LintCode: Find Node in Linked List
Series: Coin Problems & Follow-Up

Leave a Reply Cancel reply

Your email address will not be published.

Tags

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

Recent Posts

  • a
  • a
  • a
  • a
  • a

Recent Comments

    Archives

    Categories

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