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
| { | |
| "cur": "USD", | |
| "id": "71ee43cd974c43e9a6ad59b7386279b8", | |
| "seatbid": [ | |
| { | |
| "bid": [ | |
| { | |
| "nurl": "http://et-eus.w.inmobi.com/c.asm/HDbA1qWZgLjkBRb21AgUXBS8ARX8BRsBWBgkMDNmOWYwZTQtOTM3ZC00Zjg1LTkyNzUtZjUzMGUwMTA3YjJmHBUEFRgVAhWgBhUCJQAoBnNfb3J0YgATACXKARgYWTI5dExtNTFkQzVwWkM1emRHbGphMlZ5FsCNtwEcHBaAwOiXwMrLnkYW4f3__9_gwP89AAAVGBcAAAAAAIBRQBIUABwSGRUCABbAjbcBGANVU0QW3rut0-9eGfUV6J0B_qsBnKwBtqwByrsBkssBlMsBmssB9ssBmswBnMwBoMwByMwBzMwB1swB1tMB4OIB_OsB5pkC4NcCuIcDIRhcDAABCwABAAAAIDg4YjM3ZWZjZDVmMzRkMzY4ZTYwMzE3YzcwNjk0MmE0CgACAAAAAAAXY2UABAACAAAAAAAAAAAKAAQAAAAAABbjYAoABQAAAAAAEAWQAgAGAAA4FwQAAUBRgAAAAAAABAACP4R64UeuFHsAGNkBAwABBwgAAgAAABEGAAUBLAYABgD6CwAHAAAABTQuMC4wCwAIAAAAA0FQUAgACQAAAAACAAoBBAAMP3iTdLxqfvoLAA8AAAAMTk9fVEFSR0VUSU5HCAASAADgDgsAFAAAACA3OWMxYjcxNTg1ZWE0MmM3OTI3MTEwODJjOTVkNTdmMQIAFQAIABYAAAAACwAXAAAAAzYuMAIAGAACABkAAgAbAAYAHAAAAgAdAQIAIAACACEBCgAlAAAAAAAAAAALACgAAAASY29tLm51dC5pZC5zdGlja2VyABiTAgoAAQAAAAAAAAAACwACAAAA9AsAAQAAABJjb20ubn |
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
| class Solution { | |
| public Node flatten(Node head) { | |
| Node node=head; | |
| while(node!=null){ | |
| node=insert(node.child,node,node.next); | |
| } | |
| return head; | |
| } | |
| public Node insert(Node child,Node pre,Node next){ | |
| if(child==null)return next; |
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
| package com.tei; | |
| public class StringRotation { | |
| boolean isRotation(String str1, String str2) { | |
| if (str1.length() == str2.length() && str1.length() > 0) { | |
| return isSubstring(str1 + str1, str2); | |
| } | |
| return false; | |
| } | |
| } |
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
| package com.tei; | |
| import java.util.Arrays; | |
| public class ZeroMatrix { | |
| static void setZeroMatrix(int[][] matrix) { | |
| boolean[] rowHaszero = new boolean[matrix.length]; | |
| boolean[] columnHaszero = new boolean[matrix[0].length]; | |
| for (int i = 0; i < matrix.length; i++) { | |
| for (int j = 0; j < matrix[0].length; j++) { |
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
| package com.tei; | |
| import java.util.Arrays; | |
| public class Rotation { | |
| static boolean rotate(int[][] matrix) { | |
| if (matrix.length == 0 || matrix.length != matrix[0].length) { | |
| return false; | |
| } | |
| int n = matrix.length; |
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
| package com.tei; | |
| public class compresseddString { | |
| static String compress(String str) { | |
| StringBuilder sen = new StringBuilder(); | |
| int countsecutive = 0; | |
| for (int i = 0; i < str.length(); i++) { | |
| countsecutive++; | |
| if (i == str.length() - 1 || str.charAt(i) != str.charAt(i + 1)) { | |
| sen.append(str.charAt(i)); |
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
| package com.tei; | |
| public class Oneaway { | |
| boolean isOneAway(String str1, String str2) { | |
| if (str1.length() == str2.length()) { | |
| return isReplace(str1, str2); | |
| } | |
| if (str1.length() + 1 == str2.length()) { | |
| return isInsert(str1, str2); | |
| } |
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
| package com.tei; | |
| public class PalindromePermutation { | |
| public boolean isPermutationofPalindrome(String str) { | |
| String strlow = str.toLowerCase(); | |
| int[] arr=buildtable(strlow); | |
| return countOdd(arr); | |
| } | |
| boolean countOdd(int[] arr) { |
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
| public class URLify { | |
| public static void urlify(char[] str, int length) { | |
| int blank = 0; | |
| for (int i = 0; i < length; i++) { | |
| if (str[i] == ' ') { | |
| blank++; | |
| } | |
| } | |
| int back = length + blank * 2; | |
| for (int i = length - 1; i >= 0; i--) { |
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
| String sort(String s) { | |
| char[] content = s.toCharArray(); | |
| Arrays.sort(content); | |
| return new String(content); | |
| } | |
| boolean permutation1(String s, String t) { | |
| if (s.length() != t.length()) { | |
| return false; | |
| } |
NewerOlder