Java

I have been using whois for a long time(around 10 years). and if you are sending this whois queries from same ip and higher then expected. you will start seeing ripe.net access denied results. one solution is restart your adsl modem. or start using another ip. and my solution is TOR :) sudo apt install tor torsocks you will need to configure torify check https://www.linux.com/blog/beginners-guide-tor-ubuntu torify whois 25.166.194.172 and I did not wanted to run in my server. therefore amazon free instance and a micro service https://github.com/ozkanpakdil/CommandRunner did the trick. ...

the -silent mode is actually console installation without gui. Create 2 files 1 responseFile.properties [ENGINE] Response File Version=1.0.0.0.0 [GENERIC] ORACLE_HOME=/path-to-install-to INSTALL_TYPE=WebLogic Server MYORACLESUPPORT_USERNAME= MYORACLESUPPORT_PASSWORD= DECLINE_SECURITY_UPDATES=true SECURITY_UPDATES_VIA_MYORACLESUPPORT=false PROXY_HOST= PROXY_PORT= PROXY_USER= PROXY_PWD=<SECURE VALUE> COLLECTOR_SUPPORTHUB_URL= oraInst.loc inventory_loc=/inventory/ inst_group=users Run this command in shell java -jar fmw_12.2.1.1.0_wls.jar -silent -invPtrLoc /fullpath/oraInst.loc -responseFile /fullpath/responseFile.properties for windows java -jar fmw_12.2.1.1.0_wls.jar -silent -invPtrLoc c:\oracle\oraInst.loc -responseFile c:\oracle\responseFile.properties in responseFile.properties change ORACLE_HOME=c:\\some-path-to-install

I was trying to solve hackerrank questions. it has been long time I write anything directly related to arrays. mostly coding after some point is db related and mostly used lists there. anyway here is how you can solve https://www.hackerrank.com/challenges/diagonal-difference this question in O(n square) and O(n). import java.io.*; import java.util.*; public class Solution { public static void main(String[] args) { Scanner stdin = new Scanner(System.in); final int n = stdin.nextInt(); long sum = 0; long sum1 = 0; long[][] matris = new long[n][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { matris[i][j] = stdin.nextLong(); } } for (int i = 0; i < n; i++) { // System.out.println(matris[i][i]); sum += matris[i][i]; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (i + j == n - 1) { // System.out.println(matris[i][j]); sum1 += matris[i][j]; } } } for (int i = n - 1; i >= 0; i--) { System.out.println(matris[i][n - 1 - i]); } System.out.println(Math.abs(sum - sum1)); } }

normally you dont need this but sometime you may need to work with some special products like weblogic. and you may just need to add a dependincy from already installed weblogic. <dependency> <groupId>weblogic</groupId> <artifactId>weblogic</artifactId> <version>1</version> <scope>system</scope> <systemPath>C:\wl12\wlserver\modules\features\weblogic.server.merged.jar</systemPath> </dependency> this is working in windows as you guess :)