How to Choose the Best Colors For The User Interface?

Coca-Cola, McDonald’s, Dell, Cafe Coffee day, Paytm, Starbucks….. What comes to your mind when you think about these famous services or brands… Maybe your favorite… Read More » The post How to Choose the Best Colors For The User Interface? appeared first on GeeksforGeeks.

13h

Blue Yonder Interview Experience for Software Engineer (On-Campus)

Online Assessment: There were 2 sections: Aptitude Technical All questions are MCQ’S this round is from easy to moderate level. Technical round 1: She started… Read More » The post Blue Yonder Interview Experience for Software Engineer (On-Campus) appeared first on GeeksforGeeks.

1d

TCS NQT Interview Experience (2020-2021)

ROUND 1(Conducted Through TCS-ION Platform): Round 1 happened for over three hours this year and it is an auto-proctored exam which contains quantitative aptitude-26, reasoning… Read More » The post TCS NQT Interview Experience (2020-2021) appeared first on GeeksforGeeks.

1d

SquadStack Interview Experience for Product Engineer

I applied through SquadStacks’s job portal. And got a link for the first round in about 5 days. They took 5 rounds in total. Due… Read More » The post SquadStack Interview Experience for Product Engineer appeared first on GeeksforGeeks.

1d

Print all Unique Strings present in a given Array

Given an array of strings arr[], the task is to print all unique strings that are present in the given array. Examples: Input: arr[] =… Read More » The post Print all Unique Strings present in a given Array appeared first on GeeksforGeeks.

1d

Count of numbers from range [L, R] whose sum of digits is Y | Set 2

Given three positive integers L, R and Y, the task is to count the numbers in the range [L, R] whose sum of digits is… Read More » The post Count of numbers from range [L, R] whose sum of digits is Y | Set 2 appeared first on GeeksforGeeks.

1d

Longest increasing subsequence consisting of elements from indices divisible by previously selected indices

Given an array arr[] consisting of N positive integers, the task is to find the length of the longest increasing subsequence possible by selecting elements… Read More » The post Longest increasing subsequence consisting of elements from indices divisible by previously selected indices appeared first on GeeksforGeeks.

1d

Queries to check if any pair exists in an array having values at most equal to the given pair

Given a vector of pairs arr[] and Q queries in the form of pairs in an array Queries[], the task for each query is to… Read More » The post Queries to check if any pair exists in an array having values at most equal to the given pair appeared first on GeeksforGeeks.

1d

Minimum removals required to make a given array Bitonic

Given an array arr[] of size N, the task is to find the minimum number of array elements required to be removed from the array… Read More » The post Minimum removals required to make a given array Bitonic appeared first on GeeksforGeeks.

1d

Minimum time required to reach a given score

Given an integer target and an array arr[] consisting of N positive integers where arr[i] denotes the time required to score 1 point for the… Read More » The post Minimum time required to reach a given score appeared first on GeeksforGeeks.

1d