infinity agaase
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "projects": [ | |
| { | |
| "name": "Adarsh Palm Meadows", | |
| "location": "Whitefield, Bangalore", | |
| "type": "Residential", | |
| "unitVariations": "570 Victorian styled villas on 100 acres; 3 BHK villas (2,817 sq. ft. to 3,645 sq. ft.)", | |
| "amenityAndFeatures": "Landscaped open spaces, clubhouse", | |
| "timeline": "Commenced development in 1998; one of the first premium gated villa communities in India" | |
| }, |
agaase
/ gist:e188528c4cbb750a1ea8adc419ed3b4e
Created
November 12, 2024 08:01
la-onlinepmt-orders-query
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [ | |
| { | |
| $match: { | |
| status: "paid", | |
| } | |
| }, | |
| { | |
| $lookup: { | |
| from: "orders", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [{ | |
| $match: { | |
| status: {$ne: "cancelled"}, | |
| createdAt: {$gt: ISODate('2024-03-31')} | |
| } | |
| }, | |
| { | |
| $group: { | |
| _id: { day: { $dayOfMonth: "$createdAt"}, year: { $year: "$createdAt" } }, | |
| totalAmount: {$sum: "$revisedOrderTotal"} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <script src="https://rawgit.com/mauriciosantos/Buckets-JS/master/dist/buckets.js"></script> | |
| <meta charset="utf-8"> | |
| <meta name="viewport" content="width=device-width"> | |
| <title>JS Bin</title> | |
| </head> | |
| <body> | |
| <script id="jsbin-javascript"> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <script src="https://rawgit.com/mauriciosantos/Buckets-JS/master/dist/buckets.js"></script> | |
| <meta charset="utf-8"> | |
| <meta name="viewport" content="width=device-width"> | |
| <title>JS Bin</title> | |
| </head> | |
| <body> | |
| <script id="jsbin-javascript"> |
agaase
/ longest_valid_parentheses
Created
May 16, 2017 16:24
Given a string consisting of opening and closing parenthesis, find length of the longest valid parenthesis substring.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //http://practice.geeksforgeeks.org/problems/longest-valid-parentheses/0 | |
| var seq = [1,0,1,0,1,1] | |
| var counts = []; | |
| var stack = []; | |
| for(var i=seq.length-1;i>=0;i--){ | |
| var val = seq[i]; | |
| if(val){ | |
| stack.push(val); | |
| } | |
| if(!val){ |
agaase
/ word_break_dict
Created
May 16, 2017 16:12
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //http://practice.geeksforgeeks.org/problems/word-break-part-2/0 | |
| var candidates = []; | |
| var dict = ["snake", "snakes", "and", "sand", "ladder"]; | |
| var input = "snakesandladder"; | |
| for(var i=0;i<input.length;i++){ | |
| debugger; | |
| var chAtI = input.charAt(i); | |
| if(candidates.length){ |
agaase
/ max_abs_diff.js
Created
May 13, 2017 14:18
Max absolute difference between two sub contiguous arrays
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //Solution to problem here - http://practice.geeksforgeeks.org/problems/max-absolute-difference/0 | |
| var findCombination = function(arr){ | |
| debugger; | |
| var comb = []; | |
| if(arr.length>1){ | |
| comb.push(arr); | |
| comb = comb.concat(findCombination(arr.slice(1,arr.length))); | |
| comb = comb.concat(findCombination(arr.slice(0,arr.length-1))); | |
| return comb; | |
| }else{ |
agaase
/ max_abs_diff.js
Created
May 13, 2017 14:18
Max absolute difference between two sub contiguous arrays
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //Solution to problem here - http://practice.geeksforgeeks.org/problems/max-absolute-difference/0 | |
| var findCombination = function(arr){ | |
| debugger; | |
| var comb = []; | |
| if(arr.length>1){ | |
| comb.push(arr); | |
| comb = comb.concat(findCombination(arr.slice(1,arr.length))); | |
| comb = comb.concat(findCombination(arr.slice(0,arr.length-1))); | |
| return comb; | |
| }else{ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // You have L, a list containing some digits (0 to 9). Write a function answer(L) which finds the largest number that can be made from some or all of these digits and is divisible by 3. If it is not possible to make such a number, return 0 as the answer. L will contain anywhere from 1 to 9 digits. The same digit may appear multiple times in the list, but each element in the list may only be used once. | |
| var a = [3,1,4,1,5,9]; | |
| var max = 0; | |
| var pattern = function(arr){ | |
| if(arr.length==1){ | |
| return arr; | |
| } | |
| var patterns = []; |
NewerOlder