โ
โ
#HackerEarth Substring deletion - C++ Solution
https://stupidtechy.me/threads/substring-deletion-c-solution.96/
https://stupidtechy.me/threads/substring-deletion-c-solution.96/
StupidTechy.Me
HackerEarth - Substring deletion - C++ Solution
Substring deletion - HackerEarth C++ Solution
Substring deletion
You are given a string C. You have to perform the following operations on it:
Pick any two non-overlapping substrings that are...
Substring deletion
You are given a string C. You have to perform the following operations on it:
Pick any two non-overlapping substrings that are...
โ
โ
โ
#HackerEarth - SubArray Count...
โ
โ
โ
#HackerEarth Minimum addition - Python HackerEarth Solution - Amazon Exam Code
https://stupidtechy.me/threads/minimum-addition-python-hackerearth-solution-amazon-exam-code.184/
https://stupidtechy.me/threads/minimum-addition-python-hackerearth-solution-amazon-exam-code.184/
StupidTechy.Me
HackerEarth - Minimum addition - Python HackerEarth Solution -...
Minimum addition - Python HackerEarth Solution - Amazon Exam Code
Solutions -
Minimum addition - Python HackerEarth Solution - Amazon Exam Code
Solutions -
Minimum addition - Python HackerEarth Solution - Amazon Exam Code
โ
โ
โ
#HackerEarth Minimum Operations - Python HackerEarth Solution - Amazon SDE Exam Code
https://stupidtechy.me/threads/minimum-operations-python-hackerearth-solution-amazon-sde-exam-code.186/
โ โ โ #HackerEarth Minimum addition - Python HackerEarth Solution - Amazon SDE Exam Code
https://stupidtechy.me/threads/minimum-addition-python-hackerearth-solution-amazon-sde-exam-code.184/
โณ๏ธBoth Questions were solved and working 100% fine...Enjoy and Share with others๐ฆ
https://stupidtechy.me/threads/minimum-operations-python-hackerearth-solution-amazon-sde-exam-code.186/
โ โ โ #HackerEarth Minimum addition - Python HackerEarth Solution - Amazon SDE Exam Code
https://stupidtechy.me/threads/minimum-addition-python-hackerearth-solution-amazon-sde-exam-code.184/
โณ๏ธBoth Questions were solved and working 100% fine...Enjoy and Share with others๐ฆ
โ
โ
โ
#HackerEarth Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code
https://stupidtechy.me/threads/help-michael-scott-python-hackerearth-solution-siemens-exam-code.187/
https://stupidtechy.me/threads/help-michael-scott-python-hackerearth-solution-siemens-exam-code.187/
StupidTechy.Me
HackerEarth - Help Michael Scott - Python HackerEarth Solution -...
Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code
Solutions (Python 3)-
Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code
Solutions (Python 3)-
Help Michael Scott - Python HackerEarth Solution - SIEMENS Exam Code
Forwarded from Coding Interview โฅ
โ
โ
โ
#HackerEarth - Summation Program - Python HackerEarth Solution
https://stupidtechy.me/threads/summation-program-python-hackerearth-solution.221/
Telegram - t.me/StupidTechyOfficial
https://stupidtechy.me/threads/summation-program-python-hackerearth-solution.221/
Telegram - t.me/StupidTechyOfficial
โ
โ
โ
#HackerEarth The Big Game - Python HackerEarth Solutions
https://stupidtechy.me/threads/the-big-game-python-hackerearth-solutions.242/
https://stupidtechy.me/threads/the-big-game-python-hackerearth-solutions.242/
StupidTechy.Me
HackerEarth - The Big Game - Python HackerEarth Solutions
The Big Game - Python HackerEarth Solutions
The big game There are two teams T1 and T2 playing a game. Both the teams have players. The power of each player of TI is represented in an array...
The big game There are two teams T1 and T2 playing a game. Both the teams have players. The power of each player of TI is represented in an array...
โ
#HackerEarth Breaking a String - HackerEarth Python Solutions
https://stupidtechy.me/threads/breaking-a-string-hackerearth-python-solutions.258/
https://stupidtechy.me/threads/breaking-a-string-hackerearth-python-solutions.258/
StupidTechy.Me
HackerEarth - Breaking a String - HackerEarth Python Solutions
Breaking a String - HackerEarth Python Solutions
Python 3 - Solution
(Hidden text: Visit the forum thread!)
Python 3 - Solution
(Hidden text: Visit the forum thread!)
โ
โ
โ
#HackerEarth Maximum Similarity - C++ HackerEarth Solutions
https://stupidtechy.me/threads/maximum-similarity-c-hackerearth-solutions.263/
https://stupidtechy.me/threads/maximum-similarity-c-hackerearth-solutions.263/
StupidTechy.Me
HackerEarth - Maximum Similarity - C++ HackerEarth Solutions
Maximum Similarity - C++ HackerEarth Solutions
You are given two strings S and T. You can shuffle string T as wish as you want. You have to maximize the number of positions that have the same...
You are given two strings S and T. You can shuffle string T as wish as you want. You have to maximize the number of positions that have the same...
โ
โ
โ
#HackerEarth Candidate details - SQL HackerEarth Solution (SQL Questions)
https://stupidtechy.me/threads/candidate-details-sql-hackerearth-solution-sql-questions.264/
https://stupidtechy.me/threads/candidate-details-sql-hackerearth-solution-sql-questions.264/
โ
โ
โ
#HackerEarth Greater Orders - SQL HackerEarth Solution (SQL Questions)
https://stupidtechy.me/threads/greater-orders-sql-hackerearth-solution-sql-questions.265/
https://stupidtechy.me/threads/greater-orders-sql-hackerearth-solution-sql-questions.265/
StupidTechy.Me
HackerEarth - Greater Orders - SQL HackerEarth Solution (SQL...
Greater Orders - SQL HackerEarth Solution (SQL Questions)
Problem Name - Greater Orders
Problem Statement
A company maintains information about its orders in a table called ORDERS.
(Hidden text...
Problem Name - Greater Orders
Problem Statement
A company maintains information about its orders in a table called ORDERS.
(Hidden text...
โ
โ
โ
#HackerEarth Record of students - SQL HackerEarth Solution
https://stupidtechy.me/threads/record-of-students-sql-hackerearth-solution.266/
https://stupidtechy.me/threads/record-of-students-sql-hackerearth-solution.266/
StupidTechy.Me
HackerEarth - Record of students - SQL HackerEarth Solution
Record of students - SQL HackerEarth Solution
Problem Name - Record of students
Problem Statement
Write an SQL query to select the names of the students who have attended all the lectures of...
Problem Name - Record of students
Problem Statement
Write an SQL query to select the names of the students who have attended all the lectures of...
โ
โ
โ
#HackerEarth Retail stores - SQL HackerEarth Solution (SQL Questions)
https://stupidtechy.me/threads/retail-stores-sql-hackerearth-solution-sql-questions.267/
https://stupidtechy.me/threads/retail-stores-sql-hackerearth-solution-sql-questions.267/
StupidTechy.Me
HackerEarth - Retail stores - SQL HackerEarth Solution (SQL Questions)
Retail stores - SQL HackerEarth Solution (SQL Questions)
Problem Name - Retail stores
Problem Statement
You are given the details of a retail outlet. Your task is to analyze the data from the...
Problem Name - Retail stores
Problem Statement
You are given the details of a retail outlet. Your task is to analyze the data from the...
โ
โ
โ
#HackerEarth Bank Transactions - HackerEarth Solution (SQL Questions)
https://stupidtechy.me/threads/bank-transactions-hackerearth-solution-sql-questions.268/
https://stupidtechy.me/threads/bank-transactions-hackerearth-solution-sql-questions.268/
StupidTechy.Me
HackerEarth - Bank Transactions - HackerEarth Solution (SQL Questions)
Bank Transactions - HackerEarth Solution (SQL Questions)
Problem Name - Bank Transactions
Problem Statement
You are a bank employee and you have been given two tables. One table contains the...
Problem Name - Bank Transactions
Problem Statement
You are a bank employee and you have been given two tables. One table contains the...
โ
โ
โ
#HackerEarth Call duration - SQL Questions - HackEarth Solutions
โ
โ
โ
#HackerEarth The Abandoned City - C++ Solution
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n;
cin>>n;
ll arr[100005];
for(ll i=1;i<=n;i++){
cin>>arr[i];
}
ll k;
cin>>k;
ll pre[100005];
pre[0]=0;
for(ll i=1;i<=n;i++){
pre[i] = pre[i-1]+arr[i];
}
if(pre[n]<k){
cout<<-1<<"\n";
}
else{
ll ans = INT_MAX;
for(ll i=1;i<=n;i++){
ll l=i;
ll r=n;
ll mid;
while(l<=r){
//cout<<l<<" "<<r<<"\n";
mid = (l+r)/2;
if(pre[mid]-pre[i-1]>=k){
//cout<<mid<<"\n";
ans = min(ans,mid-i+1);
r=mid-1;
}
else
l=mid+1;
}
}
cout<<ans<<"\n";
}
return 0;
}โ
โ
โ
#HackerEarth Closest to Zero - Java Solutions
import java.util.*;
import java.lang.*;
import java.io.*;
class Main
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
int curr = 0;
int ans = a[0];
Arrays.sort(a);
for (int i=0; i < a.length; i++){
curr = a[i] * a[i];
if ( curr <= (ans*ans) ) {
ans = a[i];
}
}
System.out.println(ans);
}
}