DSA-Bootcamp-Java
                                
                                
                                
                                    DSA-Bootcamp-Java copied to clipboard
                            
                            
                            
                        This repository consists of the code samples, assignments, and notes for the Java data structures & algorithms + interview preparation bootcamp of WeMakeDevs.
linne 18 it should be b[0]
fixed index going out of Bounds in ans method by increasing the end by 2 just times and not adding previous end
`public class BinarySearchInfiniteArray { public static void main(String[] args) { int[] array={3,5,7,9,10,90,100,130,140,160,170}; int target=10; int ans=infinitesearch(array,target); System.out.println(ans); } public static int infinitesearch(int[] arr, int target) { int i = 0;...
https://github.com/kunal-kushwaha/DSA-Bootcamp-Java/blob/325361dd2e9ab2d50bc7d2eeefada97d3d9db0d0/lectures/13-patterns/code/src/com/kunal/Main.java#L8C22-L8C22 Hello, I am writing this to let u know that the code for pattern 31 is slightly wrong when you are taking n=2n; the loop is running more times...
https://github.com/kunal-kushwaha/DSA-Bootcamp-Java/blob/325361dd2e9ab2d50bc7d2eeefada97d3d9db0d0/lectures/13-patterns/code/src/com/kunal/Main.java#L8C22-L8C22 Hello, I am writing this to let u know that the code for pattern 31 is slightly wrong when you are taking n=2*n; the loop is running more times...
Hi , Kunal i don't see the section of competitive programming questions. Have you removed it?