Skip to content

pro1zero/Data-Structures

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

34 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data-Structures

Public repository for Data Structures using Java workshop.

Find RECORDINGS here

Solve the questions correctly and pull request, I will verify your solutions and merge them in Master.

Homework: Revise LRUCache and this implementation as well. Try to solve the following problem.

  1. LFU Cache Same concept, different implementation.

Homework: Revise Trie Implementation and try following problem:

  1. Implement Search and Add Data Structure [Uses dfs on top of Trie]

Homework: These are some EASY problems for Trees and BSTs.

  1. Leaf-Similar Trees
  2. Symmetric Trees
  3. Same Binary Tree
  4. Invert Binary Tree
  5. Recover BST

Homework: Try to solve these questions in a bruteforce approach, then read theories, discussions, and try again to optimize for LinkedList.

  1. Remove Nth Node from End.
  2. Palindrome LinkedList.

Homework: Try to implement these functions in our LinkedList.java file: removeAtPosition(int ithPosition), removeValue(int valueToRemove), removeBefore(int ithValue), removeAfter(int ithValue), removeAllOccurences(int value) for LINKEDLIST.


Homework: Try Merge Sort on the same sorting question on Leetcode and below problems for HASHTABLE.

  1. Group Anagrams.
  2. Set Zeroes in Matrix.

Homework: Read 5-minute article and try this question on leetcode for SORTING.

  1. 5 min READ.
  2. Sort an array. [Use Quick Sort to sort this array. Can you sort the array by taking pivot as the last element in the array?]

Homework: Try this questions on Leetcode for STACKS.

  1. Monotonic Stack. (Scroll down and see approach 1)
  2. Daily Temperature.
  3. Min Stack.

Homework: Try this questions on Leetcode for ARRAYS.

  1. 3 Sum. (Hint: use the same methods as 2sum with 1 more loop.)
  2. Find First and Last Position of Element in Sorted Array. (follow-up: Can you do this in O(logN)?)

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages