Posts

Leetcode 1417. Reformat The String

Given alphanumeric string  s . ( Alphanumeric string  is a string consisting of lowercase English letters and digits). You have to find a permutation of the string where no letter is followed by another letter and no digit is followed by another digit. That is, no two adjacent characters have the same type. Return  the reformatted string  or return  an empty string  if it is impossible to reformat the string. Example 1: Input: s = "a0b1c2" Output: "0a1b2c" Explanation: No two adjacent characters have the same type in "0a1b2c". "a0b1c2", "0a1b2c", "0c2a1b" are also valid permutations. Example 2: Input: s = "leetcode" Output: "" Explanation: "leetcode" has only characters so we cannot separate them by digits. Example 3: Input: s = "1229857369" Output: "" Explanation: "1229857369" has only digits so we cannot separate them by c...
Post a Comment
Read more

LeetCode — 283. Move Zeroes

Given an array  nums , write a function to move all  0 's to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,0] Note : You must do this  in-place  without making a copy of the array. Minimize the total number of operations. Approach 1:  Using extra space class Solution {     public void moveZeroes(int[] nums) {         int newarr[] = new int[nums.length];         int count = 0;         int ncp = 0;         for(int num:nums)         {             if(num==0)             {                 zeCo++;             }                       else         ...
Post a Comment
Read more