• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

How strtok() Works

April 13, 2015 by Dhaval Dave

strtok() : Split string into tokens
Syntax :

char * strtok ( char * str, const char * delimiters );

Parameters
str C string to truncate.Notice that this string is modified by being broken into smaller strings (tokens). Alternativelly, a null pointer may be specified, in which case the function continues scanning where a previous successful call to the function ended.

delimiters   C string containing the delimiter characters. These can be different from one call to another.

Example

/* strtok example */
 #include <stdio.h>
 #include <string.h>
int main (){
char str[] ="- This, a sample string.";
char * pch;
printf ("Splitting string \"%s\" into tokens:\n",str);
pch = strtok (str," ,.-");
while (pch != NULL){
printf ("%s\n",pch);
pch = strtok (NULL, " ,.-");
}
return 0;
}

code courtesy : cplusplus.com

Why Function strtok() is not Thread Safe / reentrant

The strtok() function uses a intermediate static buffer while parsing, and reuse them at each call so it’s not thread safe.

Solution :

Use  strtok_r() to use strtok as thread safe

 

Similar Articles

Filed Under: Adobe Interview Questions, problem Tagged With: c, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

The greedy coins game Dynamic Programming

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Given Set of words or A String find whether chain is possible from these words or not

Naurki.com Security Breach

Trie Dictionary

SAP Off Campus Hiring_ March 2015 Computer Skills

SAP Off Campus Hiring_ March 2015 Verbal Skills

Maximum size of square sub matrix with all 1’s in a binary matrix

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Best Java Book | Top Java Programming Book for Beginners

Count Possible Decodings of a given Digit Sequence

SAP Interview Questions

CodeChef’ RRCOPY

Test Cases for Round Function

Fibonacci Hashing & Fastest Hashtable

K’th Largest Element in BST when modification to BST is not allowed

Wrong Directions given find minimum moves so that he can reach to the destination

Find Nearest Minimum number in left side in O(n)

Python Dictionaries

1014 Practice Question of New GRE – Princeton

Minimum insertions to form a palindrome

Find the number ABCD such that when multipled by 4 gives DCBA.

Find Percentage of Words matching in Two Strings

Edit Distance ( Dynamic Programming )

BlueStone E-commerce Interview Experience

Check Binary Tree is Binary Search Tree or not

Trapping Rain Water

Implement a generic binary search algorithm for Integer Double String etc

Daughter’s Age VeryGood Puzzle

Copyright © 2025 · Genesis Framework · WordPress · Log in