https://tatatechnologies.ripplehire.com/candidate/?token=FhhbYCnaWz3KYmeysFdD&lang=en&ref=LI01#apply/job/588227

*Fresher opening*

Hexaview Technologies Inc. hiring for QA (Freshers ) for
Noida location.

Send cv at ghulam.kashif@hexaviewtech.com (Sub: QA Fresher)
Position:-Software Quality Engineer (Fresher)
Location:- Noida
Eligibility Criteria - B. Tech/MCA/M.Tech -2021/2022
Job Description :
Software Quality Engineer Role:
Requirement:
Oops concepts
Testing understanding
Web and mobile testing concepts
SQL
Coding
Analytical skills
Communication
Attitude
Develop comprehensive test plans, test cases, and test scripts
based on software requirements and design documents.
Execute test cases and record test results, ensuring adherence
to established quality standards.
Collaborate with cross-functional teams, including developers,
product managers, and stakeholders, to understand project
requirements and drive quality improvements.
Conduct performance, scalability, and security testing to ensure
software stability and compliance.
Continuously improve testing processes and methodologies to
increase efficiency and effectiveness.

class UserMainCode(object):
    @staticmethod
    def arduino(input1, input2):
        cnt = 0
        ans = []
        for i in range(1, input1 + 1):
            for j in range(i):
                cnt+=input2[j]
                ans.append(cnt)
        return max(ans)

Ardunio ✅

if(input1=="rock"){
    return "paper";
  }
  else if(input1=="scissor"){
    return "rock";
  }
  else{
    return "scissor";
  }

Rock, paper, scissor ✅

class UserMainCode(object):
    @staticmethod
    def flipDivGame(input1, input2):
        ans = 1
        while ans <= 32:
            flip = input1 ^ (1 << (ans - 1))
            if flip % input2 == 0:
                return ans
            ans += 1
        return -1

Flip div game ✅

Job Title: Content Creator & Social Media Handler
Location: Remote
About Us:
Fuelemy focuses on streamlining fuel payments for transport businesses, addressing key pain points such as manual and insecure payment processes, risk of fraud and misuse, difficulty in reconciliation, lack of real-time visibility, and limited insights for optimization. We are dedicated to creating a secure, automated, and efficient platform that provides real-time visibility and actionable insights.
Responsibilities:
- Create engaging content for our social media platforms and website.
- Develop and implement content strategies to increase engagement .
- Collaborate with the team to align content with marketing goals.
- Monitor social media trends and adjust strategies accordingly.
Requirements:
- Proven experience in content creation and social media management.
- Strong writing, editing, and communication skills.
- Creativity and the ability to generate fresh, engaging ideas.
- Familiarity with social media analytics and tools.
- Ability to work independently and as part of a team in a fast-paced startup environment.

What We Offer:
- Opportunities for collaboration and professional networking.
- Enhancement of your portfolio with real-world projects.
- Development of industry-relevant skills and experience.
Join us and be part of an exciting journey in a rapidly evolving industry! If you are passionate about content creation and social media management and eager to grow with us, we'd love to hear from you.

To Apply:
Please send your resume and a brief introduction about yourself to shreybhargava10@gmail.com/shreyans@fuelemy.com/likhit@fuelemy.com

Also fill the form:-

https://docs.google.com/forms/d/e/1FAIpQLSfmq85u-bPb2Spm4MxrZeOmzQ31CS8FoFZ-o9TZRTbkbE2QIg/viewform



Monetary compensation won't be provided in initial months of joining .

#include <iostream>
#include <string>
using namespace std;
int sumOfPrimeDigits(int input1) {
    int prime_digits[] = {1, 2, 3, 5, 7};
    string str_N = to_string(input1);
    int prime_sum = 0;
    for (char ch : str_N) {
        int digit = ch - '0';
        for (int prime_digit : prime_digits) {
            if (digit == prime_digit) {
                prime_sum += digit;
                break;
            }
        }
    }
   
    return prime_sum;
}

string find_top_student(vector<string> names, vector<int> marks) {
    int max_marks = marks[0];
    string top_student = names[0];
    for (int i = 1; i < marks.size(); ++i) {
        if (marks[i] > max_marks) {
            max_marks = marks[i];
            top_student = names[i];
        }
    }
   
    return top_student;
}

Maximum marks ✅

class UserMainCode(object):
    @classmethod
    def classRoom(cls, input1, input2):
        res = [0] * input1
        seats = [0] * input1
        for i in range(input1):
            pref = input2[i]
            if seats[pref-1] == 0:
                seats[pref-1] = 1
                res[i] = pref
            else:
                for j in range(pref -1, input1):
                    if seats[j] == 0:
                        seats[j] = 1
                        res[i] = j + 1
                        break
                else:   
                    for j in range(0, pref-1):
                        if seats[j] == 0:
                            seats[j] = 1
                            res[i] = j + 1
                            break
        return res

Classroom ✅

Job Title: Full Stack Developer (React, Tailwind CSS, MERN Stack)
Location: Remote
About Us:
Fuelemy focuses on streamlining fuel payments for transport businesses, addressing key pain points such as manual and insecure payment processes, risk of fraud and misuse, difficulty in reconciliation, lack of real-time visibility, and limited insights for optimization. We are dedicated to creating a secure, automated, and efficient platform that provides real-time visibility and actionable insights.
Responsibilities:
- Develop and maintain front-end features using React and Tailwind CSS.
- Build and manage back-end services with the MERN stack (MongoDB, Express.js, React, Node.js).
- Collaborate with a dynamic and diverse team to bring projects to life.
- Participate in code reviews and contribute to improving our development processes.
Requirements:
- Proficiency in React and Tailwind CSS for front-end development.
- Experience with the MERN stack for back-end development.
- Ability to work independently and as part of a team in a fast-paced startup environment.
- Average communication skills.
What We Offer:
- Opportunities for collaboration and professional networking.
- Enhancement of your portfolio with real-world projects.
- Development of industry-relevant skills and experience.

Join us and be part of an exciting journey in a rapidly evolving industry! If you are passionate about full stack development and eager to grow with us, we'd love to hear from you.

To Apply:
Please send your resume and a brief introduction about yourself to shreybhargava10@gmail.com/shreyans@fuelemy.com.

Also fill this form :-

https://docs.google.com/forms/d/e/1FAIpQLSfmq85u-bPb2Spm4MxrZeOmzQ31CS8FoFZ-o9TZRTbkbE2QIg/viewform



Monetary compensation won't be provided in initial months of joining .

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void dfs(int node, int parent, const vector<vector<int>>& adj, const vector<bool>& hasFruit, vector<bool>& visited, int& time) {
    visited[node] = true;
    for (int neighbor : adj[node]) {
        if (neighbor == parent || visited[neighbor]) continue;
        dfs(neighbor, node, adj, hasFruit, visited, time);
        if (hasFruit[neighbor]) {
            time += 2;
        }
    }
}
int minTime(int n, vector<vector<int>>& edges, vector<bool>& hasFruit) {
    vector<vector<int>> adj(n);
    for (const auto& edge : edges) {
        adj[edge[0]].push_back(edge[1]);
        adj[edge[1]].push_back(edge[0]);
    }

    int time = 0;
    vector<bool> visited(n, false);
    dfs(0, -1, adj, hasFruit, visited, time);
    return time;
}

Magical Forest ✅

def min_window(s: str, t: str) -> str:
    from collections import Counter

   
    target_count = Counter(t)
    required_count = len(target_count)
    formed = 0
    window_counts = {}
   
   
    min_window_length = float('inf')
    min_window_start = 0
    left, right = 0, 0

  
    while right < len(s):
       
        char = s[right]
        window_counts[char] = window_counts.get(char, 0) + 1
       
     
        if char in target_count and window_counts[char] == target_count[char]:
            formed += 1
       
       
        while left <= right and formed == required_count:
          
            if right - left + 1 < min_window_length:
                min_window_length = right - left + 1
                min_window_start = left
           
         
            char = s[left]
            window_counts[char] -= 1
            if char in target_count and window_counts[char] < target_count[char]:
                formed -= 1
           
           
            left += 1
       
       
        right += 1
   
   
    return s[min_window_start:min_window_start + min_window_length] if min_window_length != float('inf') else "N/A"