๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
๐Ÿ”” Adobe Off Campus Drive 2022 : Mass Hiring for Freshers With 26 LPA

* Designation : Member of Technical Staff
* Eligibility : B.E/B.Tech/M.E/M.Tech
* Batch : 2021 , 2022
* Job Location : Bangalore
* Experience : Freshers
* Salary : Rs 26 LPA

Apply Here

โœ… Share in ur College WhatsApp Groups
๐Ÿ“ŒDirect & 100% Ads Free Links
Telegram -
t.me/fresherearth
๐Ÿ‘2
#use 1st line for permutations
from itertools import permutations

li=[]
ans =[]
re = []
li = list(permutations(input))
for i in li:
s =0
for j in range(len(i)):
op = 2**j
s += i[j]//op
ans.append(s)
for i in input3:
a =0
for j in ans:
if i<=j:
a+= 1
re.append(a)
return(re)

Farmer jhons dilemma โœ…
(Python 3)
๐Ÿ‘1๐Ÿ”ฅ1
awk 'BEGIN{FS="|";count=0;}
{
if(tolower(substr($4,1,2))=="dl")
{
print ($1":"$2":Delhi");
count++;
}
else if(tolower(substr($4,1,2))=="gw")
{
print ($1":"$2":Guwahati");
count++;
}
}
END{
if(count==0)
{
print "No License records found."
}
}'

TCS IRA โœ…
Biz Skills Track 1 Slot 1 Answers (TCS) โœ…

1 - Respect/Listen
2-trying to network
3- Active associates/passive associates
4- all are correct
5- Meditation
6- A, D
7- Their are many criteria
8-d-it may not reduce
E- it does not outline
9- A,C,F
10-the ability to manage
11-they througly explore
12-b,c.
13-b,c,e
14-a,c,e,f
15-Observe ,design , execute
16-true
17-can take several forms
18-jennifer oversimplified
19-manager or lead encourages
20-b-insight people
C- be respectful
21-she is important but is unable
22-Globalization
24- morals
25-verbal skills
26-gender dominance
27- you may have conversations
29- mind mapping, hypothesis
31-d,f
๐Ÿ‘2
Biz Skills Track 1 Slot 2 (3 Pm) Answers (TCS) โœ…

1)false
2)a, c
Confident, accessibility
3)b
Talk about the weather
4)a
Organizational band
5)c, e, f
Reguraly c
You can get e
You can postion f
6)f
How
7)a b d
Mentor rele a
Mentor helps b
Mentor mene d
8)b
Know there sytle
9)c
Compassion
10)a b c
A every activitity a
Takes breaks b
Indify c
11)the amount of overlap
12)q)offering help raise profile
True
A
13)a d
Remote a
Quick nd eassy d
14)d
Uncertainty
15)b
Define goal
17)b
Equal opportunites
I talked with Hexaview recruiter. He will hire some good ones from here who are graduating in 2022 Only, at 9PM will post one Google form link over LinkedIn (He need only resume)

โœ…Only first 100 response will entertain.

โœ…All the details will share on that post.

So, if interested please be online at 9PM Sharp๐Ÿ˜Š
โค1
Hexaview is hiring for below roles (There is a bond of 2 years)

โœ…Only first 100 resumes will entertain.

โœ…Please see below the details :

On-Job Training
Duration - 6 months
Stipend - 20,000 INR for Application Engineer and Member of Technical Staff
Stipend - 35,000 INR for Software Development Engineer

Post-Training

โœ…CTC for 2022 passouts:
Software Development Engineer : 9 LPA
Member of technical staff : 7 LPA
Application Engineer : 5 LPA



The Job profile preference is in the hands of management based upon your performance in interview.

Job Description-
Employment Type: Full-time

Work week: 5 days

Location Noida, Pune

Service Level Agreement: Period- 24 months (includes 6 months of training)

Service Agreement Penalty- 3 LPA

โœ…Apply Link: https://forms.gle/qdHMXLX7PvFDewbY8
Need answers for Bizz skill 2 Slot 8.30 p.m. today ?
(Share our link as much as you can )
Anonymous Poll
77%
Yes
23%
No
If we get 5.5k subscribers today I'll share all answers with you .
No need to pay anyone โœŒ๏ธ
/*
167. Two Sum II - Input Array Is Sorted
Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1 <= index1 < index2 <= numbers.length.
Return the indices of the two numbers, index1 and index2, added by one as an integer array [index1, index2] of length 2.
The tests are generated such that there is exactly one solution. You may not use the same element twice.
Your solution must use only constant extra space.
Example 1:
Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore, index1 = 1, index2 = 2. We return [1, 2].
*/
class Solution
{
public:
vector<int> twoSum(vector<int> &nums, int target)
{
int i = 0, j = nums.size() - 1;
while (i < j)
{
int sum = nums[i] + nums[j];
if (sum == target)
return {i + 1, j + 1};
else if (sum > target)
j--;
else
i++;
}
return {}; // Target not found
}
};
// Time Complexity : O(N)
// Space Complexity : O(1)



Guys this is very very important questions for Amazon interview ๐Ÿ”ฅ
๐Ÿ‘2