Strictly Alternating List - Facebook Top Interview Questions
Problem Statement :
You are given a list of integers nums. Return whether the list alternates from first strictly increasing to strictly decreasing and then strictly increasing etc. If a list is only strictly increasing, return true. Constraints 2 ≤ n ≤ 100,000 where n is the length of nums Example 1 Input nums = [1, 2, 5, 7, 4, 1, 6, 8, 3, 2] Output True Explanation This list strictly increases, strictly decreases, strictly increases, then strictly decreases. Example 2 Input nums = [1, 1, 2, 3, 2, 1] Output False Explanation This list increases and then decreases, but is not strictly increasing at first. Example 3 Input nums = [1, 3, 5, 7] Output True Explanation This list is strictly increasing. Example 4 Input nums = [5, 3, 1, 5, 7] Output False Explanation This list is not strictly increasing at first.
Solution :
Solution in C++ :
bool solve(vector<int>& nums) {
int n = nums.size();
for (int i = 1; i < n; i++) {
if (nums[i] == nums[i - 1]) return false;
if (i == 1 and nums[i] < nums[i - 1]) return false;
}
return true;
}
Solution in Java :
import java.util.*;
class Solution {
public boolean solve(int[] nums) {
if (nums.length <= 1)
return true;
if (nums[1] <= nums[0])
return false;
for (int i = 1; i < nums.length; i++) {
if (nums[i] == nums[i - 1]) {
return false;
}
}
return true;
}
}
Solution in Python :
class Solution:
def solve(self, a):
return a[0] < a[1] and all(a[i - 1] != a[i] for i in range(1, len(a)))
View More Similar Problems
Cube Summation
You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor
View Solution →Direct Connections
Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do
View Solution →Subsequence Weighting
A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =
View Solution →Kindergarten Adventures
Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti
View Solution →Mr. X and His Shots
A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M
View Solution →Jim and the Skyscrapers
Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space
View Solution →