TechShiksha by Badkul Technology

Problem Statement Given an integer array nums sorted in non-decreasing order, remove the duplicates in place such that each unique element appears only once. The relative order of the elements should be kept the same. Return the new length of the array after duplicates are removed. Note: You must modify the input array in place with O(1) extra memory.

Guys! most of the questions in programming interviews are solved using 2 pointers. Go through this link

Best Explanation of 2 pointers https://www.linkedin.com/feed/update/urn:li:activity:7256698484798410754

🚀 Master Java with the Ultimate Cheat Sheet! 🚀 Looking to boost your Java skills or just need a quick reference? Check out this all-in-one Java Cheat Sheet! 📄 🔗 Access here: [Ultimate Java Cheat Sheet](https://www.linkedin.com/feed/update/urn:li:activity:7256664611981041665) This guide covers essential Java concepts, syntax, and best practices – perfect for both beginners and seasoned developers. 🌟 Happy coding! 💻 #Java #Programming #CheatSheet #CodingTips #JavaDevelopers #LearnJava

Find the number whose square value is nearest to the given number Given Number --> 47 Expected number--> 7 Explanation: 7*7=49, which is the nearest square value to 47

We are hiring for 4+ years Java Developer.

https://www.linkedin.com/posts/badkul-technology_java-springboot-remotework-activity-7250740548901240832-ZHez?utm_source=share&utm_medium=member_desktop Apply if you are eligible. Follow this page, soon freshers opening will be posted as well.

We have following openings with our client, if you fulfill the criteria connect with Admin or reply to this message

Follow our company page for more updates on hiring https://www.linkedin.com/company/badkul-technology/

We are hiring for various positions, looking for immediate joiners with 3+ experience 1. Java developer 2. React Developer 3. Automation tester 4. DB tester Send your resumes to connect@badkultech.com

We have openings for DB tester with our client, looking for 3+ experience.

3. Multithreading and Concurrency a. What is the difference between synchronized method and synchronized block? b. How does the volatile keyword work in Java? c. What is the difference between wait() and sleep() methods? d. What is a CountDownLatch in Java? How is it different from a CyclicBarrier? e. What is the Java Memory Model (JMM)? f. Explain ThreadLocal class and its use cases. g. How do you prevent deadlocks in Java multithreading?

2. Java Collections Framework a. What are the differences between ArrayList and LinkedList? b. How is HashMap internally implemented in Java? c. Explain the fail-fast and fail-safe behavior in Java collections. d. What is the difference between Set and List in Java? e. How do you make a collection thread-safe? f. How does TreeMap ensure ordering of elements?

1. Core Java Concepts a. What is the difference between == and equals() method in Java? b. Explain the concept of immutability. How is String class immutable? c. How does garbage collection work in Java? What are different garbage collectors? d. What are the different types of memory areas allocated by JVM? e. How does hashCode() and equals() work? f. What is the significance of final, finally, and finalize() in Java? g. What is volatile keyword in Java? h. What is the difference between HashMap and ConcurrentHashMap?