Convert a String to Camel Case Format in C++
Given a list of strings words, concatenate the strings in camel case format. Example 1 Input words = Output “javaBeans” Example 2 Input words = Output “goNasa” How to …
Category: c / c++
Compute the Nth Row of a Pascal’s Triangle using Dynamic Programming Algorithm
Given an integer n, return the nth (0-indexed) row of Pascal’s triangle. Pascal’s triangle can be created as follows: In the top row, there is an array of 1. …
Two Pointer with Sliding Window Algorithm to Compute the Longest Substring with At Most K Distinct Characters
Given a string, find the length of the longest substring T that contains at most k distinct characters. Example 1: Input: s = “eceba”, k = 2 Output: 3 …
Algorithms to Check if a String is a Subsequence String of Another String
Given two strings s1 and s2, determine if s1 is a subsequence of s2. A string a is a subsequence of another string b if you can delete some …
Compute the Shortest String After Delete Different Adjacent Letters
Given a string s consisting only of 1s and 0s, you can delete any two adjacent letters if they are different. Return the length of the smallest string that …