Leetcode has a huge number of test cases and questions from interviews too like Google, Amazon, Microsoft, Facebook, Adobe, Oracle, Linkedin, Goldman Sachs, etc. LeetCode helps you in getting a job in Top MNCs. To crack FAANG Companies, LeetCode problems can help you in building your log...
0187-repeated-dna-sequences.cpp 0189-rotate-array.cpp 0190-reverse-bits.cpp 0191-number-of-1-bits.cpp 0198-house-robber.cpp 0199-binary-tree-right-side-view.cpp 0200-number-of-islands.cpp 0202-happy-number.cpp 0203-remove-linked-list-elements.cpp 0205-Isomorphic-Strings.cpp 0205-isomorphic-...
classSolution {booleancheck(String s,inti){//check each gapintj = 0;while(j+i <s.length()){if(s.charAt(j) != s.charAt(j+i))returnfalse;//copare each characters !!! j++; }returntrue; }publicbooleanrepeatedSubstringPattern(String s) {if(s==null|| s.length() == 1)returnfalse;...
Integer>();publicvoidadd(intnumber){if(elements.containsKey(number)){elements.put(number, elements.get(number)+1);}else{elements.put(number,1);}}publicbooleanfind(intvalue){for(Integeri:elements.keySet()){inttarget=value-i;if(elements.containsKey(target)){if(i==target&&elements.get(target)<...