String problems

147 String problems on CampusCode, in order. Open any for its full statement, examples and constraints.

• 150. Reverse a String Easy
• 151. Check if String is Palindrome Easy
• 152. Count Vowels and Consonants Easy
• 153. Remove All Spaces from a String Easy
• 154. Count Occurrences of a Character Easy
• 155. Check if Two Strings are Anagrams Easy
• 156. Find the First Non-Repeating Character Easy
• 157. Check if String Contains Only Digits Easy
• 158. Remove Duplicate Characters from String Easy
• 159. Reverse Words in a Sentence Easy
• 160. Find the Length of Last Word Easy
• 161. Check if String is a Subsequence of Another Easy
• 162. Roman to Integer Easy
• 163. Longest Common Prefix Easy
• 164. Add Binary Strings Easy
• 165. Valid Parentheses (String Version) Easy
• 166. Detect Capital Usage Easy
• 167. To Lower Case Easy
• 168. Count and Say Easy
• 169. Merge Strings Alternately Easy
• 170. Check if Strings are Isomorphic Easy
• 171. Word Pattern Easy
• 172. Find the Difference (One Extra Character) Easy
• 173. Ransom Note Easy
• 174. String Compression (Run-Length Encoding) Easy
• 175. Repeated Substring Pattern Easy
• 176. Check if String is a Rotation of Another Easy
• 177. Maximum Nesting Depth of Parentheses Easy
• 178. Find the Index of the First Occurrence in a String Easy
• 179. Longest Continuous Repeating Character Easy
• 180. Number of Segments in a String Easy
• 181. Find All Occurrences of a Substring Easy
• 182. Maximum Number of Words in Sentences Easy
• 183. Truncate Sentence Easy
• 184. Check if Pangram Easy
• 185. Sorting the Sentence Easy
• 186. Goal Parser Interpretation Easy
• 187. Reverse Prefix of Word Easy
• 188. Remove Vowels from String Easy
• 189. Largest Odd Number in String Easy
• 190. Longest Substring Without Repeating Characters (Brute) Easy
• 191. Count Prefix and Suffix Pairs Easy
• 192. Check if Binary String Has at Most One Segment of Ones Easy
• 193. Remove Trailing Zeros from String Easy
• 194. Count Substrings Starting and Ending with Given Character Easy
• 195. String Without AAA or BBB Easy
• 196. Concatenation of Consecutive Binary Numbers (String) Easy
• 197. Check Distances Between Same Letters Easy
• 198. Replace All Digits with Characters Easy
• 199. Check if Two String Arrays are Equivalent Easy
• 200. Make the String Great (Remove Same Adjacent) Easy
• 201. Shuffle String Easy
• 202. Integer to Roman Easy
• 203. Decode the Message Easy
• 204. Capitalize the First Letter of Every Word Easy
• 205. Shift the Letters Easy
• 206. Minimum Number of Moves to Seat Everyone Easy
• 207. Largest Number (Array to String Sort) Easy
• 208. Decode String (Nested Brackets — Easy Variant) Easy
• 209. Longest Substring with At Most Two Distinct Characters Easy
• 210. Longest Substring Without Repeating Characters Medium
• 211. Longest Palindromic Substring Medium
• 212. Group Anagrams Medium
• 213. Longest Palindrome by Rearranging Characters Medium
• 214. Minimum Window Substring Medium
• 215. String to Integer (atoi) Medium
• 216. ZigZag Conversion Medium
• 217. Multiply Strings Medium
• 218. Decode Ways Medium
• 219. Word Break Medium
• 220. Generate Parentheses (Count) Medium
• 221. Letter Combinations of a Phone Number (Count) Medium
• 222. Restore IP Addresses (Count) Medium
• 223. Count Palindromic Substrings Medium
• 224. Longest Repeating Character Replacement Medium
• 225. Valid Palindrome II Medium
• 226. Palindrome Partitioning (Count) Medium
• 227. Reorganize String (Feasibility) Medium
• 228. Find All Anagrams in a String (Count) Medium
• 229. Permutation in String Medium
• 230. Compare Version Numbers Medium
• 231. Reverse Words in a String Medium
• 232. Simplify Path Medium
• 233. Basic Calculator II Medium
• 234. Decode String Medium
• 235. Custom Sort String Medium
• 236. Partition Labels (Count) Medium
• 237. Count Distinct Subsequences (Modulo 10^9+7) Medium
• 238. String Compression (Length) Medium
• 239. Remove K Digits Medium
• 240. Remove Duplicate Letters Medium
• 241. Text Justification (Line Count) Medium
• 242. Sort Characters By Frequency Medium
• 243. Find the Index of the First Occurrence Medium
• 244. Repeated DNA Sequences (Count) Medium
• 245. Isomorphic Strings Medium
• 246. Reverse Vowels of a String Medium
• 247. Largest Number Medium
• 248. Number of Distinct Substrings (Count) Medium
• 249. Minimum Add to Make Parentheses Valid Medium
• 250. Longest Substring with At Most K Distinct Characters Medium
• 251. Substring with Concatenation of All Words (Count) Medium
• 252. Find Longest Word by Deleting Characters Medium
• 253. CamelCase Matching (Count) Medium
• 254. Maximum Number of Vowels in a Substring of Given Length Medium
• 255. Defanging an IP Address Medium
• 256. Bulls and Cows Medium
• 257. Edit Distance Hard
• 258. Wildcard Matching Hard
• 259. Regular Expression Matching Hard
• 260. Longest Valid Parentheses Hard
• 261. Distinct Subsequences (Count Target in Source) Hard
• 262. Word Break II (Count of Segmentations) Hard
• 263. Shortest Palindrome (Prepend Count) Hard
• 264. Palindrome Pairs (Count) Hard
• 265. Minimum Window Subsequence (Length) Hard
• 266. Scramble String Hard
• 267. Interleaving String Hard
• 268. Longest Duplicate Substring (Length) Hard
• 269. Word Ladder (Shortest Transformation Length) Hard
• 270. Concatenated Words (Count) Hard
• 271. Valid Number Hard
• 272. Count Different Palindromic Subsequences (Modulo 10^9+7) Hard
• 273. Palindrome Partitioning II (Minimum Cuts) Hard
• 274. Distinct Echo Substrings (Count) Hard
• 275. Last Substring in Lexicographical Order Hard
• 276. Minimum Insertions to Make a Palindrome Hard
• 277. Minimum Insertions to Balance Parentheses Hard
• 278. Longest Substring with At Least K Repeating Characters Hard
• 279. Basic Calculator Hard
• 280. Different Ways to Add Parentheses (Count) Hard
• 281. Expression Add Operators (Count) Hard
• 282. Ambiguous Coordinates (Count) Hard
• 283. Number of Ways to Form Target String (Modulo 10^9+7) Hard
• 284. Stamping The Sequence (Stamp Count) Hard
• 285. Integer to English Words Hard
• 286. Parse Lisp Expression Hard
• 287. Number of Atoms Hard
• 288. Encode String with Shortest Length Hard
• 289. Distinct Subsequences II (Modulo 10^9+7) Hard
• 290. Partition into Substrings with Unique Characters Hard
• 291. Shortest Superstring (Length) Hard
• 292. Count Substrings That Differ by One Character Hard
• 293. Longest Happy Prefix (Length) Hard
• 294. Strong Password Checker (Minimum Steps) Hard
• 295. Count Generalized Abbreviations (Modulo 10^9+7) Hard
• 296. Special Binary String Hard