en
Feedback

Don't get caught by a cheater! Telemetrio finds and tags such channels 👉 If you want to see the tag, subscribe

Coding Solutions Group

Coding Solutions Group

Open in Telegram

Show more
IndiaThe category is not specified
2 051
Subscribers
No data24 hours
No data7 days
No data30 days
Posts Archive
Hi Arun Welcome to this Community. Join Our Channel for daily Off-Campus Job Updates ❤️ 👇👇 @offcampusjobs_0 @offcampusjobs_0
25 Mar 2022, 10:48

AnimatedSticker.tgs0.14 KB
03 May 2021, 12:15

Jb likha h mail pe jb hona hoga 48 ghnte pehle bta denge advance me
20 Jun 2021, 08:08

https://shop.spreadshirt.com/liberty- Guys if anyone wants to buy clothes please use this link to buy because clothes are of good quality. You will get not only clothes but also cups, masks, bottles, bags etc. So please use this link and buy any product from that site
19 May 2021, 07:25

Hi saisri , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
02 Apr 2021, 03:54

Anyooone neeeded helpp for TechMahindra V4 examss cannn pinnnggg mee
15 May 2022, 05:08

Sheldon is a huge fan of comic books, and he loves to co many new comic books as possible At the comic store them ar (N) comic books Sheldon has (X) Dollars in cash Comic books we always sold in pairs Determine the maximum number of comic book pairs Sheldon can purchase with the given cash. List all the purchased comic books in the increasing order of their price (P Books with same price are to be listed in alphabetical order. If none can be purchased print NONE in the output Input: 1 Number of Comic Books in the store (N) 2. Cash held by Sheldon (X) 3. Next N lines Names of each comic book N₁ N2 N3 No 4. Price of each comic book in a space separated form. (P1 P2 P3... Pn) Output: 0≤Pi≤103 0 ≤ X ≤ 105 Sample input 5 70 Heroic Horizons Darkstar Defenders Eternal Emissaries Mystic Metropolis Cosmic Crusaders 10 10 30 10 40 Sample output: Darkstar Defenders - 10 Heroic Horizons - 10 Mystic Metropolis - 10 Eternal Emissaries - 30 Explanation Reasoning: Sheldon can buy 2 comic book pairs Sample: Input: 6 55 Cyber Sirens Timebenders Celestial Sparks The Quantum Squad Astral Aces Lunar Legion 5 5 5 5 10 10 Output: Celestial Sparks - 5 Cyber Sirens - 5 The Quantum Squad - 5 Timebenders - 5 Astral Aces- 10 Lunar Legion - 10 Reasoning: Sheldon can buy all comic book pairs Input: 6 20 Cyber Sirens Timebenders Celestial Sparks The Quantum Squad Astral Aces Lunar Legion 10 20 30 10 40 Output: NONE Reasoning: Sheldon cannot buy any comics as each pair of comic book price is higher than the cash he has Note: Your code must be able to print the sample output from the provided sample input. However, your code is run against multiple hidden test cases. Therefore, your code must pass these hidden test cases to solve the problem statement. Limits Time Limit: 1.0 sec(s) for each input file Memory Limit: 256 MB Source Limit: 1024 KB Scoring Score is assigned if any testcase passes Allowed Languages Java 8, Java 14
12 Aug 2023, 10:16

Hi Aiswarya , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
03 Apr 2021, 03:39

Python John code Telegram - https://t.me/Coding_solution_0
23 Dec 2021, 01:49

Got Mountblue Test result wrote on 23rd Jan
Public voting
24 Jan 2021, 10:09

Bob is palying questions ??
08 Aug 2021, 03:50

Hi Prabhav , Welcome to this Community for 2022 Batch Daily Off Campus Jobs Updates join this channel ✅ 👇👇 @offcampusjobs_0 @offcampusjobs_0
01 Apr 2021, 00:48

DSA complete handwritten notes❤️
31 Aug 2021, 20:39

arr = [1, 2, 3, 4, 2, 7, 8, 8, 3];        print("Duplicate elements in given array: ");   #Searches for duplicate element   for i in range(0, len(arr)):       for j in range(i+1, len(arr)):           if(arr[i] == arr[j]):               print(arr[j]);   Telegram- https://t.me/Coding_solution_0
17 Dec 2021, 05:30

26 Dec 2021, 22:50

03 Apr 2021, 03:55

Wilp
01 Jan 2021, 19:30

03 Apr 2021, 04:12

Any one have cognizant exam on jan 6th
04 Jan 2022, 10:33

27 Jan 2022, 05:10