Skip to main content

Java Interview - Code Snippets to remember

By
Before going to a java interview it's best to remember a few coding snippets that would greatly help you to compose your coding interview answers.  Here are some coding snippets I have reached to, I encourage you to add in comments other snippets you think are important.


  1. String
    1. char c = s.charAt(2); // get char at location 2.
    2. “hamburger”.substring(4,8) // startindex0 so from idx 4 to idx 8
  2. Use StringBuilder for new string building setCharAt .append
  3. Map
    1. map.containsKey(k) // check if k is in map
    2. 537 % 10 # => 7 extract first digit from number
    3. 537 / 10 # => 53 remove first digit from number
  4. List
    1. add(index, element)
    2. set(index, element)
    3. remove(index)
  5. Random
  6. new Random.nextInt(10) // 0 - 9 (exclusive)
  7. Queue,Stack - start using those data structures!!
  8. Arrays:
    1. Copy
      1. System.arraycopy(source, startindex, dest, startindex, nToCopy)
    2. Print
      1. Arrays.toString(d.getArr())

BOOK: "Elements of Programming Interviews in Java: The Insiders' Guide" This is the best book I have found on java interview tips, if you are looking to concentrate on java this is by far the best resource on the subject.



Labels:

Comments

Post a Comment

Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

By
Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is
14 comments
Read more

Alternatives to Using UUIDs

By
  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,
Post a Comment
Read more

Bellman Ford Graph Algorithm

By
The Shortest path algorithms so you go to google maps and you want to find the shortest path from one city to another.  Two algorithms can help you, they both calculate the shortest distance from a source node into all other nodes, one node can handle negative weights with cycles and another cannot, Dijkstra cannot and bellman ford can. One is Dijkstra if you run the Dijkstra algorithm on this map its input would be a single source node and its output would be the path to all other vertices.  However, there is a caveat if Elon mask comes and with some magic creates a black hole loop which makes one of the edges negative weight then the Dijkstra algorithm would fail to give you the answer. This is where bellman Ford algorithm comes into place, it's like the Dijkstra algorithm only it knows to handle well negative weight in edges. Dijkstra has an issue handling negative weights and cycles Bellman's ford algorithm target is to find the shortest path from a single node in a graph t
1 comment
Read more