
يشهد مجمع التبيان التعليمى بجامع أم هذلول بأن الطالب
عمر خميس جمال الدين
قد أتم المراجعة من سورة الفاتحة وحتى سورة الأحزاب
وذلك خلال حضوره ليوم الهمة
المقام يوم السبت الموافق 14/6/1444
سائلين المولى عز وجل له التوفيق فى حفظ كتابه
1491. Average Salary Excluding the Minimum and Maximum Salary
class Solution {
public double average(int[] salary) {
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
double sum = 0;
for(int i = 0; i < salary.length; i++){
sum+=salary[i];
min = Integer.min(min,salary[i]);
max = Integer.max(max, salary[i]);
}
return (sum-min-max)/(salary.length - 2);
}
}
1523. Count Odd Numbers in an Interval Range
class Solution {
public int countOdds(int low, int high) {
int count = (high-low)/2;
if(high%2 ==0 && low%2 == 0){}
else count +=1;
return count;
}
}
class Solution {
public boolean wordPattern(String pattern, String s) {
HashMap<Character,String> map = new HashMap<>();
String[] sWords = s.split(" ");
if(sWords.length != pattern.length()) return false;
for(int i = 0; i < pattern.length(); i++){
for (Map.Entry<Character, String> entry : map.entrySet()) {
if(entry.getValue().equals(sWords[i]) && entry.getKey() != pattern.charAt(i)) return false;
if(!entry.getValue().equals(sWords[i]) && entry.getKey() == pattern.charAt(i)) return false;
}
map.put(pattern.charAt(i),sWords[i]);
}
return true;
}
}
شهادة اجتياز
تشهد حلقات جامع الخليل إبراهيم – عليه السلام – بحى الفيحاء
بأن المشارك / عمر خميس مصطفى جمال الدين
قد اجتاز الفرع الأول – القرآن كاملا – وذلك فى اليوم القرآنى الثالث المقام بالجامع يوم السبت 26/3/1444 هـ الموافق 22/10/2022 م
سائلين المولى له التوفيق والسداد
Omar GamalEldeen
has successfully completed the
Angular Development Cross Skilling Nanodegree program
offered by Udacity
Certificate link:
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
class Result {
/*
* Complete the 'isBalanced' function below.
*
* The function is expected to return a STRING.
* The function accepts STRING s as parameter.
*/
public static String isBalanced(String s) {
// Write your code here
Stack<Character> stack = new Stack<Character>();
for(int i = 0; i < s.length(); i++){
if("{([".contains(s.charAt(i)+"")) stack.push(s.charAt(i));
else if(s.charAt(i) == ']'){
if(stack.isEmpty()) return "NO";
if(stack.peek() != '[') return "NO";
stack.pop();
}
else if(s.charAt(i) == '}'){
if(stack.isEmpty()) return "NO";
if(stack.peek() != '{') return "NO";
stack.pop();
}
else if(s.charAt(i) == ')'){
if(stack.isEmpty()) return "NO";
if(stack.peek() != '(') return "NO";
stack.pop();
}
}
if(!stack.isEmpty()) return "NO";
return "YES";
}
}
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int t = Integer.parseInt(bufferedReader.readLine().trim());
IntStream.range(0, t).forEach(tItr -> {
try {
String s = bufferedReader.readLine();
String result = Result.isBalanced(s);
bufferedWriter.write(result);
bufferedWriter.newLine();
} catch (IOException ex) {
throw new RuntimeException(ex);
}
});
bufferedReader.close();
bufferedWriter.close();
}
}
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
static class SinglyLinkedListNode {
public int data;
public SinglyLinkedListNode next;
public SinglyLinkedListNode(int nodeData) {
this.data = nodeData;
this.next = null;
}
}
static class SinglyLinkedList {
public SinglyLinkedListNode head;
public SinglyLinkedListNode tail;
public SinglyLinkedList() {
this.head = null;
this.tail = null;
}
public void insertNode(int nodeData) {
SinglyLinkedListNode node = new SinglyLinkedListNode(nodeData);
if (this.head == null) {
this.head = node;
} else {
this.tail.next = node;
}
this.tail = node;
}
}
public static void printSinglyLinkedList(SinglyLinkedListNode node, String sep, BufferedWriter bufferedWriter) throws IOException {
while (node != null) {
bufferedWriter.write(String.valueOf(node.data));
node = node.next;
if (node != null) {
bufferedWriter.write(sep);
}
}
}
// Complete the mergeLists function below.
/*
* For your reference:
*
* SinglyLinkedListNode {
* int data;
* SinglyLinkedListNode next;
* }
*
*/
static SinglyLinkedListNode mergeLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
SinglyLinkedListNode out;
if(head1.data <= head2.data){
out = new SinglyLinkedListNode(head1.data);
head1 = head1.next;
}else{
out = new SinglyLinkedListNode(head2.data);
head2 = head2.next;
}
SinglyLinkedListNode last = out;
while(head1 != null || head2 != null){
if(head1 == null){
last.next = head2;
last = last.next;
head2 = head2.next;
}else if( head2 == null){
last.next = head1;
last = last.next;
head1 = head1.next;
}
else if(head1.data <= head2.data){
last.next = head1;
last = last.next;
head1 = head1.next;
}else if(head1.data > head2.data){
last.next = head2;
last = last.next;
head2 = head2.next;
}
}
return out;
}
private static final Scanner scanner = new Scanner(System.in);