markstock7/smash-algorithms

Smash Algorithms By Daily Practice

Smash Algorithms, Data Structure, Design Pattern Through persistent practice and learning

This repository contains Scala based examples of many popular algorithms and data structures.

☝ Note that this project is meant to be used for learning and researching purposes only and it is not meant to be used for production.

Design Patterns

A design pattern is a general repeatable solution to a commonly occurring problem in software design. A design pattern isn't a finished design that can be transformed directly into code. It is a description or template for how to solve a problem that can be used in many different situations.

B - Beginner, A - Advanced

Data Structures

A data structure is a particular way of organizing and storing data in a computer so that it can be accessed and modified efficiently. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.

B - Beginner, A - Advanced

Algorithms

An algorithm is an unambiguous specification of how to solve a class of problems. It is a set of rules that precisely define a sequence of operations.

E - Easy, M - Medium, H - Hard

• Sorting

  • E   [Bubble Sort](Bubble Sort)

• Array

  • Merge Intervals
  • Rotate Metrix
  • Rotate Array
  • Find First and Last Position of Element in Sorted Array
  • Trapping Rain Water
  • E  Two Sum
  • E  Two Sum II
  • M  Next Permutation
  • E  Majority Element
  • E  Merge Sorted Array
  • E  Search Insert Position
  • E  Binary Search
  • E  Move Zeroes
  • E  Find Minimum in Rotated Sorted Array

• Backtracking

  • Combination Sum
  • Subsets
  • WordSearch

• Graph

  • Clone Grpah

• Bit

  • Number of 1 Bits
  • Hamming Distance
  • Single Number
  • Missing Number
  • Subsets
  • M Sum of Two Integers
  • M Single Element in a Sorted Array

• Dynamic Programming

  • Word Break
  • Palindromic Substrings
  • Nth Ugly Number
  • H Longest Valid Parentheses
  • M Decode Ways
  • E Nth Fibonacci Number
  • M Counting Bits
  • M Unique Paths
  • M Unique Paths II
  • E House Robber
  • E House Robber II
  • E Maximum Subarray
  • M Longest Palindromic Substring
  • E Climbing Stairs
  • E Best Time to Buy and Sell Stock
  • M Coin Change II
  • M Coin Change
  • M Min Cost Climbing Stairs
  • M Longest Increasing Subsequence
  • M Maximum Product Subarray

• Greedy

  • Jump Game
  • Jump Game II

• Hashtable

  • Jewels And Stones
  • Tow Sum
  • GroupAnagrams
  • H Minimum Window Substring

• Heap

  • Kth largest element in a stream

• List

  • Rotate List
  • Remove Nth node from end of List
  • Reverse Linked List
  • Middle of the linked List
  • Remove Linked List Elements
  • Intersection of two linked lists
  • M Partition List
  • E Palindrome Linked List
  • E Merge Two Sorted Lists
  • E Linked List Cycle
  • E Remove Duplicates from Sorted List

• Math

  • Sqrt
  • Pow
  • Ugly Number

• Stack

• String

  • Valid Palindrome
  • Palindrome Number
  • Palindromic Substrings
  • E Longest Palindrome
  • E First Unique Character In A String

• Tree

  • E Subtree of Another Tree
  • E Path Sum
  • E Symmetric Tree
  • E Same Tree
  • E Minimum Depth of Binary Tree
  • E Maximum Depth of Binary Tree
  • E Binary Tree Level Order Traversal II
  • E Invert Binary Tree
  • E Search in a Binary Search Tree
  • E Build Binary Search Tree
  • M Path Sum II
  • M Binary Tree Level Order Traversal
  • M Pre Order

• Unclassified

  • M Search a 2D Matrix II

• Design

  • M Min Stack