๐ 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
* 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
๐๐ฆ ๐๐น๐ด๐ผ ๐ป ๐ ใ๐๐ผ๐บ๐ฝ๐ฒ๐๐ถ๐๐ถ๐๐ฒ ๐ฃ๐ฟ๐ผ๐ด๐ฟ๐ฎ๐บ๐บ๐ถ๐ป๐ดใ pinned ยซ๐ 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โฆยป
#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)
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
โ
โ
โ
#HackerRank Expand the Mathematical Expression - HackerRank Python Solution - IBM Code
https://csalgo.tech/threads/expand-the-mathematical-expression-hackerrank-python-solution.276/
https://csalgo.tech/threads/expand-the-mathematical-expression-hackerrank-python-solution.276/
CS-Algo
HackerRank - Expand the Mathematical Expression - HackerRank...
Expand the Mathematical Expression - HackerRank Python Solution
(Hidden text: Visit the forum thread!)
Expand the Mathematical Expression - HackerRank Python Solution
(Hidden text: Visit the forum thread!)
Expand the Mathematical Expression - HackerRank Python Solution
๐1
Amazon - LeetCode.pdf
648.1 KB
โ
โ
โ
Amazon LeetCode Question - 06 - June 2022
How many of you are appearing for TSLP this month ?
Anonymous Poll
40%
Yes , I'm appearing
60%
Noooooo
โค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 โ
{
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 โ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Deloitte
Role: Fresher's (Nothing mentioned as such)
Batch Eligible: 2021 and 2022
If interested send ur Resume at
rmahalakshmi@deloitte.com
Role: Fresher's (Nothing mentioned as such)
Batch Eligible: 2021 and 2022
If interested send ur Resume at
rmahalakshmi@deloitte.com
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
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 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โฆ
32-culture/experience
33-twitter,LinkedIn
34-a,bd,e
35-one whose decision making
36-caterogization
37-b,e
38-attending events
39-escalations
40-a,c
41-false
42-we need to maintain
43-a,c
44-self conscientious
46- b,c
47-it help us to look
48-never end up making
50- text based networking
51-flipping a coin
52-true
53-so we can complete more
54-identifying a problem
55-b,d,e
56-b,e
57-bas that is implicit
33-twitter,LinkedIn
34-a,bd,e
35-one whose decision making
36-caterogization
37-b,e
38-attending events
39-escalations
40-a,c
41-false
42-we need to maintain
43-a,c
44-self conscientious
46- b,c
47-it help us to look
48-never end up making
50- text based networking
51-flipping a coin
52-true
53-so we can complete more
54-identifying a problem
55-b,d,e
56-b,e
57-bas that is implicit
๐1
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
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
Share Screenshot to larger groups if you want more
Help us grow ๐ฅ
Help us grow ๐ฅ
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๐
โ Only first 100 response will entertain.
โ All the details will share on that post.
So, if interested please be online at 9PM Sharp๐
โค1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
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
โ 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
OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ
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 โฆ
โผ๏ธ OVER โผ๏ธ
3 min mein 100 resumes ๐๐๐โค๏ธโค๏ธโค๏ธโค๏ธ
Tm phod doge ek din๐๐
3 min mein 100 resumes ๐๐๐โค๏ธโค๏ธโค๏ธโค๏ธ
Tm phod doge ek din๐๐
Need answers for Bizz skill 2 Slot 8.30 p.m. today ?
(Share our link as much as you can )
(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 โ๏ธ
No need to pay anyone โ๏ธ
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
/*
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 ๐ฅ
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
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Publicis Sapient
Role: Data Analytics Intern Batch Eligible: Only 2022 Graduation
https://docs.google.com/forms/d/e/1FAIpQLSeCSZluPV_q2C9lpJ42mBOVVsm57T4VVr_JqlAHs9XJKA3LDA/viewform
Role: Data Analytics Intern Batch Eligible: Only 2022 Graduation
https://docs.google.com/forms/d/e/1FAIpQLSeCSZluPV_q2C9lpJ42mBOVVsm57T4VVr_JqlAHs9XJKA3LDA/viewform