There are many schools of thought around successful project management, but few as highly regarded as the Six Sigma and Lean methods. With 37 hours of learning, this training will explain concrete processes for increasing efficiency and limiting wasted time and effort.
Java EE
17K
Solutions
6
Articles & Videos
8K
Contributors
Java Enterprise Edition (Java EE) is a specification defining a collection of Java-based server and client technologies and how they interoperate. Java EE specifies server and client architectures and uses profiles to define technology sets targeted at specific classes of applications. All Java EE profiles share a set of common features, such as naming and resource injection, packaging rules and security requirements.
Refine results
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. check the given string starts with hi and does not have x infront of it
2.if true increment by 1 and call r…
74 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
I am not clear on below description. please advise
Recursion-1 > countPairs
prev | next | chance
We'll s…
75 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. check if str has sub string if yes increment by 1 or repeat
I wrote my code as below and not passing all…
39 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. check the array length 0 or 1 then retun 0
2.else if string does not consist of 11 return 0
3.else incre…
615 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
I wrote as below and failing some tests.
Expected Run
countAbc("abc") → 1 0 X
countAbc("abcxxabc") → 2 0 X
cou…
913 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
Recursion-1 > nestParen
prev | next | chance
Given a string, return true if it is a nesting of zero or more pairs of…
413 views
Hi,
I am working on below challenge and not cclear on description. please advise
http://codingbat.com/prob/
Recursion-1 > array220
prev | next | chance
Given an array of ints, c…
89 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. create new array of the portion of original array length
2. check to see if if given index has 1 and next…
1618 views
Hi,
I am going through below challenge
Recursion-1 > parenBit
prev | next | chance
Given a string that contains a single pair of parenthesis, compute recursively a new string made of only…
314 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. check the array length 0 or 1 then retun same str
2.else return string with * in between for repeated pair…
213 views
Highfive is so simple that setting up every meeting room takes just minutes and every employee will be able to start or join a call from any room with ease. Never be called into a meeting just to get it started again. This is how video conferencing should work!
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. check the array length 0 or 1 then retun same str
2.else return string with * in between for repeated pair…
28 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. check the array length 0 or 1 then retun same str
2.else return string with first character concatenated w…
19 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
Psedo code:
1. if array length is zero return ""
2. if array length is 1 and it is x return ""
3. if array length is 1 a…
1729 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
Psedo code:
1. if array length is zero return ""
2. if array length is 1 return same str
3. else find location of pi …
1536 views
We try to print from this link:
http://coupons2.smartsourc
We get different errors depending on which browser we use.
FF gets "the plugin has vulner…
1312 views
HI,
I develop web applications on spring. Recently there was a requirement of creating an application which will show list of all notes created in a chat.
I started working on it.. And came across t…
425 views
Hi,
I am working on below challenge.
http://codingbat.com/prob/
Psedo code:
1. create new array of the portion of original array length
2. fill new array with rest of the elements
3. ch…
627 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
Psedo code:
1. if array length is zero return 0
2. if array length is 1 and it is x return x
3. if array length is 1 and…
1320 views
Hi,
When we use return in catch statement. I never used return in catch statement myself but saw a code like that. Wondering why we use return in catch block after some system out statement giving …
119 views
CompTIA aims to adapt its A+ Certification to reflect the most current knowledge and skills needed by today's IT professionals--and this year's 2016 exam is harder than ever. This certification is one of the most highly-respected and sought after in IT.
Hi,
I am working on below challenge
http://codingbat.com/prob/
Given a string, compute recursively (no loops) the number of times lowercase "hi" appears in the string.
countHi("xxhixx…
2536 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
Given a string, compute recursively (no loops) the number of lowercase 'x' chars in the string.
countX("xxhixx") → 4
co…
2231 views
I am using Spring MVC framework to develop my Java Web application.
I put a config.properties under src/main/resources.
(CODE)
In my Spring MVC controller, I use code like below to retrieve the con…
416 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
Given a non-negative int n, compute recursively (no loops) the count of the occurrences of 8 as a digit, except that an 8 w…
1334 views
Hi,
I am going through below challenge.
http://codingbat.com/prob/
I have not understood below description
Recursion-1 > bunnyEars2
prev | next | chance
We have bunnies sta…
625 views
Hi,
I am working on below challenge
http://codingbat.com/prob/
We have a number of bunnies and each bunny has two big floppy ears. We want to compute the total number of ears across al…
628 views
201506-LO-Top-001
