I hereby claim:
- I am thecoducer on github.
- I am thecoducer (https://keybase.io/thecoducer) on keybase.
- I have a public key whose fingerprint is C0C9 DEAD F83B 6D42 D60E 10FC 0C86 3D0F 346B 9AB9
To claim this, I am signing this object:
{ | |
"cartId": 23468, | |
"paymentDetails": { | |
"id": 124510, | |
"status": "PENDING", | |
"payable": { | |
"byCashPreTax": "1000.00", | |
"byCashPostTax": "1180.00", | |
"total": "1190.00", | |
"tax": { |
public void fetchAndSetValuesData(UniformRequest request, EmployeeWiseDataSet employeeWiseDataSet, CustomerDao customerDao, GlobalStore globalStore) { | |
List<?> customerIdsList = customerDao.getCustomerIdsForTotalCustomer(); | |
List<?> enquiryIdsList = null; | |
if(ValidatorUtil.isEmptyOrNull(customerIdsList)) { | |
employeeWiseDataSet.setTotalCustomerEnquiryValues(new HashMap<>()); | |
}else{ | |
EnquiryDao enquiryDao = (EnquiryDao) globalStore.getRepositoryManagerMap().get("enquiryDao"); | |
enquiryIdsList = enquiryDao.getEnquiryIdsByCustomerIds(ConversionUtil.listToCommaSeparatedString(customerIdsList)); | |
} |
import java.util.*; | |
class Solution { | |
public static void main(String args[]) { | |
Scanner in = new Scanner(System.in); | |
int n = in.nextInt(); | |
int result = 0; | |
if(n % 2 == 0) { |
import java.util.*; | |
class Solution { | |
public static void main(String args[]) { | |
Scanner in = new Scanner(System.in); | |
String str = in.nextLine(); | |
String str1 = in.nextLine(); | |
String str2 = in.nextLine(); | |
int startIndex = 0; |
import java.util.*; | |
class Solution { | |
public static void main(String args[]) { | |
Scanner in = new Scanner(System.in); | |
String str = in.nextLine(); | |
char c = in.next().charAt(0); | |
int freq = 0; | |
String finalStr = ""; |
I hereby claim:
To claim this, I am signing this object:
I hereby claim:
To claim this, I am signing this object:
/* json.dumps(StatusObject._json) */ | |
{ | |
"created_at": "Thu Jul 28 00:08:39 +0000 2016", | |
"in_reply_to_status_id": null, | |
"id_str": "758454081656467456", | |
"retweeted": false, | |
"entities": { | |
"hashtags": [ | |
{ |
#include<bits/stdc++.h> | |
using namespace std; | |
int main(void) | |
{ | |
int t; | |
long n, sum = 0; | |
cin >> t; | |
while(t--){ | |
cin >> n; | |
sum = ((n * (n + 1)) * ((2 * n) + 4)) / 12; |
// Since the result can be large | |
// long long is used as return type | |
long long countdigits(int n){ | |
if(n <= 1) | |
return n; | |
else{ | |
double x = ((n * log10(n / M_E)) + (log10(2 * M_PI * n) / 2.0)); | |
return floor(x) + 1; | |
} | |
} |