ATS resume help
前往频道在 Telegram
WhatsApp Me https://wa.me/917674087200 ✅ ATS-Friendly Resumes ✅ Higher Interview Calls ✅ Free Tips + Templates
显示更多3 687
订阅者
-324 小时
-177 天
-8430 天
帖子存档
3 687
Mann'deep -- Write a SQL query to display the last name of the students who scored consistently during their midterm and full-term.
-- Student table [student_id, last_name, first_name, email, phone]
-- Registration table [reg_id, reg_year, reg_date, student_id, section_id, midterm_grade, fullterm_grade]
CREATE TABLE student (
student_id INTEGER PRIMARY KEY,
first_name TEXT,
last_name TEXT
);
CREATE TABLE registration (
reg_id INTEGER PRIMARY KEY,
student_id INTEGER,
midterm_grade TEXT,
fullterm_grade TEXT,
FOREIGN KEY (student_id) REFERENCES student(student_id)
);
INSERT INTO student VALUES (1, 'Pavan', 'Sai Ram');
INSERT INTO student VALUES (2, 'Ryan', 'Renolds');
INSERT INTO student VALUES (3, 'Sai', 'Ram');
INSERT INTO student VALUES (4, 'ABC', 'XYZ');
INSERT INTO registration VALUES (01, 1, 'A', 'A');
INSERT INTO registration VALUES (02, 2, 'A', 'B');
INSERT INTO registration VALUES (03, 3, 'B', 'C');
INSERT INTO registration VALUES (04, 4, 'F', 'F');
SELECT last_name
FROM student
WHERE student.student_id IN (
SELECT registration.student_id
FROM registration
WHERE registration.midterm_grade = registration.fullterm_grade
);
SELECT last_name FROM student, registration
WHERE student.student_id = registration.student_id
AND midterm_grade = fullterm_grade;
3 687
#include <stdio.h>
int main(void) {
int i, days, min, max, count, tree[100000];
scanf("%d", &days);
for(i = 0; i < days; i++)
scanf("%d", &tree[i]);
min = tree[0];
max = tree[0], count = 1;
for(i = 1; i < days; i++) {
if(tree[i] < min)
min = tree[i]; // last day.
if(tree[i] > max) {
max = tree[i];
count = 1;
}
if(tree[i] == max) // latest first day if repeat max
count++;
}
if(max + count <= days)
printf("%d\n", min + days + 1);
else
printf("%d\n", max + count + 1);
return 0;
}
Planting trees
C language
3 687
return(len(list(range((2+1)%input2))))
Python3 ✅👍
Code :: planting trees
All test cases pass 🤗✅
3 687
![package john; import java.util.Scanner; public class John { public static void main(String[] args) {  ](https://cdn.tlmtr.io/_next/static/media/empty-channel.35ed232f.svg)
package john;
import java.util.Scanner;
public class John {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = scan.nextInt();
int X = scan.nextInt();
int Parent[] = new int[N];
int sub[] = new int[N];
int c = 0;
for(int i=0; i<N; ++i)
{
Parent[i] =scan.nextInt();
if(Parent[i] != -1)
++sub[Parent[i]];
}
for(int i=0; i<N; ++i)
{
if(sub[i] >= X)
++c;
}
System.out.println(c);
}
}
Java
Parents Code ❤️✅
3 687
Those who want help in any exam today and tomorrow ❤️
Appitude or coding slots available ✅
contact✅ @PlacementsBro ✌️
Cost vary from 1300 - 1500/-
👉 cognizant( genc or elevate), Accenture , LTI ✅
