Сообщения

test

  package az.kapitalbank.atlas.card.account.service; import static az.kapitalbank.atlas.card.account.domain.Attribute. EXT_ACCOUNT_NUMBER ; import static az.kapitalbank.atlas.card.account.domain.Attribute. IBAN ; import az.kapitalbank.atlas.card.account.config.ApplicationProperties; import az.kapitalbank.atlas.card.account.domain.Account; import az.kapitalbank.atlas.card.account.domain.Card; import az.kapitalbank.atlas.card.account.dto.AccountDto; import az.kapitalbank.atlas.card.account.dto.AttributeDto; import az.kapitalbank.atlas.card.account.dto.CardDto; import az.kapitalbank.atlas.card.account.dto.request.AccountSearchFilter; import az.kapitalbank.atlas.card.account.dto.request.CreateAccountRequest; import az.kapitalbank.atlas.card.account.dto.request.UpdateAccountAttributeRequest; import az.kapitalbank.atlas.card.account.dto.request.UpdateAccountRequest; import az.kapitalbank.atlas.card.account.dto.request.UpdateAccountStatusRequest; import az.kapitalbank.atlas.card.account.d...

DSA - Loop

 1. Print x: int main () { int n; cin >> n; for ( int i = 0 ; i < n * n; i++) { int row = i / n; int col = i % n; if (row == col || row + col == n - 1 ) { cout << "*" ; } else { cout << " " ; } if (col == n - 1 ) { cout << endl ; } } }

yaml

logging : level : ROOT : WARN az.kapitalbank.atlas : DEBUG management : endpoints : web : exposure : include : [ "env" , "health" , "info" , "refresh" ] health : consul : enabled : false vault : enabled : false spring : datasource : url : jdbc:oracle:thin:@${ DB_HOST :10.0.32.28}:${ DB_PORT :1521}/externalinteg username : ${ DB_USERNAME :MKR} password : ${ DB_PASSWORD :MdfdhKsgdskad97067!!} driver-class-name : oracle.jdbc.OracleDriver type : com.zaxxer.hikari.HikariDataSource hikari : pool-name : MyHikariCP maximum-pool-size : 10 minimum-idle : 5 connection-timeout : 30000 idle-timeout : 300000 max-lifetime : 1800000 jpa : hibernate : ddl-auto : none properties : hibernate : format_sql : true show_sql : true jdbc : batch_versioned_data : true batch_size : 20 ord...

Tree

Tree Terminology: 1. Root: top node without parents 2. Edge: a link between parent and child  3. Leaf: a node which does not have children 4. Sibling: children of same parent 5. Ancestor: parent, grandparent, great grandparent of a node 6. Depth of node: a length of the path from root to node 7. Height of node: a length of the path from the node to the deepest node  8. Depth of tree: depth of root node 9. Height of tree: height of root node

Sorting Algorithms

 1. Bubble sort. public static int bubble3 ( int [] arr) { boolean swapped; int count = 0 ; int n = arr. length ; for ( int i = 0 ; i < n - 1 ; i++) { swapped = false ; for ( int j = 0 ; j < n - i - 1 ; j++) { count++; if (arr[j] > arr[j + 1 ]) { swapped = true ; int temp = arr[j]; arr[j] = arr[j + 1 ]; arr[j + 1 ] = temp; } } if (!swapped) break ; } return count; } 2. Selection sort. public static int selectionSort1 ( int [] arr) { int count = 0 ; int n = arr. length ; for ( int i = 0 ; i < n - 1 ; i++) { int min = i; for ( int j = i + 1 ; j < n; j++) { count++; if (arr[j] < arr[min]) { min = j; } } if (min != i) { int temp = arr[i]; arr[i] = arr[min]; arr[min] = temp; } ...

DSA: Circular Queue

package az.etibarli.queue; public class CircularQueue< T > { private T [] queue ; private int size = 0 ; private int front = 0 ; private int end = 0 ; public CircularQueue () { this ( 5 ); } public CircularQueue ( int capacity) { queue = ( T []) new Object[capacity]; } public boolean add ( T element) { if (isFull()) { resize(); } queue [ end ++] = element; end = end % queue . length ; size ++; return true ; } public T remove () { if (isEmpty()) { return null ; } T element = queue [ front ]; queue [ front ] = null ; front = ( front + 1 ) % queue . length ; size --; return element; } public T peek () { if (isEmpty()) { return null ; } return queue [ front ]; } public int size () { return size ; } public boolean isEmpty () { ...

Kapital Bank - SWIFT project