Longest consecutive subsequence

 The idea is to first sort the array and find the longest subarray with consecutive elements. After sorting the array and removing the multiple occurrences of elements, run a loop and keep a count and max (both initially zero). Run a loop from start to end and if the current element is not equal to the previous (element+1) then set the count to 1 else increase the count. Update max with a maximum of count and max.   Illustration:Input:.

create modal popup in blogger and dotnet

<div class="modal fade" id="alertModelAds" data-bs-backdrop="static" data-bs-keyboard="false" tabindex="-1" aria-labelledby="staticBackdropLabel" aria-hidden="true" style="z-index: 1052;">        <div class="modal-dialog popup">            <div class="modal-content modal-dialogads" style="background-color:#fff;width:100%">    <div class="panel panel-blue">        <a class="close float-end" data-bs-dismiss="modal" aria-label="Close".

how to Change your app's target API level in andriod studio

 Open build.gradle under android/app/find the android { } blockChange the following version to the below:compileSdkVersion 27 buildToolsVersion "27.0.3" minSdkVersion 16 targetSdkVersion 27 In case your current android/app/build.gradle has lines which look like :compileSdkVersion rootProject.ext.compileSdkVersion buildToolsVersion rootProject.ext.buildToolsVersion You will have to edit the android/build.gradle to.