Salesforce Coding Interview Questions

Showing 15 problems of 100

• #81hardsometimes asked

  81. Median of Two Sorted Arrays

  Find the median of two sorted arrays in O(log(min(m, n))). Salesforce uses this as a stretch question to gauge advanced binary-search mastery.

  Solve →
• #82hardrarely asked

  82. Regular Expression Matching

  Implement regular expression matching with '.' and '*'. Salesforce uses this as a 2D-DP stress test — they grade on whether you can handle the star's variable-length match.

  Solve →
• #84hardrarely asked

  84. Reverse Nodes in k-Group

  Reverse every k consecutive nodes in a linked list, leaving the trailing remainder untouched. Salesforce uses this as a pointer-acrobatics stress test.

  Solve →
• #85hardrarely asked

  85. Substring with Concatenation of All Words

  Find all starting indices where a concatenation of all given words appears. Salesforce uses this as an advanced sliding-window with multiplicity tracking.

  Solve →
• #86hardrarely asked

  86. Longest Valid Parentheses

  Find the longest valid (well-formed) parentheses substring. Salesforce uses this as a stack/DP hybrid that tests both approaches.

  Solve →
• #87hardsometimes asked

  87. First Missing Positive

  Find the smallest positive integer missing from an unsorted array in O(n) time and O(1) space. Salesforce uses this as an O(1)-space cyclic-sort stress test.

  Solve →
• #89hardrarely asked

  89. Wildcard Matching

  Implement wildcard pattern matching with '?' and '*'. Salesforce uses this in their permission-set glob matching for object access rules.

  Solve →
• #90hardrarely asked

  90. Jump Game II

  Find the minimum number of jumps to reach the last index. Salesforce uses this as a greedy stress test — they grade on the BFS-level insight.

  Solve →
• #91hardrarely asked

  91. N-Queens

  Place n queens on an n x n chessboard so no two attack each other; return all distinct solutions. Salesforce uses this as the canonical hard backtracking problem.

  Solve →
• #92hardrarely asked

  92. N-Queens II

  Count the number of distinct N-queens placements without returning the actual boards. Salesforce uses this to test whether you can specialize an enumeration algorithm.

  Solve →
• #94hardrarely asked

  94. Valid Number

  Determine if a string represents a valid number. Salesforce uses this to test edge-case enumeration and finite-state-machine reasoning.

  Solve →
• #95hardrarely asked

  95. Text Justification

  Format text such that each line has exactly maxWidth characters with full justification. Salesforce uses this as a string-manipulation stress test.

  Solve →
• #97hardsometimes asked

  97. Largest Rectangle in Histogram

  Find the largest rectangle in a histogram. Salesforce uses this as the canonical monotonic-stack problem.

  Solve →
• #98hardrarely asked

  98. Maximal Rectangle

  Find the largest rectangle of 1s in a binary matrix. Salesforce uses this to test the row-by-row histogram reduction.

  Solve →
• #100hardrarely asked

  100. Word Ladder

  Find the shortest transformation sequence from beginWord to endWord changing one letter at a time. Salesforce uses this as a BFS-on-implicit-graph stress test.

  Solve →