Skip to content

Latest commit

 

History

History
126 lines (99 loc) · 3.07 KB

FB.md

File metadata and controls

126 lines (99 loc) · 3.07 KB

Add Binary

Input: a = "11", b = "1"
Output: "100"

https://leetcode.com/problems/add-binary/

Is Palindrome

680.By Removing AT MOST one CHAR

Input: s = "abca"
Output: true

https://leetcode.com/problems/valid-palindrome-ii/
https://github.com/citta-lab/DSA/blob/main/strings/680.valid-palindrome-II.js

1216.By Removing K char

Input: s = "abcdeca", k = 2
Output: true

https://leetcode.com/problems/valid-palindrome-iii/
https://github.com/citta-lab/DSA/blob/main/strings/1216.valid-palindrome-III.js

125.With Special Chars

Input: s = "A man, a plan, a canal: Panama"
Output: true

https://leetcode.com/problems/valid-palindrome/
https://github.com/citta-lab/DSA/blob/main/strings/125.valid-palindrome.js

266.Palindrome Permutation

Input: s = 'aab'
Output: true

https://leetcode.com/problems/palindrome-permutation/
https://github.com/citta-lab/DSA/blob/20d32d25dcbbe37780780947df61ebf86e7d7b66/strings/266.palindrome-permutation.js

647.Plaindrome Substring

Input: s = "aaa"
Output: 6 i,e a, a, a, aa, aa, aaa

https://leetcode.com/problems/palindromic-substrings/
https://github.com/citta-lab/DSA/blob/main/strings/647.palindromic-substrings.js

Merge Arrays

23.Merge K sorted Arrays

Input: arrays = [[2,3,4], [0,8,9], [5,6,7]]
Output: [0,2,3,4,5,6,7,8,9]

https://github.com/citta-lab/DSA/blob/main/arrays/023.merge-k-sorted-arrays.js

Parentheses

301.Remove Invlaid Parentheses

Input: s = "(a)())()"
Output: ["(a())()","(a)()()"]

https://leetcode.com/problems/remove-invalid-parentheses/
https://github.com/citta-lab/DSA/blob/main/backtracking/301.remove-invalid-parentheses.js

1249.Minimum Remove to Make Valid Parentheses

Input: s = "a)b(c)d"
Output: "ab(c)d"

https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/
https://github.com/citta-lab/DSA/blob/main/strings/1249.minimum-remove-to-make-valid-parentheses.js

921.Minimum Add to Make Parentheses Valid

Input: s = "((("
Output: 3

if s = "()))", you can insert an opening parenthesis to be "(()))" or a closing parenthesis to be "())))" https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
https://github.com/citta-lab/DSA/blob/main/strings/921.minimum-add-to-make-parentheses-valid.js

20.Valid Parentheses

Input: s = "()[]{}"
Output: true

https://leetcode.com/problems/valid-parentheses/
https://github.com/citta-lab/DSA/blob/6abe5eb287e54320dd29251fa54923090cac7ee9/strings/020.isValid-string.js

Array

Contiguous Subarrays

a = [3, 4, 1, 6, 2]
output = [1, 3, 1, 5, 1]

https://github.com/citta-lab/DSA/blob/main/arrays/9000.contiguous-subarrays.js

523.Continuous Subarray Sum

Input: nums = [23,2,6,4,7], k = 6
Output: true

https://github.com/citta-lab/DSA/blob/main/arrays/523.continuous-subarray-sum.js

STACKS

636. Exclusive Time of Functions

Input: n = 1, logs = ["0:start:0","0:start:2","0:end:5","0:start:6","0:end:6","0:end:7"]
Output: [8]

https://github.com/citta-lab/DSA/blob/main/stacks/636.exclusive-time-of-functions.js