Explore tweets tagged as #substring
Day 95 #UntilPlacement 🚀 > Solved: Leetcode 162 - Find Peak Element | 700 - Search in a Binary Search Tree | 872 - Leaf-Similar Trees | 1456 - Maximum Number of Vowels in a Substring of Given Length ⛰️ ⚡️0 → 100 Followers (21/7/25 → 21/11/25) #100DaysOfCode #DSA #Java #MERN
1
0
9
🚀 Day 83 of #100DaysOfDSA 🚀 Solved LeetCode 5 — Longest Palindromic Substring 🔹 Problem: Find the longest palindromic substring in a string. 🔹 Approach: Expand Around Center 1️⃣ Pick each index as center 2️⃣ Expand while chars match 3️⃣ Keep longest palindrome #LeetCode #DSA🚀
1
0
15
1
0
6
Solved Minimum Window Substring today ✅ Understood the solution deeply and learned the sliding window pattern. Step-by-step progress 🚀 #100DaysOfCode
1
0
6
・部分文字列（substring）：連続 ・部分列（subsequence）：連続とは限らない （clarが多かった…） 「（連続する）部分文字列」というフレーズが誤解の元かも？ 「部分文字列（連続する部分列）」というアイデアがABC窓で出ていて、いいなと思いました。
2
13
86
分享一下我的终端配置： Kitty Terminal + ZSH shell + https://t.co/swyWB6xL3m 一个兼顾效率和外观的组合，zsh 插件有： - z 快速目录跳转 - eza 改善 ls 观感 - zsh-bat 改善 cat 观感 - zsh-autosuggestions 命令提示 - zsh-syntax-highlighting 命令语法加亮 - zsh-history-substring-search
12
40
312
🚀 Day 75 of #100DaysOfDSA 🚀 Solved LeetCode 1021 — Remove Outermost Parentheses 🔹 Problem: Given a valid parentheses string, remove the outermost parentheses from every primitive substring. 🔹 Approach: Stack Count / Greedy Logic #LeetCode #DSA #Python #StringManipulation 🚀
2
0
15
🚀 Day 79 of #100DaysOfDSA 🚀 Solved LeetCode 796 — Rotate String 💡 Trick: Instead of rotating manually, just check — goal in s + s ✅If lengths differ → False Else, substring check = elegant O(n) solution! #LeetCode #DSA #Python #100DaysOfCode #CodingJourney
2
1
16
Day 324 of 2025: 👩💻 Code to Crack Companies! ▫️Palindromic Substrings ▫️Longest Palindromic Substring #placementprep #2025Goals #leetcode #letsconnect
1
0
35
Today's LeetCode Problem 3083. Existence of a Substring in a String and Its Reverse stored all substrings, then reverse the given string, again generate all substrings and store in another map, and at last compare substrings of map1 and map2, t.c and s.c will be O(n)
1
0
25
Today's LeetCode Problem 1624. Largest Substring Between Two Equal Characters
2
2
32
Day - 12 Problem no. 3: ( Longest Substring Without Repeating Characters ) I've solved it using the two- pointer approach (i, j = 0) by removing that character from the set if it is encountered again. #DailyProblem #LeetCode #DSA
2
0
14
Day 2 of DSA✅ Solved two questions today: • Permutation in String • Remove Occurrences of Substring #DSA #CodingJourney #100DaysOfCode
21
2
128
Day 46/100 of #100DaysOfCode solved two LeetCode string problems using the Sliding Window technique: •Longest Substring Without Repeating character •Smallest Distinct Window Feeling much stronger with this efficient pattern! Onwards! #DSA #LeetCode #rohitnegi #CPP
1
0
7
🎉 Just solved LeetCode #5 – Longest Palindromic Substring! ✅ Runtime: 0 ms ✅ All test cases passed 💡 Approach: Expand around each letter (and between letters) to find the longest palindrome. Simple, efficient, and O(n²) time! #LeetCode #100DaysOfCode #Coding #Palindrome
1
0
3
Day 306 of 2025: 👩💻 Code to Crack Companies! 🧩 Q11: Longest Substring Without Repeating Characters 🧩 Q12: Two Sum Problem #CodingJourney #PlacementPrep #2025Goals #leetcode #letsconnect
0
0
7
