more links

tson2222 · Mar 18, 2020 · 7f0606a · 7f0606a
1 parent 7016297
commit 7f0606a
Show file tree

Hide file tree

Showing 161 changed files with 1,438 additions and 2 deletions.
diff --git a/Arrays, Primitives, Strings/3sum/3sum.java b/Arrays, Primitives, Strings/3sum/3sum.java
@@ -1,6 +1,6 @@
 /*
   This repository is no longer actively maintained. To find all solutions
-  to this problem (and practice coding more problems) visit us at:
+  to this problem (and practice coding more problems) at:
 
   ~~~~~~~~~~~~~~~~~~~~~~~~~
   https://backtobackswe.com

diff --git a/Arrays, Primitives, Strings/AdditionWithOnlyBitshifting/AdditionWithOnlyBitshifting.java b/Arrays, Primitives, Strings/AdditionWithOnlyBitshifting/AdditionWithOnlyBitshifting.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int getSum(int a, int b) {
 

diff --git a/Arrays, Primitives, Strings/ChangingBase/ChangingBase.java b/Arrays, Primitives, Strings/ChangingBase/ChangingBase.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 public class Solution {
   public String changeBase(String numAsString, int b1, int b2) {
     boolean isNegative = numAsString.startsWith("-");

diff --git a/Arrays, Primitives, Strings/IncrementAnArrayInteger/IncrementAnArrayInteger.java b/Arrays, Primitives, Strings/IncrementAnArrayInteger/IncrementAnArrayInteger.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int[] plusOne(int[] digits) {
     /*

diff --git a/Arrays, Primitives, Strings/InterconvertStringAndInt/InterconvertStringAndInt.java b/Arrays, Primitives, Strings/InterconvertStringAndInt/InterconvertStringAndInt.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 public class Solution {
   private String intToString(int num) {
     boolean isNegative = false;

diff --git a/Arrays, Primitives, Strings/LongestPalindromeConstruction/WithHashtable.java b/Arrays, Primitives, Strings/LongestPalindromeConstruction/WithHashtable.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int longestPalindrome(String s) {
     int longestPalindromeLength = 0;

diff --git a/Arrays, Primitives, Strings/LongestPalindromeConstruction/WithSet.java b/Arrays, Primitives, Strings/LongestPalindromeConstruction/WithSet.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
  public int longestPalindrome(String s) {
     int matchings = 0;

diff --git a/Arrays, Primitives, Strings/LongestPalindromicSubstring/DynamicProgrammingApproach.java b/Arrays, Primitives, Strings/LongestPalindromicSubstring/DynamicProgrammingApproach.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public String longestPalindrome(String s) {
     PalindromeFinder pf = new PalindromeFinder(s);

diff --git a/Arrays, Primitives, Strings/LongestPalindromicSubstring/ExplicitTesting.java b/Arrays, Primitives, Strings/LongestPalindromicSubstring/ExplicitTesting.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public String longestPalindrome(String s) {
     PalindromeFinder pf = new PalindromeFinder(s);

diff --git a/Arrays, Primitives, Strings/NextPermutation/NextPermutation.java b/Arrays, Primitives, Strings/NextPermutation/NextPermutation.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public void nextPermutation(int[] nums) {
     // Grab the index of the 2nd to last element in the array

diff --git a/Arrays, Primitives, Strings/PalindromeNumber/PalindromeNumber.java b/Arrays, Primitives, Strings/PalindromeNumber/PalindromeNumber.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public boolean isPalindrome(int x) {
     if (x < 0) {

diff --git a/Arrays, Primitives, Strings/PalindromeNumber/PalindromeNumber.py b/Arrays, Primitives, Strings/PalindromeNumber/PalindromeNumber.py
@@ -1,3 +1,12 @@
+'''
+    This repository is no longer actively maintained. To find all solutions
+    to this problem (and practice coding more problems) at:
+
+    ~~~~~~~~~~~~~~~~~~~~~~~~~
+    https://backtobackswe.com
+    ~~~~~~~~~~~~~~~~~~~~~~~~~
+'''
+
 import math
 
 class Solution(object):

diff --git a/Arrays, Primitives, Strings/PatternMatching/PatternMatching.java b/Arrays, Primitives, Strings/PatternMatching/PatternMatching.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public List<String> findAndReplacePattern(String[] words, String pattern) {
     List<String> matches = new ArrayList<>();

diff --git a/Arrays, Primitives, Strings/RotateImage/LayerByLayer.java b/Arrays, Primitives, Strings/RotateImage/LayerByLayer.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public void rotate(int[][] matrix) {
     int size = matrix.length - 1; // this is really the last index

diff --git a/Arrays, Primitives, Strings/RotateImage/MatrixTranspose.java b/Arrays, Primitives, Strings/RotateImage/MatrixTranspose.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public void rotate(int[][] matrix) {
     flipVertically(matrix);

diff --git a/Arrays, Primitives, Strings/SecondLargestItemInAnArray/SecondLargestItemInAnArray.java b/Arrays, Primitives, Strings/SecondLargestItemInAnArray/SecondLargestItemInAnArray.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public static int secondLargest(int arr[]) { 
     int firstLargest = Integer.MIN_VALUE;

diff --git a/Arrays, Primitives, Strings/SpiralMatrixTraversal/SpiralMatrixTraversal.java b/Arrays, Primitives, Strings/SpiralMatrixTraversal/SpiralMatrixTraversal.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public List<Integer> spiralOrder(int[][] matrix) {
     List<Integer> spiralSequence = new ArrayList<>();

diff --git a/Dynamic Programming, Recursion, & Backtracking/BuyAndSellOnce/ConstantSpace.java b/Dynamic Programming, Recursion, & Backtracking/BuyAndSellOnce/ConstantSpace.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int maxProfit(int[] prices) {
     if (prices.length == 0) {

diff --git a/Dynamic Programming, Recursion, & Backtracking/BuyAndSellOnce/LinearSpace.java b/Dynamic Programming, Recursion, & Backtracking/BuyAndSellOnce/LinearSpace.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int maxProfit(int[] prices) {
     if (prices.length == 0) {

diff --git a/Dynamic Programming, Recursion, & Backtracking/ChangeMakingProblem/BottomUp.java b/Dynamic Programming, Recursion, & Backtracking/ChangeMakingProblem/BottomUp.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int coinChange(int[] coins, int amount) {
     // We use this to fill the dp table with default values

diff --git a/Dynamic Programming, Recursion, & Backtracking/ChangeMakingProblem/TopDown.java b/Dynamic Programming, Recursion, & Backtracking/ChangeMakingProblem/TopDown.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int coinChange(int[] coins, int amount) {
     if (amount < 1) {

diff --git a/...mic Programming, Recursion, & Backtracking/ChangeMakingProblem2/ChangeMakingProblem2.java b/...mic Programming, Recursion, & Backtracking/ChangeMakingProblem2/ChangeMakingProblem2.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int change(int amount, int[] coins) {
     int[][] dp = new int[coins.length + 1][amount + 1];

diff --git a/Dynamic Programming, Recursion, & Backtracking/ClimbingStairs/BottomUp.java b/Dynamic Programming, Recursion, & Backtracking/ClimbingStairs/BottomUp.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int climbStairs(int n) {
     /*

diff --git a/Dynamic Programming, Recursion, & Backtracking/ClimbingStairs/TopDown.java b/Dynamic Programming, Recursion, & Backtracking/ClimbingStairs/TopDown.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int climbStairs(int n) {
     int memo[] = new int[n + 1];

diff --git a/Dynamic Programming, Recursion, & Backtracking/ClimbingStairs/TopDownNoMemoization.java b/Dynamic Programming, Recursion, & Backtracking/ClimbingStairs/TopDownNoMemoization.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int climbStairs(int n) {
     return climbStairsHelper(n);

diff --git a/... Recursion, & Backtracking/CountUniqueBinarySearchTrees/CountUniqueBinarySearchTrees.java b/... Recursion, & Backtracking/CountUniqueBinarySearchTrees/CountUniqueBinarySearchTrees.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int numTrees(int n) {
     /*

diff --git a/...mic Programming, Recursion, & Backtracking/DNASequenceAlignment/DNASequenceAlignment.java b/...mic Programming, Recursion, & Backtracking/DNASequenceAlignment/DNASequenceAlignment.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 public class Solution {
   private static final int GAP_COST = 1;
   private static final Map<String, Integer> alignmentCosts = new HashMap<>();

diff --git a/Dynamic Programming, Recursion, & Backtracking/DecodeWays/DecodeWays.py b/Dynamic Programming, Recursion, & Backtracking/DecodeWays/DecodeWays.py
@@ -1,3 +1,12 @@
+'''
+    This repository is no longer actively maintained. To find all solutions
+    to this problem (and practice coding more problems) at:
+
+    ~~~~~~~~~~~~~~~~~~~~~~~~~
+    https://backtobackswe.com
+    ~~~~~~~~~~~~~~~~~~~~~~~~~
+'''
+
 class Solution(object):
     def numDecodings(self, s):
         """

diff --git a/Dynamic Programming, Recursion, & Backtracking/DecodeWays/Recursive.java b/Dynamic Programming, Recursion, & Backtracking/DecodeWays/Recursive.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int numDecodings(String s) {
     int[] dp = new int[s.length()];

diff --git a/Dynamic Programming, Recursion, & Backtracking/EditDistance/TopDown.java b/Dynamic Programming, Recursion, & Backtracking/EditDistance/TopDown.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int levenshteinDistance(String s1, String s2) {
     int[][] opt = new int[s1.length()][s2.length()];

diff --git a/Dynamic Programming, Recursion, & Backtracking/EggDrop/BottomUp.java b/Dynamic Programming, Recursion, & Backtracking/EggDrop/BottomUp.java
@@ -1,3 +1,12 @@
+/*
+  This repository is no longer actively maintained. To find all solutions
+  to this problem (and practice coding more problems) at:
+
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+  https://backtobackswe.com
+  ~~~~~~~~~~~~~~~~~~~~~~~~~
+*/
+
 class Solution {
   public int eggDrop(int totalEggs, int totalFloors) {
     /*