Blog Archives

01: String parsing & date formatting – complete the given code

Q. Complete the method “changeDateFormat(String paragraph)” which takes a string input containing dates in mm/dd/yyyy format and converts them to “dd/mm/yyyy” format. For example, “My birthday is on 04/25/1980” becomes “My birthday is on 25/04/1980



02: Working with Java Collections – Complete the given code

Q. Complete the method “canAttendAll(Collection seminars)” which takes a collection of seminar objects with start and end timestamps, and the method should determine if there is an overlap in seminars events. In other words, if you can attend all the seminars.



03: Tree navigation – is a BST Tree?

Q. Complete the method “isValidBST(Node root)” which takes a “Tree node” as an input to evaluate if the input is a valid BST (i.e. Binary Search Tree)?



04: Are Anagrams – Complete the given code

Q. Complete the “areAnagrams(String a, String b)” method so that it returns if two given input strings are anagram or not?



05: Is a palindrome – complete the given code

Q. Complete the method “isPalindrome(String str) ” which takes a “string” as an input to evaluate if the input is a palindrome?



06: Change Dir Path – String parsing & working with collections

Q. Complete the method ” public DirPath cd(String newPath)” which applies the following rules: /   : starting with “/” means root directory, else next directory path. ../ : means go up one directory.



07: Index of long consecutive characters in a string – flow control

Q. Complete the method “int startIndexOfLongestRun(String input)” that returns the start index of a character that has the longest consecutive count.



08: Jumping Frog problem in Java – Complete the given code

Q. Complete the method “int numberOfWays(int n)” where n is the distance to cover and the method should return the number of possible combinations if a frog can jump 1 or 2 steps at a time.



09: Find all permutations of a given string – best example to understand recursion

Q. Complete the method “Set getAllCombinations(String input) ” where input is any string and the method should return all possible combinations of a given string.



10: Find all permutations of a given string – Iteration in Java

Q. Complete the method “Set getAllCombinations(String input) ” where input is any string and the method should return all possible combinations of a given string.



11: Threads performing tasks by talking to each other

Q. Given the following code



12: Complete the trades matching logic

Q. Given the following code



13: Atomicity, Visibility, & synchronization in Java

Q. Given the following code, Client



300+ Java & Big Data FAQs - Quick Prep

Java & Big Data Tutorials

Top