DEV Community: VipulDeshmukh95

Second Largest Num in Array

VipulDeshmukh95 — Tue, 27 Dec 2022 16:39:10 +0000

Approach:

First got the max num from array.
Using the above max num, got the second max num
If the 2nd Largest num is present, I have returned it.
If such 2nd largest num is absent, I have returned -1.

int Solution::solve(vector<int> &A) {
    int max_num = INT_MIN;
    int max_sec = INT_MIN;
    int n = A.size();


    for(int i = 0; i < n; i++)
    {
        max_num = max(max_num, A[i]);
    }

    for(int i = 0; i < n; i++) 
    {
        if(A[i] != max_num)
        {
          max_sec = max(max_sec, A[i]);
        }
    }

    if(max_sec != INT_MIN)
    {
        return max_sec;
    }
    else{
    return -1;
    }
}

Arrays

VipulDeshmukh95 — Sun, 07 Aug 2022 20:11:23 +0000

Simple code to show how the Accessing and Modifying of array elements is done:

// AccessingAndModifyingArrayElements.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

include "pch.h"

include

using namespace std;

int main()
{
//std::cout << "Hello World!\n";

//1. Accessing array elements
cout << "1. Accessing array elements : " << endl;
int arr[]{ 100, 20, 30, 50, 60 };

cout << "Array element 1: " << arr[0] << endl;
cout << "Array element 2: " << arr[1] << endl;
cout << "Array element 3: " << arr[2] << endl;
cout << "Array element 4: " << arr[3] << endl;
cout << "Array element 5: " << arr[4] << endl;

//2. Arrays are not check for out of bounds :
// Most probably code will crash in such situations.
//cout << "enter any number for arr[5] : " << endl;

//cin >> arr[5];

//3. Initializing array:
cout << "\n";
cout << "===============" << endl;
cout << "\n";
//int arr1[5];
//int arr2[5]{};
int arr3[5]{100, 90};

cout << "Array element 1: " << arr3[0] << endl;
cout << "Array element 2: " << arr3[1] << endl;
cout << "Array element 3: " << arr3[2] << endl;
cout << "Array element 4: " << arr3[3] << endl;
cout << "Array element 5: " << arr3[4] << endl;

//4. Modifying array elements
cout << "Enter 5 nums for arr3 : ";
cin >> arr3[0];
cin >> arr3[1];
cin >> arr3[2];
cin >> arr3[3];
cin >> arr3[4];

cout << "MOdified array : " << endl;
cout << arr3[0] << endl;
cout << arr3[1] << endl;
cout << arr3[2] << endl;
cout << arr3[3] << endl;
cout << arr3[4] << endl;

cout << "the value of array name is : " << arr3 << endl;  // this shows the address value of 1st element of array.

return 0;

}

Output:

My first LeetCode(which I failed, although I had a correct logic in my mind)

VipulDeshmukh95 — Thu, 28 Jul 2022 20:16:00 +0000

LeetCode#242 Anagram Code

class Solution {
public:
bool isAnagram(string s, string t) {

   int n1 = s.length();
   int n2 = t.length();

    if((n1  > 50000) || (n2 > 50000))
    {
        return false;

    }
    if(n1 != n2)
    {
         return false;
    }

    //sorting both strings
    sort(s.begin(), s.end());
    sort(t.begin(), t.end());

    for(int i = 0; i <= n2; i++)
    {
         if(s[i] != s[i])
             return false;
    }

  return true;  
}

};