Workday
https://mastercard.wd1.myworkdayjobs.com/CorporateCareers/login?redirect=%2FCorporateCareers%2Fjob%2FPune-India%2FSoftware-Engineering_R-178114%2Fapply%3Fsource%3DLINKEDIN

MasterCard software dev role

issue with the site just now we raised issue try after sometime

SATHYA TECHNOLOGIES
https://t.me/sathyareact

Join the channel for react JS class

<script>
let obj = {
key1:{
sub: "ReactJS"
}
}
//let {key1} =obj;
//let {sub} =key1;
document.write(obj.key1.sub);
</script>

direct extraction from object

<script>
let obj={
key1:{
sub: "ReactJS"
},
key2:{
sub: "NodeJs"
}
}
let {key1,key2} = obj;
let {sub:sub1}=key1;
let {sub:sub2}=key2;
document.write(sub1,sub2);
//ReactJS NodeJs
</script>

<script>
let obj={
key1:function(){
return hello
}
};
let {key1} =obj;
document.write(key1());

</script>

<script>
let obj = {
key1:function(){
return{

key1 :"hello"
}
}
};
let {key1} = obj;
let a=key1();
document.write(a.key1);
</script>

<script>

let obj = {

name: "Sathya",

batch: "K L M N Batck",

course: "ReactJS",

students: [{rno: 111, name: "bhavani", company : "tcs"},

{rno 222, name : "bhavani1", company: "infosys"}, {rno 333, name: "bhavani2", company : "wipro"},

{rno 444, name: "bhavan3", company : "amazon"}, {rno 555, name : "bhavan4", company "twitter"}],

feedback:

};

"good"

</script>

<script>
let arr = [10,20,30,40,50];
let newArr= arr.map((element,index)=>{
return element*10;
})
document.write(newArr);
100,200,300,400,500
</script>

let arr = [{key1: "Hello_1"},{key1: "Hello_2"},{key1: "Hello_3"},{key1: "Hello_4"},{key1:

"Hello_5"}];

o/p:

▼(5) [{-}, {-}, {-}, {---}, {---}] @

▶0: {key1: 'Hello_1', key2: 'Welcome_1'}

1: {key1: 'Hello_2', key2: 'Welcome_2'}

► 2: {key1: 'Hello_3', key2: 'Welcome_3'}

▶3: {key1: 'Hello_4', key2: 'Welcome_4'}

▶4: {key1: 'Hello_5', key2: 'Welcome 5'}

use Map method for this

<script>
let arr =[10000,20000,30000,40000,50000];
let newArr= arr.filter((element,index)=>{
return element>=30000;
})
document.write(newArr)
30000,40000,50000
</script>

filter() implementation

Apply Now 🙂 it's available

Problem 4
Complexity: Medium
You have been given a set of n integers. You need to write a program that will divide the set in two subsets of n/2 sizes each such that the difference of the sum of two subsets is as minimum as possible.
Note: n is even, hence sizes of two subsets must be strictly n/2

For example,

Input = {3, 4, 5, 3, 100, 1, 83, 54, 23, 20}
Output = {4, 100, 1, 23, 20} and {3, 5, 3, 83, 54}.
Both output subsets are of size 5 and sum of elements in both subsets is same (148 and 148).