Skip to main content

MAY-18 2020 Challenge

MAY-18 2020 Challenge : Permutation in String



Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. 


In other words, one of the first string's permutations is the substring of the second string.




Example 1:


Input: 

s1 = "ab"

s2 = "eidbaooo"


Output: True



Explanation: 

s2 contains one permutation of s1 ("ba").





Example 2:


Input:


s1= "ab"

s2 = "eidboaoo"



Output: False



Note:


- The input strings only contain lower case letters.

- The length of both given strings is

in range [1, 10,000].




Solution in C++: 

class Solution {

    public boolean checkInclusion(String s1, String s2) {

        int[] map = new int[128];

        for (char c : s1.toCharArray()) {

            map[c]++;

        }

        int count = s1.length();

        char[] chars = s2.toCharArray();

        int left = 0, right = 0;

        while (right < chars.length) {

            if (map[chars[right++]]-- > 0) count--;

            while (count == 0) {

                if (right - left == s1.length()) return true;

                if (++map[chars[left++]] > 0) count++;

            }

        }

        return false;

    }

}

Permutation in String

Comments

Popular posts from this blog

Leetcode 371. Sum of Two Integers. C++ / Java

371 .  Sum of Two Integers   Given two integers  a  and  b , return  the sum of the two integers without using the operators   +   and   - .   Example 1: Input: a = 1, b = 2 Output: 3 Example 2: Input: a = 2, b = 3 Output: 5   Constraints: -1000 <= a, b <= 1000 Solution :  C++ : class Solution { public: int getSum(int a, int b) { if (b==0) return a; int sum = a ^ b; int cr = (unsigned int) (a & b) << 1; return getSum(sum, cr); } }; Java :  class Solution { public int getSum(int a, int b) { while(b != 0){ int tmp = (a & b) << 1; a = a ^ b; b = tmp; } return a; } } Explaination :

Number of Connected Components in an Undirected Graph (Python)

66.  Number of Connected Components in an Undirected Graph Question Link :  check here Givennnodes labeled from0ton - 1and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected graph. Example 1:      0          3      |          |      1 --- 2    4 Givenn = 5andedges = [[0, 1], [1, 2], [3, 4]], return2. Example 2:      0           4      |           |      1 --- 2 --- 3 Givenn = 5andedges = [[0, 1], [1, 2], [2, 3], [3, 4]], return1. Note: You can assume that no duplicate edges will appear inedges. Since all edges are undirected,[0, 1]is the same as[1, 0]and thus will not appear together inedges. Solution : class Solution: def counComponents(self, n: int, edges : List[List[int]]) -> i...

Leetcode 347. Top K Frequent Elements. Python (Bubble Sort)

Top K Frequent Elements Given an integer array  nums  and an integer  k , return  the   k   most frequent elements . You may return the answer in  any order .   Example 1: Input: nums = [1,1,1,2,2,3], k = 2 Output: [1,2] Example 2: Input: nums = [1], k = 1 Output: [1]   Constraints: 1 <= nums.length <= 10 5 -10 4  <= nums[i] <= 10 4 k  is in the range  [1, the number of unique elements in the array] . It is  guaranteed  that the answer is  unique .   Follow up:  Your algorithm's time complexity must be better than  O(n log n) , where n is the array's size. Solution : class Solution:     def topKFrequent(self, n: List[int], k: int) -> List[int]:                  # [1,1,1,2,2,3] &  k = 2                  f = [[] for i in range(len(n) + 1)]         # f = [...