• 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

Implement LRU Cache

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Convert number to words java

DFS (Depth First Search)

Add Sub Multiply very large number stored as string

Maximum sum contiguous subarray of an Array

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Calculate price of parking from parking start end time prices

Find min element in Sorted Rotated Array (With Duplicates)

Find loop in Singly linked list

Linked List V/S Binary Search Tree

Handle duplicates in Binary Search Tree

Generate largest number arranging a no. of given non negative integer numbers

Code Chef PRGIFT Solution

Connect n ropes with minimum cost

Templates in C++

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Python String and numbers

Regular Expression Matching

Edit Distance ( Dynamic Programming )

Find and print longest consecutive number sequence in a given sequence in O(n)

Maximum of all subarrays of size k

SAP Off Campus Hiring_ March 2015 Sample Questions

Diagonal Traversal of Binary Tree

Difference between a LinkedList and a Binary Search Tree BST

Find Pythagorean Triplets in an array in O(N)

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

Get K Max and Delete K Max in stream of incoming integers

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

Copyright © 2026 · Genesis Framework · WordPress · Log in