Skip to content
View Loving143's full-sized avatar

Block or report Loving143

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Pinned Loading

  1. -lexicographically-smallest-and-largest-substrings -lexicographically-smallest-and-largest-substrings Public

    In this we will find the lexicographically smallest and largest substrings of length K from the given string

  2. In this we will find the lexicograph... In this we will find the lexicographically smallest and largest substrings of length k from the given string
    1
    import java.util.Scanner;
    2
    
                  
    3
    public class Solution {
    4
    
                  
    5
        public static String getSmallestAndLargest(String s, int k) {
  3. Longest-Common-Subsequence Longest-Common-Subsequence Public

    In this by taking two array we will find out the longest sequence which is common to both the arrays

  4. Left-Array-Rotation Left-Array-Rotation Public

    In this we are given an array a of n integers and a number d and we have to perform d left rotations on the array and return the updated array to be printed as a single line of space-separated inte…

  5. Longest-Valid-Paranthesis Longest-Valid-Paranthesis Public

    Given a string S consisting of opening and closing parenthesis '(' and ')' we have to find the length of the longest valid parenthesis substring.