Syntax Practice Flashcards
Write a loop that prints out every key in the Map foo.
for (char c : freq.keySet()) {
System.out.println(“key: “ + c);
}
Define a ListNode class
- It will have a public int value
- It will have a public ListNode next
- Define a constructor that sets the value
public class ListNode {
int val;
ListNode next;
ListNode (int val) {
this.val=val;
}
}
Get a value from a HashMap foo with the key ‘b’.
foo.get(‘b’);
Write an if statement that prints “Hello” if the Map foo contains the character ‘a’.
if (freq.containsKey(‘a’)) {
System.out.println(“Hello”);
Write a function “print” for an int array “foo.”
- The function should print out each value.
public static void print (int[] array) {
for (int item : array) {
System.out.print(item + “ - “);
}
}
Write a function “fibonacci”
- The function can be iterative
- The function will take in a size of the fibonacci seq
- The function will return a new array of the fibonacci seq for those values
public static int[] fibonacci (int size) {
int[] result = new int[size];
for (int i = 0; i < size; i++) {
if (i == 0 || i == 1) {
result[i] = i;
} else {
result[i] = result[i-1] + result[i-2];
}
}
return result;
}
Iterate over int array foo and set foo[i] = i + 1.
for (int i = 0; i < foo.length; i++) {
foo[i] = i + 1;
}
Write a function print
- The function can be static
- The function will take in an ListNode head
- The function will print out every value
public static void print (ListNode head) {
while (head != null) {
System.out.print(head.val + “ “);
head = head.next;
}
}
Write a function “sum”
- The function will take in an int array “arr”
- The function will return the sum of all values
public static int sum (int[] array) {
int result = 0;
for (int item : array) {
result += item;
}
return result;
}
Declare an int Stack foo.
Stack<Integer> foo = new Stack<>();</Integer>
- Write a function “getLength”
- The function can be static
- The function will take in a ListNode head
- The function will return the length of the LinkedList
public static int getLength (ListNode head) {
int length = 0;
while (head != null) {
length++;
head= head.next;
}
return length;
}
Declare a char -> int HashMap foo.
HashMap<Character,Integer> foo = new HashMap<>();
Insert a char-int key-value pair into a HashMap called foo.
foo.put(‘a’,3);
Write a loop that prints out every value in the Map foo.
for (char c : foo.keySet()) {
System.out.println(“value: “ + foo.get(c));
}
Declare a new array foo of type int and length 5.
int[] foo = new int[5];
Write a function “reverse”
- The function will take in an int array “arr”
- The function will return a new array
public static int[] reverse (int[] array) {
int n = array.length;
int[] result = new int[n];
for (int i = 0; i < n; i++) {
result[i] = array[n - 1 - i];
}
return result;
}
Declare a new array bar of type int and length foo.length * 2.
int[] bar = new int[foo.length*2];
Write an if statement that prints “World” if the value for the character ‘a’ is greater than 5
if (freq.get(‘a’) > 5) {
System.out.println(“World”);
}
- Write a function “contains”
- The function can be static
- The function will take in an ListNode head
- The function will take in an int searchValue
- The function will return true if the LinkedList contains the value
public static boolean contains (ListNode head, int searchValue) {
while (head != null) {
if (head.val == searchValue) {
return true;
}
head = head.next;
}
return false;
}
Write a function to print a map
- The function can be static
- The function should take in a map
- The function should print out “{key} -> {value}”
public static void printMap (Map<Character,Integer> map) {
for (char
key : map.keySet()) {
System.out.println(key + “ -> “ + map.get(key));
}
}
Take an existing key from HashMap foo and add 1 to its value. If the key is not in foo set it’s value to 1.
freq.put(‘b’,freq.getOrDefault(‘b’,0)+1);
Write a function “indexOf”
- The function can be static
- The function will take in an int array “arr”
- The function will take in an int “searchValue”
- The function will return the index of the value, or -1 if not found
public static int indexOf (int[] array, int target) {
int result = -1;
for (int i = 0; i < array.length; i++) {
if ( array[i] == target) {
result = i;
return result;
}
}
return result;
}
Write a binary search function
- The function must find the index of a target number in an int array
- If the number is not found, return -1
public static int binarySearch (int[] nums, int target) {
int firstIndex = 0;
int lastIndex = nums.length-1;
while (firstIndex <= lastIndex) {
int middleIndex = (firstIndex + lastIndex) / 2;
if (nums[middleIndex] == target) {
return middleIndex;
}
if (nums[middleIndex] < target) {
firstIndex = middleIndex + 1;
}
if (nums[middleIndex] > target) {
lastIndex = middleIndex - 1;
}
}
return -1;
}
Write a print function for a singly linked list.
- The function will take in a ListNode head
- The function should print out the value of every node in the list
- ListNode definition:
public static class ListNode {
int val;
ListNode next;
}
public static void print (ListNode head) {
while (head != null) {
System.out.print(head.val + “ “);
head = head.next;
}
System.out.println();
}
Write a “contains” function for a singly linked list.
- The function will take in a ListNode head
- The function will take in an int searchValue
- The function will return true if the linked list contains the value
public static boolean contains (ListNode head, int searchValue) {
while (head != null) {
if (head.val == searchValue) {
return true;
}
head = head.next;
}
return false;
}
Write a “getLength” function for a singly linked list.
- The function will take in a ListNode head
- The function will return the number of nodes in the linked list
public static int getLength (ListNode head) {
int length = 0;
while (head != null) {
length++;
head= head.next;
}
return length;
}
Declare a String Builder called foo.
StringBuilder foo = new StringBuilder();
Given a String str, return the character that exists at index 4.
str.charAt(4);
Write a function that converts a String str into an array of characters.
public static char[] stringToCharArray (String str) {
char[] result = new char[str.length()];
for (int i = 0; i < str.length(); i++) {
result[i] = str.charAt(i);
}
return result;
}
Write a function that reverses a given Linked List
public static ListNode reverseLinkedList (ListNode head) {
ListNode prev = null;
ListNode current = head;
while (current != null) {
ListNode nextNode = current.next;
current.next = prev;
prev = current;
current = nextNode;
}
return prev;
}
