Coding & Algorithms interview questions

Showing 2521–2550 of 3276 results

• Convert integer to NAF formMedium

  This question evaluates understanding of number representations (Non-Adjacent Form), bit-level optimization, and formal proof techniques for demonstrating minimal Hamming weight, together with algorithmic complexity analysis.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count the Steps at Which Set Bits Form an Exact Prefix of OnesMedium

  Array problem: the bits of an all-zero binary string are set one at a time in the order given by a permutation; count the steps after which exactly the first i bits are set. It tests careful reasoning about prefix conditions and handling large inputs efficiently.

  SalesforceSoftware EngineerCoding & AlgorithmsOther
• Count the Ways to Split a Digit String into PrimesMedium

  Tests 1D dynamic programming combined with primality testing to count valid partitions of a digit string into prime segments modulo 10^9 + 7.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Delete Every Value That Repeats in an Unsorted Singly Linked ListMedium

  Linked list problem: delete every node whose value occurs more than once in an unsorted singly linked list, removing all copies and keeping the remaining nodes in their original order. It tests frequency counting, list traversal and careful handling of removals, including at the head of the list.

  SalesforceSoftware EngineerCoding & AlgorithmsOther
• Delete One Character Type to Minimize Unique SegmentsMedium

  Determine which single character type to delete from a string so that greedily partitioning the remaining characters into substrings with all-unique characters yields the minimum number of segments.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Design O(nm) grouping of rearranged stringsMedium

  This question evaluates a candidate's understanding of string manipulation, hashing and frequency-count techniques, algorithmic optimization, and time/space complexity analysis when grouping anagrams.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Determine minimal substitutions and removalsMedium

  This question evaluates string manipulation and adjacency-constraint handling in the first task and sequence analysis with minimal-removal and subsequence reasoning in the second, targeting competencies such as local transformation logic, subsequence recognition, and optimization under input constraints.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Diameter of an Undirected TreeMedium

  Tests your ability to traverse an unrooted, undirected tree to compute its diameter (longest simple path) in linear time and space.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Fewest Add-or-Subtract Power-of-Two Steps to Reduce n to ZeroMedium

  An integer problem: reduce a positive n to zero with the fewest operations, where each operation adds or subtracts a power of two. It tests reasoning about binary representations, proving a strategy optimal, and working safely with integers larger than 32 bits.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Fewest Repeat-Free Pieces After Deleting Every Copy of One LetterMedium

  A string problem: delete every occurrence of one chosen lowercase letter, then split what remains into the fewest contiguous pieces with no repeated letters. It tests reasoning about optimal partitions, evaluating every deletion choice efficiently, and edge cases on strings up to 200,000 characters.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Find a Celebrity from a Knows MatrixMedium

  Find a celebrity in a knows matrix with linear candidate elimination followed by complete verification that the candidate knows nobody and is known by everyone else.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Find a Valid Task Execution Order with DependenciesMedium

  Tests the ability to model workflow dependencies as a directed graph, perform topological sorting, and detect cycles.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Find the Kth Smallest Value in a Binary Search TreeMedium

  Return the one-based kth smallest value from a potentially deep binary search tree represented by parallel value and child-index arrays. Handle empty trees and out-of-range values of k using the specified sentinel.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Find the Lowest Common Ancestor Using Parent PointersMedium

  Find the lowest common ancestor of two nodes in an acyclic forest represented only by parent pointers. Return the node itself for equal inputs and minus one when the nodes belong to different trees.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Flatten Nested Objects and Lists into Full Leaf PathsMedium

  Implement an iterative traversal to flatten nested dictionaries and lists into fully-qualified paths leading only to string leaf values, returned in deterministic sorted order.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Generate All Balanced Parenthesis Strings with n Pairs in Sorted OrderMedium

  Return every balanced string made of n opening and n closing parentheses, for n up to 8, sorted in ascending lexicographic order. It tests systematic generation of combinatorial strings under a validity constraint, with an exact canonical ordering of the output.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Generate Every Generalized Abbreviation of a WordMedium

  Generate every generalized abbreviation of a lowercase word by replacing selected character runs with positive counts. Merge consecutive skipped characters correctly and return the complete result in lexicographic order.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Implement 64-bit modular exponentiation safelyMedium

  This question evaluates proficiency in modular arithmetic, safe 64‑bit integer operations, and algorithmic techniques for overflow‑resistant modular multiplication and exponentiation.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Merge Sort and Return a Sorted ArrayMedium

  Tests your ability to implement a classic divide-and-conquer merge sort algorithm from scratch, maintaining stability and achieving O(n log n) time complexity without relying on built-in sorting utilities.

  SalesforceMember of Technical StaffCoding & AlgorithmsOnsite
• Implement a traffic-light UI with JSMedium

  This question evaluates front-end web development competencies, including DOM manipulation, CSS-driven UI state, JavaScript timing and asynchronous state management for interactive components.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement an LFU cacheHard

  This question evaluates understanding of data structures and cache eviction policies, specifically frequency tracking for LFU caches and LRU tie-breaking among equal-frequency items.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Implement an LFU cache with O(1) operationsMedium

  This problem tests your ability to maintain multiple layers of linked data structures to achieve O(1) time complexity for both access and eviction in an LFU (Least Frequently Used) cache.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Implement common data-structure and JS tasksMedium

  This problem tests your ability to design a time-aware data structure, manipulate linked structures, and demonstrate mastery over JavaScript's asynchronous execution model and functional programming patterns.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Maximal Square and Longest Increasing SubsequenceMedium

  This problem tests proficiency with 2D dynamic programming for geometric pattern recognition and 1D dynamic programming for sequence optimization.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize events attended given date rangesMedium

  This problem tests your ability to solve a classic greedy interval scheduling variation by using sorting and a priority queue to maximize overlapping resource utilization.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimize operations to reduce integer to zeroMedium

  This problem tests your ability to optimize mathematical transformations on an integer using greedy strategies or dynamic programming by analyzing the parity and binary representation of the input.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Minimize steps to reduce integerMedium

  This question evaluates algorithm design skills and proficiency with integer operations and decision-making under parity constraints, testing competencies such as bitwise reasoning, greedy and dynamic-programming intuition, and complexity analysis.

  SalesforceSoftware EngineerCoding & AlgorithmsTechnical Screen
• Minimum Sum of Weekly Maximum CostsMedium

  Partition an array of daily costs into k contiguous weeks to minimize the sum of each week's maximum cost using dynamic programming.

  SalesforceSoftware EngineerCoding & AlgorithmsOnsite
• Remove duplicates and find constrained longest subsequenceEasy

  This problem tests your ability to manipulate linked structures to remove duplicates and your algorithmic efficiency in finding the longest string that satisfies two distinct containment constraints.

  SalesforceSoftware EngineerCoding & AlgorithmsOnline Assessment
• Remove duplicates from a singly linked listMedium

  This question evaluates understanding of singly linked list data structures and in-place node manipulation to remove repeated values while preserving relative order, testing competencies in pointer management and duplicate-detection.

  SalesforceSoftware EngineerCoding & AlgorithmsHR Screen