Search Results

Strings are immutable, cannot be changed. Java is relatively slow at allocating/cleaning memory, try to avoid it. Java can 'inline' method calls and make methods really fast. …

Complexity Pedantically, the time-complexity is \$ O( m \times n ) \$, where m is str.length and n is substr.length. This matters when \$ \left| m-n \right| \$ is large. The Space complexity is \$ O …

Your problem is an interesting one,but your solution is not a great use of regular expressions, since there's the better option of using the 'word boundary' anchor \b. The boundary anchor matches a t …

Your code looks functional, and, if this was for early versions of Java, it would be quite typical and standard. The String.format process can do so much more than what you are using it for, though. …

Fast comes at a price.... code complexity and perhaps readability. Assuming that your code produces the right results now.... and it is a big assumption because: it expects the word to be at the be …

For an interview, I really would not hold your answer against you, but, for your interest, if you sort the letters in the term, and then sort the letters in the same-length words, if the resulting strings …

This question provides a really good example of how learning 'tools' is important, but understanding efficiency is better. The purpose of the task was probably to teach you to use a stack, but there …

In Java, and in Code Review, the preference is for creating both highly readable, and highly efficient code. It is an almost bizarre fact, that one leads to the other. your code has one efficiency, …

Midpoint math is often a pain in the whatnot, but a real trick is to add 1 to the length before halving it. Additionally, instead of repeating the math multiple times, you can do it just once. def si …

There are a number of things in here you have done well, and your algorithm is good. I like that you have created an object to contain the frequency. Using the HashMap is the right solution too. Over …

This problem begs for recursion.... private static final void checkWord(char[] chars, char[]current, int len, List<String> results) { if (len == chars.length) { final String result = new …

This is a nice short piece of code, though it has a number of 'features' which can be improved. Code Style Java code style recommends a lower-case letter to start method names.... Puzzle should be p …

Since you are using printf to output the spaces, you may as well use a specific printf format for the output. Here's a replacement function: centerQ(){ textsize=${#1} width=$(tput cols) span=$ …

Your code here is far more complicated than it needs to be. The trick you need to follow is four-fold: Use your library functionality Use Regular Expressions Use buffered input/output for performanc …

Bug Your code has an integer-division/multiplication problem/bug. Consider the dice-roll specification 10d10+0. Your code will parse this down to: string dicePart1 = "10"; string dicePart2 = "10"; …