Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Qualcomm is hiring for their Software test teams in Hyderabad.
Batch eligible: 2021 and 2022 passouts (BTech, Mtech, (Cs, IT, ECE or Embedded))
Skills required: Good knowledge on C/ C++/ Python Coding, OS, DSA.
If interested send your resume over aayushar@qti.qualcomm.com
Batch eligible: 2021 and 2022 passouts (BTech, Mtech, (Cs, IT, ECE or Embedded))
Skills required: Good knowledge on C/ C++/ Python Coding, OS, DSA.
If interested send your resume over aayushar@qti.qualcomm.com
๐1
awk 'BEGIN{FS=";", count=0;}
{
if($4>10000)
{
count+=$3
}
}
END { if(count==0){
print "Total count: 0";
}
else
{
print "Total count:", count;
}
}'
TCS PRAโ
{
if($4>10000)
{
count+=$3
}
}
END { if(count==0){
print "Total count: 0";
}
else
{
print "Total count:", count;
}
}'
TCS PRAโ
๐2
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
User xexamster[] = new User[n];
for (int i = 0; i < xexamster.length; i++) {
int id = sc.nextInt();
sc.nextLine();
String name = sc.nextLine();
String emil = sc.nextLine();
int age = sc.nextInt();
sc.nextLine();
xexamster[i] = new User(id, name, emil, age);
}
int fs1 = sc.nextInt();
int ans1 = xexamster2(xexamster);
if (ans1 != 0) {
System.out.println(ans1);
} else {
System.out.println("No Users found.");
}
User ans2 = xexamster1(xexamster, fs1);
if (ans2 != null) {
System.out.println(ans2.getName());
System.out.println(ans2.getEmil());
} else {
System.out.println("No User found with the given id.");
}
}
public static int xexamster2(User[] d) {
int p = 0;
for (int i = 0; i < d.length; i++) {
{
p += d[i].getAge();
}
}
return p;
}
public static User xexamster1(User[] d, int s) {
User p = null;
int a = 0;
for (int i = 0; i < d.length; i++) {
if (d[i].getId() == s) {
p = d[i];
}
}
return p;
}
}
class User {
private int id;
private String name;
private String emil;
private int age;
public User(int id, String name, String emil, int age) {
super();
this.id = id;
this.name = name;
this.emil = emil;
this.age = age;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getEmil() {
return emil;
}
public void setEmil(String emil) {
this.emil = emil;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
}
//////////////////////// UNIX /////////////////
/*
* awk 'BEGIN{FS=";", count=0;} { if($4>10000) { count+=$3 } } END {
* if(count==0){ print "Total count: 0"; } else { print "Total count:", count; }
* }'
*
*
*/
TCS PRAโ
public class Solution {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
User xexamster[] = new User[n];
for (int i = 0; i < xexamster.length; i++) {
int id = sc.nextInt();
sc.nextLine();
String name = sc.nextLine();
String emil = sc.nextLine();
int age = sc.nextInt();
sc.nextLine();
xexamster[i] = new User(id, name, emil, age);
}
int fs1 = sc.nextInt();
int ans1 = xexamster2(xexamster);
if (ans1 != 0) {
System.out.println(ans1);
} else {
System.out.println("No Users found.");
}
User ans2 = xexamster1(xexamster, fs1);
if (ans2 != null) {
System.out.println(ans2.getName());
System.out.println(ans2.getEmil());
} else {
System.out.println("No User found with the given id.");
}
}
public static int xexamster2(User[] d) {
int p = 0;
for (int i = 0; i < d.length; i++) {
{
p += d[i].getAge();
}
}
return p;
}
public static User xexamster1(User[] d, int s) {
User p = null;
int a = 0;
for (int i = 0; i < d.length; i++) {
if (d[i].getId() == s) {
p = d[i];
}
}
return p;
}
}
class User {
private int id;
private String name;
private String emil;
private int age;
public User(int id, String name, String emil, int age) {
super();
this.id = id;
this.name = name;
this.emil = emil;
this.age = age;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getEmil() {
return emil;
}
public void setEmil(String emil) {
this.emil = emil;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
}
//////////////////////// UNIX /////////////////
/*
* awk 'BEGIN{FS=";", count=0;} { if($4>10000) { count+=$3 } } END {
* if(count==0){ print "Total count: 0"; } else { print "Total count:", count; }
* }'
*
*
*/
TCS PRAโ
Tcs WingsTech track 1 answers
1)c
Type /html
4)c
Private
18)screen
B
19)a
Challenging
20)d
Spawn
22)c
Source
24)b
App. Use
26)handlevent
D
27)b
Welcome.
1)c
Type /html
4)c
Private
18)screen
B
19)a
Challenging
20)d
Spawn
22)c
Source
24)b
App. Use
26)handlevent
D
27)b
Welcome.
Infosys Interview Experience
Show me your ID
Tell me about urself
Tell me about ur final year project
Local and global variable
Oops concepts
Do you have ur own laptop
What is RAM/ROM of ur laptop
Do you have any questions
Show me your ID
Tell me about urself
Tell me about ur final year project
Local and global variable
Oops concepts
Do you have ur own laptop
What is RAM/ROM of ur laptop
Do you have any questions
๐จ๐๐ ๐๐๐ ๐๐๐๐๐๐๐ ๐๐๐ ๐๐๐ ๐๐๐๐๐ ๐๐๐๐๐๐๐ ๐๐๐๐๐ ๐๐๐, ๐๐๐๐๐๐๐๐ ๐๐'๐ ๐๐๐๐๐ ๐๐ ๐๐ ๐๐๐๐๐ ๐๐ ๐โค๏ธ
Just trust the process and don't give upโ
Just trust the process and don't give upโ
โค3
Infosys interview Experience (SE Role)
1 Self intro
2 Work experience
3 oops
4 Polymorphism
5 Types interaction
6 Types of loops
7 Do u have laptop
8 About family
9 Any questions
1 Self intro
2 Work experience
3 oops
4 Polymorphism
5 Types interaction
6 Types of loops
7 Do u have laptop
8 About family
9 Any questions
โ ๏ธ Reminder - who didn't apply yet
MountBlue - t.me/fresherearth/2749
PhonePe - t.me/fresherearth/2750
Amazon Alexa - t.me/fresherearth/2751
Amagi - t.me/fresherearth/2752
โ Share in ur College WhatsApp Groups
๐Direct & 100% Ads Free Links
Telegram - t.me/fresherearth
MountBlue - t.me/fresherearth/2749
PhonePe - t.me/fresherearth/2750
Amazon Alexa - t.me/fresherearth/2751
Amagi - t.me/fresherearth/2752
โ Share in ur College WhatsApp Groups
๐Direct & 100% Ads Free Links
Telegram - t.me/fresherearth
Tcs wings Tech track t3 answers 8:30pm
1)print(sclar. Transform (data))
D
2)phyton functions
B
3)phyton - v
C
4)sk learn.model
A
6)a.
Histogram.
7)c
. det(n)
9)annual_review(1)
A
10)d. N
D
11)b
Barcharts
12) b
0-2
13)n+c
C
14)(14,44, 5
A
25)t test.
B
30)b
8
33)error
36)b
Norm. Cdf(1,0, 1,2,6, 5,9)
37)a
O to 19 ()
38)c
Tonikzer
39)b
Classfier. Fit(x_train
40)d
3 3 8 12 16
22)d
Tupple clients
26)a
Df1, df2, pandas.
8)c
Len(cities)
18)b
Pass
32)a
Index 0 1 2 3 4
1)print(sclar. Transform (data))
D
2)phyton functions
B
3)phyton - v
C
4)sk learn.model
A
6)a.
Histogram.
7)c
. det(n)
9)annual_review(1)
A
10)d. N
D
11)b
Barcharts
12) b
0-2
13)n+c
C
14)(14,44, 5
A
25)t test.
B
30)b
8
33)error
36)b
Norm. Cdf(1,0, 1,2,6, 5,9)
37)a
O to 19 ()
38)c
Tonikzer
39)b
Classfier. Fit(x_train
40)d
3 3 8 12 16
22)d
Tupple clients
26)a
Df1, df2, pandas.
8)c
Len(cities)
18)b
Pass
32)a
Index 0 1 2 3 4
๐1
TCS Wings Tech track t2 (11am slot answers)
3)show ()
A
4)narrow
B
3)show ()
A
4)narrow
B
โ
โ
โ
#HackerEarth Rearranging Arrays - Python HackerEarth Solution
https://csalgo.tech/threads/rearranging-arrays-python-hackerearth-solution.269/
https://csalgo.tech/threads/rearranging-arrays-python-hackerearth-solution.269/
CS-Algo
HackerEarth - Rearranging Arrays - Python HackerEarth Solution
Rearranging Arrays - Python HackerEarth Solution
(Hidden text: Visit the forum thread!)
Rearranging Arrays - Python HackerEarth Solution
(Hidden text: Visit the forum thread!)
Rearranging Arrays - Python HackerEarth Solution
โ
โ
โ
#HackerEarth Farthest From Zero - HackerEarth Java Solution
https://csalgo.tech/threads/farthest-from-zero-hackerearth-java-solution.270/
https://csalgo.tech/threads/farthest-from-zero-hackerearth-java-solution.270/
CS-Algo
HackerEarth - Farthest From Zero - HackerEarth Java Solution
Farthest From Zero - HackerEarth Java Solution
(Hidden text: Visit the forum thread!)
Farthest From Zero - HackerEarth Java Solution
(Hidden text: Visit the forum thread!)
Farthest From Zero - HackerEarth Java Solution
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Adobe is hiring
Role: Member of Technical Staff
Eligible batch: Only 2022 passouts
CTC: 26+ LPA
Apply Link: https://forms.office.com/Pages/ResponsePage.aspx?id=Wht7-jR7h0OUrtLBeN7O4YZ2zwmoRh1Pg8bkvwiS15BURU9CSlVYMlZKNVhCVTVXSlRGMVJQSVBYUS4u
If interested, apply right now.
Role: Member of Technical Staff
Eligible batch: Only 2022 passouts
CTC: 26+ LPA
Apply Link: https://forms.office.com/Pages/ResponsePage.aspx?id=Wht7-jR7h0OUrtLBeN7O4YZ2zwmoRh1Pg8bkvwiS15BURU9CSlVYMlZKNVhCVTVXSlRGMVJQSVBYUS4u
If interested, apply right now.
๐1
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
2017. Grid Game
You are given a 0-indexed 2D array grid of size 2 x n, where grid[r][c] represents the number of points at position (r, c) on the matrix. Two robots are playing a game on this matrix.
Both robots initially start at (0, 0) and want to reach (1, n-1). Each robot may only move to the right ((r, c) to (r, c + 1)) or down ((r, c) to (r + 1, c)).
At the start of the game, the first robot moves from (0, 0) to (1, n-1), collecting all the points from the cells on its path. For all cells (r, c) traversed on the path, grid[r][c] is set to 0. Then, the second robot moves from (0, 0) to (1, n-1), collecting the points on its path. Note that their paths may intersect with one another.
The first robot wants to minimize the number of points collected by the second robot. In contrast, the second robot wants to maximize the number of points it collects. If both robots play optimally, return the number of points collected by the second robot.
Input: grid = [[2,5,4],[1,5,1]]
Output: 4
Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.
The cells visited by the first robot are set to 0.
The second robot will collect 0 + 0 + 4 + 0 = 4 points.
class Solution {
public:
long long gridGame(vector<vector<int>>& grid) {
int n=grid[0].size();
long long f=0,s=0,res=LONG_MAX;
for(auto& i:grid[0])f+=i;
for(int i=0;i<n;i++){
f-=grid[0][i];
res=min(res,max(f,s));
s+=grid[1][i];
}
return res;
}
};
// TC O(N)
// SC O(1)
Amazon SDE1 (T1 interview question asked)
You are given a 0-indexed 2D array grid of size 2 x n, where grid[r][c] represents the number of points at position (r, c) on the matrix. Two robots are playing a game on this matrix.
Both robots initially start at (0, 0) and want to reach (1, n-1). Each robot may only move to the right ((r, c) to (r, c + 1)) or down ((r, c) to (r + 1, c)).
At the start of the game, the first robot moves from (0, 0) to (1, n-1), collecting all the points from the cells on its path. For all cells (r, c) traversed on the path, grid[r][c] is set to 0. Then, the second robot moves from (0, 0) to (1, n-1), collecting the points on its path. Note that their paths may intersect with one another.
The first robot wants to minimize the number of points collected by the second robot. In contrast, the second robot wants to maximize the number of points it collects. If both robots play optimally, return the number of points collected by the second robot.
Input: grid = [[2,5,4],[1,5,1]]
Output: 4
Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.
The cells visited by the first robot are set to 0.
The second robot will collect 0 + 0 + 4 + 0 = 4 points.
class Solution {
public:
long long gridGame(vector<vector<int>>& grid) {
int n=grid[0].size();
long long f=0,s=0,res=LONG_MAX;
for(auto& i:grid[0])f+=i;
for(int i=0;i<n;i++){
f-=grid[0][i];
res=min(res,max(f,s));
s+=grid[1][i];
}
return res;
}
};
// TC O(N)
// SC O(1)
Amazon SDE1 (T1 interview question asked)
Forwarded from OffCampus Jobs | OnCampus Jobs | Daily Jobs Updates | Lastest Jobs | All Jobs | CSE Jobs | Fresher Jobs โฅ (Dushyant)
Transpose Matrix
Given a 2D integer array matrix, return the transpose of matrix.
The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices.
Example 1:
Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
Output: [[1,4,7],[2,5,8],[3,6,9]]
Example 2:
Input: matrix = [[1,2,3],[4,5,6]]
Output: [[1,4],[2,5],[3,6]]
class Solution {
public:
vector<vector<int>> transpose(vector<vector<int>>& matrix) {
vector<vector<int>> ans;
for(int i=0;i<matrix[0].size();i++)
{
vector<int>temp;
for(int j=0;j<matrix.size();j++)
{
temp.push_back(matrix[j][i]);
}
ans.push_back(temp);
}
return ans;
}
};
// TC O(N*M)
// SC O(N*M)
Amazon SDE1 (T1 interview question asked)
Given a 2D integer array matrix, return the transpose of matrix.
The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices.
Example 1:
Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
Output: [[1,4,7],[2,5,8],[3,6,9]]
Example 2:
Input: matrix = [[1,2,3],[4,5,6]]
Output: [[1,4],[2,5],[3,6]]
class Solution {
public:
vector<vector<int>> transpose(vector<vector<int>>& matrix) {
vector<vector<int>> ans;
for(int i=0;i<matrix[0].size();i++)
{
vector<int>temp;
for(int j=0;j<matrix.size();j++)
{
temp.push_back(matrix[j][i]);
}
ans.push_back(temp);
}
return ans;
}
};
// TC O(N*M)
// SC O(N*M)
Amazon SDE1 (T1 interview question asked)
KPIT โ
(Python 3)
๐
๐๐๐ฅ๐ข๐ง๐ ๐ฐ๐ก๐๐ง ๐ฒ๐จ๐ฎ ๐๐จ๐ฆ๐ฉ๐ฅ๐๐ญ๐๐ ๐๐ฅ๐ฅ ๐ญ๐ก๐ ๐ญ๐๐ฌ๐ค๐ฌ ๐๐ง๐ ๐ฆ๐๐ซ๐ค ๐ญ๐ก๐๐ฆ โ
, ๐ข๐ญ'๐ฌ ๐ฎ๐ง๐ฆ๐๐ญ๐๐ก๐๐ ๐โค๏ธ
P.S. Start creating a list of task which you want to do on any particular day, trust me it will increase your productivity and help you being consistent โ
P.S. Start creating a list of task which you want to do on any particular day, trust me it will increase your productivity and help you being consistent โ
๐3