๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.59K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
FresherOpportunityAlert

Fujitsu is Hiring For Trainee #Freshers!

Hiring For Trainee Freshers (2022 to 2023 Passed Out)

Position- Software Trainee.

Location -Pune, Chennai, Hyderabad, Bangalore and Noida

B.E./B. Tech. (CS/ IT/ECE, ENTC) MCA/BCA, MCS/BCS, MSC(IT, CS, ECE) Freshers of 2022/2023

Freshers who certified any IT technologies will have an added advantage.

Interested can share the your profile to Priyanka.bhosale@fujitsu.com
Trained freshers Hiring..!!!!
1. JAVA (Fullstack)
2. QA (Manual & Automation selenium with JAVA and Frameworks)
NOTE: Must be trained on above any one technology.

Work Location : Hyderabad
Mode of work : WFO (Onsite)

# immediate joiners only preferred

Interested candidates kindly share your profiles to prem@defteam.co
๐Ÿ˜ฑ1
def find_first_non_repeating_character(s):
    char_count = {}

    for char in s:
        if char in char_count:
            char_count[char] += 1
        else:
            char_count[char] = 1

    for char in s:
        if char_count[char] == 1:
            return char

    return -1

str_input = input()
result = find_first_non_repeating_character(str_input)
print(result)
๐Ÿ‘2
#include <iostream>
#include <vector>
#include <string>
#include <cctype>

void capitalizeFirstLetter(std::vector<std::string>& strings) {
    for (std::string& str : strings) {
        if (!str.empty()) {
            str[0] = std::toupper(str[0]);
        }
    }
}